Database Paper Browser

Back to papers

Graph Indexing: Tree + Delta >= Graph

Summary: Tree+Delta is a cost-effective graph index for subgraph containment that combines frequent tree-features (Tree) with on-demand discriminative graphs (Delta) to improve pruning. It yields a compact index, two orders of magnitude faster construction, and outperforms gIndex and C-Tree in containment queries. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
9643
Venue
VLDB
Year
2007
Pagerank
0.00015495155
Overall Rank
900 | 93.75%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 30 of 30 citing papers.

Rank Citing Paper Year Venue Pagerank
461 Graphs-at-a-time: Query Language and Access Methods for Graph Databases 2008 SIGMOD 0.00022499343
506 On Graph Query Optimization in Large Networks 2010 VLDB 0.00021475362
612 Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism 2008 VLDB 0.0001920234
764 TurboISO: Towards UltraFast and Robust Subgraph Isomorphism Search in Large Graph Databases 2013 SIGMOD 0.00017018712
919 Distance-Join: Pattern Match Query In a Large Graph Database 2009 VLDB 0.00015343179
951 Comparing Stars: On Approximating Graph Edit Distance 2009 VLDB 0.00015106325
1,180 Efficient Subgraph Matching by Postponing Cartesian Products 2016 SIGMOD 0.00013456907
1,285 Neighborhood Based Fast Graph Search in Large Networks 2011 SIGMOD 0.00012833377
1,333 Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins 2019 VLDB 0.00012523806
1,635 An In-depth Comparison of Subgraph Isomorphism Algorithms in Graph Databases 2013 VLDB 0.0001105793
1,641 Fast and Exact Top-k Search for Random Walk with Restart 2012 VLDB 0.00011047924
1,775 CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching 2019 SIGMOD 0.00010602927
2,409 TreeSpan: Efficiently Computing Similarity All-Matching 2012 SIGMOD 8.8776858e-05
2,428 VOGUE: Towards A Visual Interaction-aware Graph Query Processing Framework 2013 CIDR 8.8367608e-05
2,525 Connected Substructure Similarity Search 2010 SIGMOD 8.5981082e-05
3,187 Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching 2021 SIGMOD 7.4136521e-05
4,072 Performance and Scalability of Indexed Subgraph Query Processing Methods 2015 VLDB 6.4727847e-05
5,159 Towards Proximity Pattern Mining in Large Graphs 2010 SIGMOD 5.6587631e-05
5,521 Efficient Streaming Subgraph Isomorphism with Graph Neural Networks 2021 VLDB 5.4614637e-05
5,771 Graph-Aware, Workload-Adaptive SPARQL Query Caching 2015 SIGMOD 5.3325981e-05
5,854 Diversified Top-k Subgraph Querying in a Large Graph 2016 SIGMOD 5.3006473e-05
6,152 MIDAS: Towards Efficient and Effective Maintenance of Canned Patterns in Visual Graph Query Interfaces 2021 SIGMOD 5.183145e-05
6,281 A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction 2024 SIGMOD 5.128862e-05
7,100 BICE: Exploring Compact Search Space by Using Bipartite Matching and Cell-Wide Verification 2023 VLDB 4.8326259e-05
8,726 GBLENDER: Towards Blending Visual Query Formulation and Query Processing in Graph Databases 2010 SIGMOD 4.4593116e-05
8,986 Processing Proximity Relations in Road Networks 2010 SIGMOD 4.4153655e-05
9,887 Graph Exploration: From Users to Large Graphs 2017 SIGMOD 4.2621158e-05
10,270 Characterizing Parallel Subgraph Matching Performance: A Systematic Study of Interactions, Scalability, and Enumeration 2026 VLDB 4.1945683e-05
12,043 A Direct Mining Approach To Efficient Constrained Graph Pattern Discovery 2013 SIGMOD 4.1945683e-05
12,180 iGraph in Action: Performance Analysis of Disk-Based Graph Indexing Techniques 2011 SIGMOD 4.1945683e-05
Previous Page 1 / 1 Next

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.

Previous Page 1 / 1 Next

Semantically Similar Papers