 |
|
|
Query Flocks: A Generalization of Association-Rule Mining |
Full Paper (PDF)
|
Association-rule mining has proved a highly successful technique for extracting useful information from very large databases. This success is attributed not only to the appropriateness of the objectives, but to the fact that a number of new query-optimization ideas, such as the "a-priori" trick, make association-rule mining run much faster than might be expected. In this paper we see that the same tricks can be extended to a much more general context, allowing efficient mining of very large databases for many different kinds of patterns. The general idea, called "query flocks," is a generate-and-test model for data-mining problems. We show how the idea can be used either in a general-purpose mining system or in a next generation of conventional query optimizers. |
References, where available, link to the DBLP on the World Wide Web.
[AHV95]Serge Abiteboul, Richard Hull, Victor Vianu:
Foundations of Databases.
Addison-Wesley 1995, ISBN 0-201-53771-0
Contents[AIS93]Rakesh Agrawal, Tomasz Imielinski, Arun N. Swami:
Mining Association Rules between Sets of Items in Large Databases.
SIGMOD Conference 1993: 207-216[AS94]Rakesh Agrawal, Ramakrishnan Srikant:
Fast Algorithms for Mining Association Rules in Large Databases.
VLDB 1994: 487-499[CM77]Ashok K. Chandra, Philip M. Merlin:
Optimal Implementation of Conjunctive Queries in Relational Data Bases.
STOC 1977: 77-90[G*79]Patricia G. Selinger, Morton M. Astrahan, Donald D. Chamberlin, Raymond A. Lorie, Thomas G. Price:
Access Path Selection in a Relational Database Management System.
SIGMOD Conference 1979: 23-34[GHQ95]Ashish Gupta, Venky Harinarayan, Dallan Quass:
Aggregate-Query Processing in Data Warehousing Environments.
VLDB 1995: 358-369[HS95]Maurice A. W. Houtsma, Arun N. Swami:
Set-Oriented Mining for Association Rules in Relational Databases.
ICDE 1995: 25-33[Klu82]Anthony C. Klug:
Equivalence of Relational Algebra and Relational Calculus Query Languages Having Aggregate Functions.
JACM 29(3): 699-717(1982)[LS93]Alon Y. Levy, Yehoshua Sagiv:
Queries Independent of Updates.
VLDB 1993: 171-181[Man97]Heikki Mannila:
Methods and Problems in Data Mining.
ICDT 1997: 41-55[Ull88]Jeffrey D. Ullman:
Principles of Database and Knowledge-Base Systems, Volume I.
Computer Science Press 1988, ISBN 0-7167-8158-1
[Ull89]Jeffrey D. Ullman:
Principles of Database and Knowledge-Base Systems, Volume II.
Computer Science Press 1989, ISBN 0-7167-8162-X
[UW97]Jeffrey D. Ullman, Jennifer Widom:
A First Course in Database Systems.
Prentice-Hall 1997, ISBN 1-13-861337-0
[ZO93]Xubo Zhang, Z. Meral Özsoyoglu:
On Efficient Reasoning with Implication Constraints.
DOOD 1993: 236-252
Referenced By:
- Sunita Sarawagi, Shiby Thomas, Rakesh Agrawal:
Integrating Mining with Relational Database Systems: Alternatives and Implications.
SIGMOD Conference 1998: 343-354
|
@inproceedings{DBLP:conf/sigmod/TsurUACMNR98,
author = {Dick Tsur and
Jeffrey D. Ullman and
Serge Abiteboul and
Chris Clifton and
Rajeev Motwani and
Svetlozar Nestorov and
Arnon Rosenthal},
editor = {Laura M. Haas and
Ashutosh Tiwary},
title = {Query Flocks: A Generalization of Association-Rule Mining},
booktitle = {SIGMOD 1998, Proceedings ACM SIGMOD International Conference
on Management of Data, June 2-4, 1998, Seattle, Washington, USA},
publisher = {ACM Press},
year = {1998},
isbn = {0-89791-955-5},
pages = {1-12},
crossref = {DBLP:conf/sigmod/98},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
|
DBLP: Copyright ©1999 by Michael Ley (ley@uni-trier.de).
|
|
