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
9644
Venue
VLDB
Year
2007
Pagerank
0.00015498104
Overall Rank
895 | 93.79%
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
460 Graphs-at-a-time: Query Language and Access Methods for Graph Databases 2008 SIGMOD 0.00022679846
502 On Graph Query Optimization in Large Networks 2010 VLDB 0.00021528261
616 Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism 2008 VLDB 0.00019068362
749 TurboISO: Towards UltraFast and Robust Subgraph Isomorphism Search in Large Graph Databases 2013 SIGMOD 0.00017193776
916 Distance-Join: Pattern Match Query In a Large Graph Database 2009 VLDB 0.00015326675
949 Comparing Stars: On Approximating Graph Edit Distance 2009 VLDB 0.0001510288
1,125 Efficient Subgraph Matching by Postponing Cartesian Products 2016 SIGMOD 0.00013829006
1,280 Neighborhood Based Fast Graph Search in Large Networks 2011 SIGMOD 0.00012838714
1,334 Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins 2019 VLDB 0.00012543633
1,626 Fast and Exact Top-k Search for Random Walk with Restart 2012 VLDB 0.0001108491
1,630 An In-depth Comparison of Subgraph Isomorphism Algorithms in Graph Databases 2013 VLDB 0.00011073047
1,715 CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching 2019 SIGMOD 0.00010776518
2,402 TreeSpan: Efficiently Computing Similarity All-Matching 2012 SIGMOD 8.87387e-05
2,418 VOGUE: Towards A Visual Interaction-aware Graph Query Processing Framework 2013 CIDR 8.8499974e-05
2,524 Connected Substructure Similarity Search 2010 SIGMOD 8.5993622e-05
3,119 Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching 2021 SIGMOD 7.5393376e-05
3,894 Performance and Scalability of Indexed Subgraph Query Processing Methods 2015 VLDB 6.6531173e-05
5,158 Towards Proximity Pattern Mining in Large Graphs 2010 SIGMOD 5.6510256e-05
5,530 Efficient Streaming Subgraph Isomorphism with Graph Neural Networks 2021 VLDB 5.4562393e-05
5,778 Graph-Aware, Workload-Adaptive SPARQL Query Caching 2015 SIGMOD 5.3274776e-05
5,903 Diversified Top-k Subgraph Querying in a Large Graph 2016 SIGMOD 5.2757528e-05
5,968 A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction 2024 SIGMOD 5.2469955e-05
7,091 BICE: Exploring Compact Search Space by Using Bipartite Matching and Cell-Wide Verification 2023 VLDB 4.8304411e-05
8,723 GBLENDER: Towards Blending Visual Query Formulation and Query Processing in Graph Databases 2010 SIGMOD 4.4546285e-05
8,992 Processing Proximity Relations in Road Networks 2010 SIGMOD 4.4111332e-05
9,886 Graph Exploration: From Users to Large Graphs 2017 SIGMOD 4.2580321e-05
10,270 Characterizing Parallel Subgraph Matching Performance: A Systematic Study of Interactions, Scalability, and Enumeration 2026 VLDB 4.1905499e-05
11,477 MIDAS: Towards Efficient and Effective Maintenance of Canned Patterns in Visual Graph Query Interfaces 2021 SIGMOD 4.1905499e-05
12,051 A Direct Mining Approach To Efficient Constrained Graph Pattern Discovery 2013 SIGMOD 4.1905499e-05
12,188 iGraph in Action: Performance Analysis of Disk-Based Graph Indexing Techniques 2011 SIGMOD 4.1905499e-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