A Performance Study of Three Disk-based Structures for Indexing and Querying Frequent Itemsets

Summary: Evaluates three disk-based index structures for frequent itemsets— inverted files, signature files, CFP-tree— with a length-2 itemset pruning technique. Across five containment queries, no universal winner; CFP-tree delivers the strongest overall performance, with dataset-dependent gains. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 10903
Venue: VLDB
Year: 2013
Pagerank: 5.093636e-05
Overall Rank: 12,292 | 15.67%
DOI: 10.14778/2536349.2536351

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

1. Guimei Liu (National University of Singapore)
2. Andre Suchitra (National University of Singapore)
3. Limsoon Wong (National University of Singapore)

BibTeX Citation

@article{liu_vldb13,
        title = {{A Performance Study of Three Disk-based Structures for Indexing and Querying Frequent Itemsets}},
        author = {Liu, Guimei and Suchitra, Andre and Wong, Limsoon},
        journal = {PVLDB},
        series = {{VLDB} '13},
        volume = {6},
        number = {7},
        pages = {505--516},
        doi = {10.14778/2536349.2536351},
        url = {https://doi.org/10.14778/2536349.2536351},
        year = {2013}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank

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
13	Mining Association Rules between Sets of Items in Large Databases	1993	SIGMOD	0.0006567919
161	Mining Frequent Patterns without Candidate Generation	2000	SIGMOD	0.00027981772
774	Rapid Bushy Join-order Optimization with Cartesian Products	1996	SIGMOD	0.00014123979
3,324	Mining Compressed Frequent-Pattern Sets	2005	VLDB	7.5198821e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	6,687	Making In-Memory Learned Indexes Efficient on Disk	2024	SIGMOD
2	885	Finding Frequent Items in Data Streams	2008	VLDB
3	161	Mining Frequent Patterns without Candidate Generation	2000	SIGMOD
4	177	Graph Indexing: A Frequent Structure-based Approach	2004	SIGMOD
5	12,656	Optimization of Frequent Itemset Mining on Multiple-Core Processor	2007	VLDB
6	4,683	False Positive or False Negative: Mining Frequent Itemsets from High Speed Transactional Data Streams	2004	VLDB
7	13,997	Mining Frequent Itemsets with Bit Strings and Trie	2002	VLDB
8	727	Graph Indexing: Tree + Delta >= Graph	2007	VLDB
9	14,483	Performance Comparison Of Index Structures For Multi-Key Retrieval	1984	SIGMOD
10	6,448	Indexing Multiple Sets	1994	VLDB