Cache-conscious Frequent Pattern Mining on a Modern Processor

Summary: Identifies poor locality and low ILP as key bottlenecks in frequent-pattern mining on modern CPUs. A cache-conscious prefix tree, tiling, and cache-reusing fine-grained threading deliver up to 4.8× speedup over state of the art. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID: h93f141c1f91675e6
Venue: VLDB
Year: 2005
Pagerank: 6.8217193e-05
Overall Rank: 4,042 | 72.91%
DOI: -

Incoming Non-self Citations Over Time

Authors

1. Amol Ghoting (Ohio State University)
2. Gregory Buehrer (Ohio State University)
3. Srinivasan Parthasarathy (Ohio State University)
4. Daehyun Kim (Intel)
5. Anthony Nguyen (Intel)
6. Yen-Kuang Chen (Intel)
7. Pradeep Dubey (Intel)

BibTeX Citation

@article{ghoting_vldb05,
        title = {{Cache-conscious Frequent Pattern Mining on a Modern Processor}},
        author = {Ghoting, Amol and Buehrer, Gregory and Parthasarathy, Srinivasan and Kim, Daehyun and Nguyen, Anthony and Chen, Yen-Kuang and Dubey, Pradeep},
        journal = {PVLDB},
        series = {{VLDB} '05},
        year = {2005}
}

Incoming Citations (Sorted by Pagerank)

Showing 4 of 4 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
1,169	DimmWitted: A Study of Main-Memory Statistical Analytics	2014	VLDB	0.00011690039
1,440	Speedup Graph Processing by Graph Ordering	2016	SIGMOD	0.00010630613
8,403	ADDICT: Advanced Instruction Chasing for Transactions	2014	VLDB	5.3232923e-05
12,994	Optimization of Frequent Itemset Mining on Multiple-Core Processor	2007	VLDB	4.9605343e-05

Outgoing Citations (Sorted by Pagerank)

Showing 13 of 13 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank
13	Mining Association Rules between Sets of Items in Large Databases	1993	SIGMOD	0.0006440069
29	Fast Algorithms for Mining Association Rules	1994	VLDB	0.00051028332
68	Making B+-Trees Cache Conscious in Main Memory	2000	SIGMOD	0.00037861537
77	Cache Conscious Algorithms for Relational Query Processing	1994	VLDB	0.00036821827
111	DBMSs On A Modern Processor: Where Does Time Go?	1999	VLDB	0.00032621499
165	Mining Frequent Patterns without Candidate Generation	2000	SIGMOD	0.00027323925
209	Cache Conscious Indexing for Decision-Support in Main Memory	1999	VLDB	0.00024915373
251	An Effective Hash-Based Algorithm for Mining Association Rules	1995	SIGMOD	0.00023079256
548	Improving Index Performance through Prefetching	2001	SIGMOD	0.00016534019
577	An Efficient Algorithm for Mining Association Rules in Large Databases	1995	VLDB	0.00016116712
733	Beyond Market Baskets: Generalizing Association Rules to Correlations	1997	SIGMOD	0.00014341186
914	Efficiently Mining Long Patterns from Databases	1998	SIGMOD	0.00013081245
1,664	Scalable Techniques for Mining Causal Structures	1998	VLDB	9.9377448e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	1,588	Fractal Prefetching B+-Trees: Optimizing Both Cache and Disk Performance	2002	SIGMOD
2	27	Database Architecture Optimized for the New Bottleneck: Memory Access	1999	VLDB
3	8,411	Thread Cooperation in Multicore Architectures for Frequency Counting over Multiple Data Streams	2009	VLDB
4	77	Cache Conscious Algorithms for Relational Query Processing	1994	VLDB
5	2,248	Cache-Efficient Aggregation: Hashing Is Sorting	2015	SIGMOD
6	209	Cache Conscious Indexing for Decision-Support in Main Memory	1999	VLDB
7	1,106	Buffering Accesses to Memory-Resident Index Structures	2003	VLDB
8	5,985	Efficient Mining of XML Query Patterns for Caching	2003	VLDB
9	7,824	Mining Tree-Structured Data on Multicore Systems	2009	VLDB
10	12,994	Optimization of Frequent Itemset Mining on Multiple-Core Processor	2007	VLDB