|
455
|
The Ubiquitous B-tree
– Comer
- 1979
|
|
212
|
Verkamo. Fast discovery of association rules
– Agrawal, Mannila, et al.
- 1996
|
|
184
|
A:Pfeffer, Generalized Search Trees for Database Systems
– Hellerstein
- 1995
|
|
173
|
A database perspective on knowledge discovery
– IMIELINSKI, MANNILA
- 1996
|
|
121
|
Psaila G., A New SQL-like Operator for Mining Association Rules
– Ceri, Meo
- 1996
|
|
93
|
Scalable algorithms for association mining
– Zaki
|
|
85
|
DMQL: A Data Mining Query Language for Relational Databases
– Han, Fu, et al.
- 1996
|
|
50
|
Using a hash-based method with transaction trimming for mining association rules
– Park, Chen, et al.
- 1997
|
|
49
|
Developing tightly-coupled data mining applications on a relational database system
– Agrawal, Shim
- 1996
|
|
45
|
MSQL: A query lan-guage for database mining
– Imielinski, Virmani
- 1999
|
|
41
|
Berkeley DB
– Olson, Bostic, et al.
- 1999
|
|
19
|
Data Organization and Access for Efficient Data Mining
– Dunkel, Soparkar
- 1999
|
|
17
|
In-dependent, open enterprise data integration
– Hellerstein, Stonebraker, et al.
|
|
15
|
Integrat-ing association rule mining with databases: alternatives and implications
– Sarawagi, Thomas, et al.
- 1998
|
|
14
|
Mining association rules: Deriving a superior algorithm by analysing today's approaches.In
– Hipp, Guntzer, et al.
|
|
13
|
Query Flocks: A Generalization of Association Rule Mining
– Tsur, Ullman, et al.
- 1998
|
|
2
|
The UCI KDD Archive (kdd.ics.uci.edu
– Bay
|
|
2
|
Optimizing Jan Jannink’s implementation of B+-tree deletion
– Maelbrancke, Olivie
- 1995
|
|
1
|
Implementing deletion in � � -trees
– Jannink
- 1995
|
|
1
|
Systems support for scalable data mining
– Maniatty, Zaki
- 2001
|
