Query Flocks: A Generalization of Association-Rule Mining

Summary: Query Flocks generalizes association-rule mining to a class of patterns via a generate-and-test framework for data. In Datalog, query-safety enumerates candidates for a generalized a-priori, enabling cost-based optimization or dynamic pruning during execution. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: h5153c4e43e3d054c
Venue: SIGMOD
Year: 1998
Pagerank: 8.6716957e-05
Overall Rank: 2,301 | 84.54%
DOI: 10.1145/276304.276306

Incoming Non-self Citations Over Time

Authors

1. Dick Tsur (Hitachi)
2. Jeffrey D. Ullman (Stanford University)
3. Serge Abiteboul (INRIA; Stanford University)
4. Chris Clifton (The MITRE Corporation)
5. Rajeev Motwani (Stanford University)
6. Svetlozar Nestorov (Stanford University)
7. Arnon Rosenthal (The MITRE Corporation)

BibTeX Citation

@inproceedings{tsur_sigmod98,
        title = {{Query Flocks: A Generalization of Association-Rule Mining}},
        author = {Tsur, Dick and Ullman, Jeffrey D. and Abiteboul, Serge and Clifton, Chris and Motwani, Rajeev and Nestorov, Svetlozar and Rosenthal, Arnon},
        series = {{SIGMOD} '98},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/276304.276306},
        url = {https://dl.acm.org/doi/10.1145/276304.276306},
        year = {1998}
}

Incoming Citations (Sorted by Pagerank)

Showing 10 of 10 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
1,006	Integrating Association Rule Mining with Relational Database Systems: Alternatives and Implications	1998	SIGMOD	0.00012573124
1,561	Exploratory Mining and Pruning Optimizations of Constrained Association Rules	1998	SIGMOD	0.00010240418
4,180	Traversing Itemset Lattices with Statistical Metric Pruning	2000	PODS	6.7554731e-05
5,084	Optimization of Constrained Frequent Set Queries with 2-variable Constraints	1999	SIGMOD	6.2834723e-05
5,632	Combi-Operator – Database Support for Data Mining Applications	2003	VLDB	6.0581466e-05
6,020	The 3W Model and Algebra for Unified Data Mining	2000	VLDB	5.9129763e-05
6,056	Perturbation Analysis of Database Queries	2016	VLDB	5.9016482e-05
6,103	Extracting large-scale knowledge bases from the web	1999	VLDB	5.8864128e-05
6,854	Exploratory Mining via Constrained Frequent Set Queries	1999	SIGMOD	5.6644118e-05
8,023	Optimizing Iceberg Queries with Complex Joins	2017	SIGMOD	5.4054487e-05

Outgoing Citations (Sorted by Pagerank)

Showing 4 of 4 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank	Cited Paper	Year	Venue	Pagerank
1	Access Path Selection in a Relational Database Management System	1979	SIGMOD	0.0023947656
13	Mining Association Rules between Sets of Items in Large Databases	1993	SIGMOD	0.00064420972
29	Fast Algorithms for Mining Association Rules	1994	VLDB	0.0005121339
875	Queries Independent of Updates	1993	VLDB	0.00013316445

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	1,561	Exploratory Mining and Pruning Optimizations of Constrained Association Rules	1998	SIGMOD
2	5,084	Optimization of Constrained Frequent Set Queries with 2-variable Constraints	1999	SIGMOD
3	4,069	Dynamically Optimizing Queries over Large Scale Data Platforms	2014	SIGMOD
4	13,406	Semigroup techniques in recursive query optimization	1990	PODS
5	6,668	Query Optimization over Crowdsourced Data	2013	VLDB
6	3,214	Efficient and Provable Multi-Query Optimization	2017	PODS
7	2,551	Aggregation and Relevance in Deductive Databases	1991	VLDB
8	473	Sampling Large Databases for Association Rules	1996	VLDB
9	573	An Efficient Algorithm for Mining Association Rules in Large Databases	1995	VLDB
10	4,231	A New SQL-like Operator for Mining Association Rules	1996	VLDB