| 182 |
Querying K-Truss Community in Large and Dynamic Graphs |
2014 |
SIGMOD |
101 |
0.00026383593 |
| 373 |
Graph Clustering Based on Structural/Attribute Similarities |
2009 |
VLDB |
34 |
0.00019709993 |
| 439 |
Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism |
2008 |
VLDB |
72 |
0.00018247958 |
| 643 |
Finding Maximal Cliques in Massive Networks by H*-graph |
2010 |
SIGMOD |
34 |
0.00015219469 |
| 734 |
Graph Indexing: Tree + Delta >= Graph |
2007 |
VLDB |
30 |
0.00014334121 |
| 970 |
Influential Community Search in Large Networks |
2015 |
VLDB |
33 |
0.00012749284 |
| 1,118 |
Approximate Closest Community Search in Networks |
2016 |
VLDB |
44 |
0.0001192817 |
| 1,251 |
Entity Matching: How Similar Is Similar |
2011 |
VLDB |
17 |
0.0001132553 |
| 1,401 |
Efficient Computation of the Skyline Cube |
2005 |
VLDB |
18 |
0.0001075604 |
| 1,440 |
Speedup Graph Processing by Graph Ordering |
2016 |
SIGMOD |
25 |
0.00010630613 |
| 1,478 |
Diversifying Top-K Results |
2012 |
VLDB |
19 |
0.00010511781 |
| 1,495 |
Finding the Maximum Clique in Massive Graphs |
2017 |
VLDB |
11 |
0.0001046246 |
| 1,505 |
Keyword Search in Databases: The Power of RDBMS |
2009 |
SIGMOD |
15 |
0.00010424285 |
| 1,738 |
Indexable PLA for Efficient Similarity Search |
2007 |
VLDB |
15 |
9.7335994e-05 |
| 2,206 |
Monitoring Path Nearest Neighbor in Road Networks |
2009 |
SIGMOD |
8 |
8.850101e-05 |
| 2,246 |
Unboundedness and Efficiency of Truss Maintenance in Evolving Graphs |
2019 |
SIGMOD |
19 |
8.7594692e-05 |
| 2,613 |
Community Detection in Social Networks: An In-depth Benchmarking Study with a Procedure-Oriented Framework |
2015 |
VLDB |
9 |
8.2024968e-05 |
| 2,617 |
K-Reach: Who is in Your Small World |
2012 |
VLDB |
11 |
8.2001569e-05 |
| 2,698 |
Efficient Algorithms for Budgeted Influence Maximization on Massive Social Networks |
2020 |
VLDB |
13 |
8.1020179e-05 |
| 2,705 |
TreeSpan: Efficiently Computing Similarity All-Matching |
2012 |
SIGMOD |
15 |
8.0936619e-05 |
| 2,756 |
Holistic Twig Joins on Indexed XML Documents |
2003 |
VLDB |
18 |
8.0322898e-05 |
| 2,890 |
High-Throughput Transaction Executions on Graphics Processors |
2011 |
VLDB |
12 |
7.8875185e-05 |
| 3,071 |
Scalable Big Graph Processing in MapReduce |
2014 |
SIGMOD |
9 |
7.6670408e-05 |
| 3,105 |
A Learned Sketch for Subgraph Counting |
2021 |
SIGMOD |
21 |
7.6278115e-05 |
| 3,145 |
Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity |
2015 |
SIGMOD |
24 |
7.5828479e-05 |
| 3,221 |
Skyline Community Search in Multi-valued Networks |
2018 |
SIGMOD |
14 |
7.5060153e-05 |
| 3,337 |
Sliding-Window Top-k Queries on Uncertain Streams |
2008 |
VLDB |
9 |
7.3950425e-05 |
| 3,366 |
Connected Substructure Similarity Search |
2010 |
SIGMOD |
9 |
7.3548555e-05 |
| 3,504 |
iGraph: A Framework for Comparisons of Disk-Based Graph Indexing Techniques |
2010 |
VLDB |
14 |
7.2296629e-05 |
| 3,676 |
Relative Subboundedness of Contraction Hierarchy and Hierarchical 2-Hop Index in Dynamic Road Networks |
2022 |
SIGMOD |
11 |
7.0882436e-05 |
| 3,805 |
All-in-One: Graph Processing in RDBMSs Revisited |
2017 |
SIGMOD |
11 |
6.99039e-05 |
| 4,076 |
Reachability Querying: An Independent Permutation Labeling Approach |
2014 |
VLDB |
10 |
6.8048601e-05 |
| 4,077 |
Revisiting the Index Construction of Proximity Graph-Based Approximate Nearest Neighbor Search |
2025 |
VLDB |
17 |
6.8040917e-05 |
| 4,103 |
Natural Language Question Answering over RDF — A Graph Data Driven Approach |
2014 |
SIGMOD |
9 |
6.792391e-05 |
| 4,395 |
Graph Analytics Through Fine-Grained Parallelism |
2016 |
SIGMOD |
11 |
6.6078819e-05 |
| 4,479 |
Lightweight and Accurate Cardinality Estimation by Neural Network Gaussian Process |
2022 |
SIGMOD |
10 |
6.5665703e-05 |
| 4,485 |
Fast Continuous Subgraph Matching over Streaming Graphs via Backtracking Reduction |
2023 |
SIGMOD |
21 |
6.5644966e-05 |
| 4,567 |
Efficiently Computing k-Edge Connected Components via Graph Decomposition |
2013 |
SIGMOD |
22 |
6.5173666e-05 |
| 4,624 |
Finding the Cost-Optimal Path with Time Constraint over Time-Dependent Graphs |
2014 |
VLDB |
4 |
6.4807585e-05 |
| 4,799 |
False Positive or False Negative: Mining Frequent Itemsets from High Speed Transactional Data Streams |
2004 |
VLDB |
3 |
6.3945122e-05 |
| 5,115 |
Relational Approach for Shortest Path Discovery over Large Graphs |
2012 |
VLDB |
7 |
6.2559695e-05 |
| 5,298 |
Top-K Structural Diversity Search in Large Networks |
2013 |
VLDB |
5 |
6.1768321e-05 |
| 5,311 |
How to Build Templates for RDF Question/Answering —An Uncertain Graph Similarity Join Approach |
2015 |
SIGMOD |
5 |
6.1703949e-05 |
| 5,418 |
Fast and Robust Distributed Subgraph Enumeration |
2019 |
VLDB |
11 |
6.1264302e-05 |
| 5,557 |
Efficient and Progressive Group Steiner Tree Search |
2016 |
SIGMOD |
5 |
6.0704874e-05 |
| 5,567 |
Parameter Free Bursty Events Detection in Text Streams |
2005 |
VLDB |
2 |
6.0649595e-05 |
| 5,591 |
Bloom Histogram: Path Selectivity Estimation for XML Data with Updates |
2004 |
VLDB |
5 |
6.0553413e-05 |
| 5,659 |
Repairing Vertex Labels under Neighborhood Constraints |
2014 |
VLDB |
5 |
6.0309201e-05 |
| 5,699 |
Hub Labeling for Shortest Path Counting |
2020 |
SIGMOD |
6 |
6.0139119e-05 |
| 5,779 |
Question Answering Over Knowledge Graphs: Question Understanding Via Template Decomposition |
2018 |
VLDB |
3 |
5.9804127e-05 |
| 5,801 |
MOCgraph: Scalable Distributed Graph Processing Using Message Online Computing |
2015 |
VLDB |
6 |
5.9729703e-05 |
| 6,505 |
Scalable Time-Range k-Core Query on Temporal Graphs |
2023 |
VLDB |
9 |
5.745487e-05 |
| 6,584 |
Can Large Language Models Be Query Optimizer for Relational Databases? |
2026 |
SIGMOD |
8 |
5.72395e-05 |
| 6,786 |
DLCR: Efficient Indexing for Label-Constrained Reachability Queries on Large Dynamic Graphs |
2022 |
VLDB |
5 |
5.6657191e-05 |
| 6,813 |
Efficient k-Clique Count Estimation with Accuracy Guarantee |
2024 |
VLDB |
5 |
5.6596752e-05 |
| 7,063 |
NUITS: A Novel User Interface for Efficient Keyword Search over Databases |
2006 |
VLDB |
2 |
5.5932475e-05 |
| 7,331 |
Query Translation from XPath to SQL in the Presence of Recursive DTDs |
2005 |
VLDB |
2 |
5.5352176e-05 |
| 7,552 |
Fast Local Subgraph Counting |
2024 |
VLDB |
4 |
5.4802093e-05 |
| 7,769 |
Optimal Enumeration: Efficient Top-k Tree Matching |
2015 |
VLDB |
4 |
5.4391973e-05 |
| 7,861 |
DAG Reduction: Fast Answering Reachability Queries |
2017 |
SIGMOD |
1 |
5.4225547e-05 |
| 7,915 |
Identifying Similar-Bicliques in Bipartite Graphs |
2022 |
VLDB |
3 |
5.4114919e-05 |
| 8,236 |
LM-SRPQ: Efficiently Answering Regular Path Query in Streaming Graphs |
2024 |
VLDB |
4 |
5.3569644e-05 |
| 8,346 |
Containment Join Size Estimation: Models and Methods |
2003 |
SIGMOD |
2 |
5.3339321e-05 |
| 8,434 |
Fast Approximate Similarity Join in Vector Databases |
2025 |
SIGMOD |
3 |
5.3165535e-05 |
| 8,536 |
On More Efficiently and Versatilely Querying Historical k-Cores |
2025 |
VLDB |
3 |
5.3051047e-05 |
| 8,684 |
Top-K Nearest Keyword Search on Large Graphs |
2013 |
VLDB |
2 |
5.2733276e-05 |
| 8,899 |
Subgraph Matching: A New Decomposition Based Approach |
2025 |
VLDB |
4 |
5.2401722e-05 |
| 8,909 |
Evolution Forest Index: Towards Optimal Temporal k-Core Component Search via Time-Topology Isomorphic Computation |
2024 |
VLDB |
3 |
5.2369069e-05 |
| 9,062 |
TGraph: A Tensor-centric Graph Processing Framework |
2025 |
SIGMOD |
2 |
5.2140679e-05 |
| 9,171 |
Materialized View Selection & View-Based Query Planning for Regular Path Queries |
2024 |
SIGMOD |
4 |
5.2016713e-05 |
| 9,247 |
Inductive Attributed Community Search: to Learn Communities across Graphs |
2024 |
VLDB |
2 |
5.1862386e-05 |
| 9,282 |
Time-Topology Analysis |
2021 |
VLDB |
1 |
5.1860131e-05 |
| 9,632 |
Hybrid Pulling/Pushing for I/O-Efficient Distributed and Iterative Graph Computing |
2016 |
SIGMOD |
3 |
5.1358859e-05 |
| 9,695 |
Parallel Query Processing: To Separate Communication from Computation |
2022 |
SIGMOD |
2 |
5.1258854e-05 |
| 9,939 |
Auto-Approximation of Graph Computing |
2014 |
VLDB |
1 |
5.0932503e-05 |
| 9,976 |
Divide & Conquer: I/O Efficient Depth-First Search |
2015 |
SIGMOD |
2 |
5.0881951e-05 |
| 10,112 |
RushMon: Real-time Isolation Anomalies Monitoring |
2018 |
SIGMOD |
1 |
5.0667359e-05 |
| 10,384 |
Break Iteration Barrier: Parallelize Priority-Based Graph Processing |
2027 |
SIGMOD |
0 |
4.9605343e-05 |
| 10,623 |
Beyond Vector Search: Querying With and Without Predicates |
2026 |
SIGMOD |
1 |
4.9605343e-05 |
| 10,647 |
GraphTwin: Cache-Centric Bit-Level Graph Representation for Fast and Exact Graph Queries |
2026 |
SIGMOD |
0 |
4.9605343e-05 |
| 10,673 |
TQEx: Tensor-based Query Engine Enhanced by Bridging the Gap |
2026 |
SIGMOD |
0 |
4.9605343e-05 |
| 10,684 |
A Unified Framework for Dense Subgraph Maintenance over Dynamic Bipartite Graphs |
2026 |
SIGMOD |
0 |
4.9605343e-05 |
| 10,686 |
Accelerating Triangle-Connected Truss Community Search Across Heterogeneous Hardware |
2026 |
SIGMOD |
0 |
4.9605343e-05 |
| 10,689 |
An Extensive Experimental Study of Indexes in Continuous Subgraph Matching:[Experiments & Analysis] |
2026 |
SIGMOD |
0 |
4.9605343e-05 |
| 10,811 |
Characterizing Parallel Subgraph Matching Performance: A Systematic Study of Interactions, Scalability, and Enumeration |
2026 |
VLDB |
0 |
4.9605343e-05 |
| 10,859 |
Subgraph Enumeration: Beyond Tree Decomposition |
2026 |
VLDB |
0 |
4.9605343e-05 |
| 10,889 |
ThunderGNN: Unlocking Tensor Cores for Graph Neural Networks |
2026 |
VLDB |
0 |
4.9605343e-05 |
| 10,928 |
Sema: A High-performance System for LLM-based Semantic Query Processing |
2026 |
VLDB |
0 |
4.9605343e-05 |
| 11,098 |
Advances of Query Processing in Vector Databases |
2026 |
VLDB |
0 |
4.9605343e-05 |
| 11,652 |
Efficient Betweenness Centrality Computation over Large Heterogeneous Information Networks |
2024 |
VLDB |
1 |
4.9605343e-05 |
| 11,708 |
A Branch-&-Bound Algorithm for Fractional Hypertree Decomposition |
2024 |
VLDB |
2 |
4.9605343e-05 |
| 12,023 |
Graph Iso/Auto-morphism: A Divide-&-Conquer Approach |
2021 |
SIGMOD |
0 |
4.9605343e-05 |
| 12,310 |
My Weak Consistency is Strong: When Bad Things Do Not Come in Threes |
2017 |
CIDR |
0 |
4.9605343e-05 |
| 12,492 |
Inferring Continuous Dynamic Social Influence and Personal Preference for Temporal Behavior Prediction |
2015 |
VLDB |
0 |
4.9605343e-05 |
| 12,499 |
Leveraging Graph Dimensions in Online Graph Search |
2015 |
VLDB |
0 |
4.9605343e-05 |
| 12,579 |
I/O Efficient: Computing SCCs in Massive Graphs |
2013 |
SIGMOD |
3 |
4.9605343e-05 |
| 12,715 |
iGraph in Action: Performance Analysis of Disk-Based Graph Indexing Techniques |
2011 |
SIGMOD |
0 |
4.9605343e-05 |
| 12,801 |
Ten Thousand SQLs: Parallel Keyword Queries Computing |
2010 |
VLDB |
0 |
4.9605343e-05 |
| 13,900 |
CoDAR: Revealing the Generalized Procedure & Recommending Algorithms of Community Detection |
2016 |
SIGMOD |
0 |
- |