| 5,932 |
Hub Labeling for Shortest Path Counting |
2020 |
SIGMOD |
5.2670741e-05 |
| 6,207 |
Efficiently Computing k-Edge Connected Components via Graph Decomposition |
2013 |
SIGMOD |
5.1572428e-05 |
| 6,421 |
NUITS: A Novel User Interface for Efficient Keyword Search over Databases |
2006 |
VLDB |
5.0687368e-05 |
| 6,575 |
Fast Continuous Subgraph Matching over Streaming Graphs via Backtracking Reduction |
2023 |
SIGMOD |
5.0052259e-05 |
| 6,963 |
Query Translation from XPath to SQL in the Presence of Recursive DTDs |
2005 |
VLDB |
4.8828629e-05 |
| 7,268 |
Top-K Structural Diversity Search in Large Networks |
2013 |
VLDB |
4.7817823e-05 |
| 7,341 |
Scalable Time-Range k-Core Query on Temporal Graphs |
2023 |
VLDB |
4.7576413e-05 |
| 7,428 |
DLCR: Efficient Indexing for Label-Constrained Reachability Queries on Large Dynamic Graphs |
2022 |
VLDB |
4.7320892e-05 |
| 7,596 |
DAG Reduction: Fast Answering Reachability Queries |
2017 |
SIGMOD |
4.7016964e-05 |
| 7,757 |
Identifying Similar-Bicliques in Bipartite Graphs |
2022 |
VLDB |
4.6598957e-05 |
| 7,762 |
Optimal Enumeration: Efficient Top-k Tree Matching |
2015 |
VLDB |
4.6583829e-05 |
| 7,827 |
Containment Join Size Estimation: Models and Methods |
2003 |
SIGMOD |
4.6411831e-05 |
| 7,934 |
Fast Local Subgraph Counting |
2024 |
VLDB |
4.613363e-05 |
| 8,170 |
LM-SRPQ: Efficiently Answering Regular Path Query in Streaming Graphs |
2024 |
VLDB |
4.5697385e-05 |
| 8,488 |
Can Large Language Models Be Query Optimizer for Relational Databases? |
2026 |
SIGMOD |
4.4998609e-05 |
| 8,505 |
Top-K Nearest Keyword Search on Large Graphs |
2013 |
VLDB |
4.4958064e-05 |
| 8,899 |
Fast Approximate Similarity Join in Vector Databases |
2025 |
SIGMOD |
4.427232e-05 |
| 8,918 |
Time-Topology Analysis |
2021 |
VLDB |
4.427232e-05 |
| 9,282 |
Hybrid Pulling/Pushing for I/O-Efficient Distributed and Iterative Graph Computing |
2016 |
SIGMOD |
4.3634964e-05 |
| 9,330 |
Parallel Query Processing: To Separate Communication from Computation |
2022 |
SIGMOD |
4.3556432e-05 |
| 9,406 |
Efficient k-Clique Count Estimation with Accuracy Guarantee |
2024 |
VLDB |
4.3441378e-05 |
| 9,472 |
TGraph: A Tensor-centric Graph Processing Framework |
2025 |
SIGMOD |
4.3341665e-05 |
| 9,556 |
Materialized View Selection & View-Based Query Planning for Regular Path Queries |
2024 |
SIGMOD |
4.3254416e-05 |
| 9,614 |
Auto-Approximation of Graph Computing |
2014 |
VLDB |
4.3177432e-05 |
| 9,626 |
Divide & Conquer: I/O Efficient Depth-First Search |
2015 |
SIGMOD |
4.314762e-05 |
| 9,648 |
Inductive Attributed Community Search: to Learn Communities across Graphs |
2024 |
VLDB |
4.3109001e-05 |
| 9,756 |
RushMon: Real-time Isolation Anomalies Monitoring |
2018 |
SIGMOD |
4.2896011e-05 |
| 10,054 |
Beyond Vector Search: Querying With and Without Predicates |
2026 |
SIGMOD |
4.1945683e-05 |
| 10,085 |
GraphTwin: Cache-Centric Bit-Level Graph Representation for Fast and Exact Graph Queries |
2026 |
SIGMOD |
4.1945683e-05 |
| 10,121 |
TQEx: Tensor-based Query Engine Enhanced by Bridging the Gap |
2026 |
SIGMOD |
4.1945683e-05 |
| 10,134 |
A Unified Framework for Dense Subgraph Maintenance over Dynamic Bipartite Graphs |
2026 |
SIGMOD |
4.1945683e-05 |
| 10,136 |
Accelerating Triangle-Connected Truss Community Search Across Heterogeneous Hardware |
2026 |
SIGMOD |
4.1945683e-05 |
| 10,139 |
An Extensive Experimental Study of Indexes in Continuous Subgraph Matching:[Experiments & Analysis] |
2026 |
SIGMOD |
4.1945683e-05 |
| 10,270 |
Characterizing Parallel Subgraph Matching Performance: A Systematic Study of Interactions, Scalability, and Enumeration |
2026 |
VLDB |
4.1945683e-05 |
| 10,547 |
On More Efficiently and Versatilely Querying Historical k-Cores |
2025 |
VLDB |
4.1945683e-05 |
| 10,733 |
Subgraph Matching: A New Decomposition Based Approach |
2025 |
VLDB |
4.1945683e-05 |
| 11,044 |
Evolution Forest Index: Towards Optimal Temporal k-Core Component Search via Time-Topology Isomorphic Computation |
2024 |
VLDB |
4.1945683e-05 |
| 11,064 |
Efficient Betweenness Centrality Computation over Large Heterogeneous Information Networks |
2024 |
VLDB |
4.1945683e-05 |
| 11,132 |
A Branch-&-Bound Algorithm for Fractional Hypertree Decomposition |
2024 |
VLDB |
4.1945683e-05 |
| 11,469 |
Graph Iso/Auto-morphism: A Divide-&-Conquer Approach |
2021 |
SIGMOD |
4.1945683e-05 |
| 11,757 |
My Weak Consistency is Strong: When Bad Things Do Not Come in Threes |
2017 |
CIDR |
4.1945683e-05 |
| 11,953 |
Inferring Continuous Dynamic Social Influence and Personal Preference for Temporal Behavior Prediction |
2015 |
VLDB |
4.1945683e-05 |
| 11,961 |
Leveraging Graph Dimensions in Online Graph Search |
2015 |
VLDB |
4.1945683e-05 |
| 12,041 |
I/O Efficient: Computing SCCs in Massive Graphs |
2013 |
SIGMOD |
4.1945683e-05 |
| 12,180 |
iGraph in Action: Performance Analysis of Disk-Based Graph Indexing Techniques |
2011 |
SIGMOD |
4.1945683e-05 |
| 12,266 |
Ten Thousand SQLs: Parallel Keyword Queries Computing |
2010 |
VLDB |
4.1945683e-05 |
| 13,341 |
CoDAR: Revealing the Generalized Procedure & Recommending Algorithms of Community Detection |
2016 |
SIGMOD |
- |