|
Title
|
|
|
|
Mining frequent conjunctive queries in relational databases through dependency discovery
|
|
|
Author
|
|
|
|
|
|
|
Abstract
|
|
|
|
| We present an approach for mining frequent conjunctive in arbitrary relational databases. Our pattern class is the simple, but appealing subclass of simple conjunctive queries. Our algorithm, called Conqueror(+), is capable of detecting previously unknown functional and inclusion dependencies that hold on the database relations as well as on joins of relations. These newly detected dependencies are then used to prune redundant queries. We propose an efficient database-oriented implementation of our algorithm using SQL and provide several promising experimental results. |
|
|
|
Language
|
|
|
|
English
|
|
|
Source (journal)
|
|
|
|
Knowledge and information systems: an international journal. - London
|
|
|
Publication
|
|
|
|
London
:
2012
|
|
|
ISSN
|
|
|
|
0219-1377
[print]
0219-3116
[online]
|
|
|
DOI
|
|
|
|
10.1007/S10115-012-0526-5
|
|
|
Volume/pages
|
|
|
|
33
:3
(2012)
, p. 655-684
|
|
|
ISI
|
|
|
|
000310871700007
|
|
|
Full text (Publisher's DOI)
|
|
|
|
|
|
|
Full text (publisher's version - intranet only)
|
|
|
|
|
|