Mining Tree-Structured Data on Multicore Systems
Summary: Architecture-conscious mining of frequent subtrees in rooted, labeled trees for multicore systems. Memory locality optimizations, reduced bus pressure, and adaptive moldable-task scheduling enable efficient parallelization up to 16 cores and a general scheduling service. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,522 | Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together | 2019 | SIGMOD | 0.0001152219 |
| 12,274 | Ten Thousand SQLs: Parallel Keyword Queries Computing | 2010 | VLDB | 4.1905499e-05 |
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 |
|---|---|---|---|---|
| 182 | Mining Frequent Patterns without Candidate Generation | 2000 | SIGMOD | 0.00036955562 |
| 826 | Main-Memory Scan Sharing For Multi-Core CPUs | 2008 | VLDB | 0.00016161625 |
| 8,374 | LCS-TRIM: Dynamic Programming Meets XML Indexing and Querying | 2007 | VLDB | 4.5282277e-05 |
Previous
Page 1 / 1
Next