Abstract
In this paper, we address the issue of mining frequent disjunctive selection queries in a given relational table. To do so, we introduce a level-wise algorithm to mine such queries whose selection condition is minimal. Then, based on these frequent minimal queries, and given any disjunctive selection query, we are able to decide whether its frequent or not. We carried out experiments on synthetic and real data sets that show encouraging results in terms of scalability. © 2011 Springer-Verlag Berlin Heidelberg.
Author supplied keywords
Cite
CITATION STYLE
Hilali-Jaghdam, I., Jen, T. Y., Laurent, D., & Ben Yahia, S. (2011). Mining frequent disjunctive selection queries. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6861 LNCS, pp. 90–96). https://doi.org/10.1007/978-3-642-23091-2_8
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
