DBScholar

Back to papers

Mining Tree-Structured Data on Multicore Systems

Summary: Architecture-conscious frequent-subtree mining combines locality and front-side-bus optimizations with adaptive, moldable task scheduling. It tackles data-driven load imbalance and achieves near-perfect efficiency on 16 cores. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID
10165
Venue
VLDB
Year
2009
Pagerank
5.5618769e-05
Overall Rank
7,710 | 47.11%
DOI
10.14778/1687627.1687706

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{tatikonda_vldb09,
        title = {{Mining Tree-Structured Data on Multicore Systems}},
        author = {Tatikonda, Shirish and Parthasarathy, Srinivasan},
        journal = {PVLDB},
        series = {{VLDB} '09},
        doi = {10.14778/1687627.1687706},
        url = {https://doi.org/10.14778/1687627.1687706},
        year = {2009}
}

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 3 of 3 cited papers.

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

Rank Cited Paper Year Venue Pagerank
161 Mining Frequent Patterns without Candidate Generation 2000 SIGMOD 0.00027981772
696 Main-Memory Scan Sharing For Multi-Core CPUs 2008 VLDB 0.00014891322
8,422 LCS-TRIM: Dynamic Programming Meets XML Indexing and Querying 2007 VLDB 5.4278338e-05
Previous Page 1 / 1 Next

Semantically Similar Papers