Towards Efficient Metaquery Generator

9 pages•Published: November 18, 2018

Tamar Bash and Rachel Ben-Eliyahu-Zohary

Abstract

Metaquery (MQ) is a datamining tool for inferring relations between data items over a relational database. The concept of MQ leads to autonomous discovery of logical rules involving the database tables. A central module of any MQ system is the MQ generator, which automatically generates all possible MQs to be tested against a database. The MQ generator is supposed to work in an efficient manner, while not missing any meaningful MQ. In this paper we present an algorithm for MQ generation that works as a search algorithm in which the states are all possible MQs, and the search tree is pruned whenever possible. Preliminary experiments prove that, indeed, the approach we take leads to a significant reduction in computation resources.

Keyphrases: data mining, metaqueries, relational database

In: Gilles Barthe, Konstantin Korovin, Stephan Schulz, Martin Suda, Geoff Sutcliffe and Margus Veanes (editors). LPAR-22 Workshop and Short Paper Proceedings, vol 9, pages 49-57.

Links:	https://easychair.org/publications/paper/BhmH
	https://doi.org/10.29007/xxcr

BibTeX entry

@inproceedings{LPAR-IWIL2018:Towards_Efficient_Metaquery_Generator,
  author    = {Tamar Bash and Rachel Ben-Eliyahu-Zohary},
  title     = {Towards Efficient Metaquery Generator},
  booktitle = {LPAR-22 Workshop and Short Paper Proceedings},
  editor    = {Gilles Barthe and Konstantin Korovin and Stephan Schulz and Martin Suda and Geoff Sutcliffe and Margus Veanes},
  series    = {Kalpa Publications in Computing},
  volume    = {9},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2515-1762},
  url       = {/publications/paper/BhmH},
  doi       = {10.29007/xxcr},
  pages     = {49-57},
  year      = {2018}}

Download PDF Open PDF in browser