| 184 |
Querying K-Truss Community in Large and Dynamic Graphs |
2014 |
SIGMOD |
0.00026100147 |
| 375 |
Graph Clustering Based on Structural/Attribute Similarities |
2009 |
VLDB |
0.00019628745 |
| 438 |
Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism |
2008 |
VLDB |
0.00018286607 |
| 645 |
Finding Maximal Cliques in Massive Networks by H*-graph |
2010 |
SIGMOD |
0.00015213733 |
| 736 |
Graph Indexing: Tree + Delta >= Graph |
2007 |
VLDB |
0.00014363536 |
| 1,007 |
Influential Community Search in Large Networks |
2015 |
VLDB |
0.00012556573 |
| 1,129 |
Approximate Closest Community Search in Networks |
2016 |
VLDB |
0.00011903608 |
| 1,247 |
Entity Matching: How Similar Is Similar |
2011 |
VLDB |
0.00011346515 |
| 1,394 |
Efficient Computation of the Skyline Cube |
2005 |
VLDB |
0.00010796403 |
| 1,440 |
Speedup Graph Processing by Graph Ordering |
2016 |
SIGMOD |
0.00010641888 |
| 1,476 |
Diversifying Top-K Results |
2012 |
VLDB |
0.00010551487 |
| 1,501 |
Keyword Search in Databases: The Power of RDBMS |
2009 |
SIGMOD |
0.00010461358 |
| 1,507 |
Finding the Maximum Clique in Massive Graphs |
2017 |
VLDB |
0.00010450256 |
| 1,731 |
Indexable PLA for Efficient Similarity Search |
2007 |
VLDB |
9.7639519e-05 |
| 2,194 |
Monitoring Path Nearest Neighbor in Road Networks |
2009 |
SIGMOD |
8.8805644e-05 |
| 2,285 |
Unboundedness and Efficiency of Truss Maintenance in Evolving Graphs |
2019 |
SIGMOD |
8.6948587e-05 |
| 2,601 |
Community Detection in Social Networks: An In-depth Benchmarking Study with a Procedure-Oriented Framework |
2015 |
VLDB |
8.2335436e-05 |
| 2,604 |
K-Reach: Who is in Your Small World |
2012 |
VLDB |
8.2302549e-05 |
| 2,697 |
Efficient Algorithms for Budgeted Influence Maximization on Massive Social Networks |
2020 |
VLDB |
8.1202432e-05 |
| 2,702 |
TreeSpan: Efficiently Computing Similarity All-Matching |
2012 |
SIGMOD |
8.1177147e-05 |
| 2,746 |
Holistic Twig Joins on Indexed XML Documents |
2003 |
VLDB |
8.0626049e-05 |
| 2,889 |
High-Throughput Transaction Executions on Graphics Processors |
2011 |
VLDB |
7.9070124e-05 |
| 3,066 |
Scalable Big Graph Processing in MapReduce |
2014 |
SIGMOD |
7.6877117e-05 |
| 3,160 |
A Learned Sketch for Subgraph Counting |
2021 |
SIGMOD |
7.5807496e-05 |
| 3,318 |
Skyline Community Search in Multi-valued Networks |
2018 |
SIGMOD |
7.4324312e-05 |
| 3,326 |
Sliding-Window Top-k Queries on Uncertain Streams |
2008 |
VLDB |
7.4227632e-05 |
| 3,328 |
Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity |
2015 |
SIGMOD |
7.4193937e-05 |
| 3,369 |
Connected Substructure Similarity Search |
2010 |
SIGMOD |
7.3698379e-05 |
| 3,499 |
iGraph: A Framework for Comparisons of Disk-Based Graph Indexing Techniques |
2010 |
VLDB |
7.2549774e-05 |
| 3,687 |
Relative Subboundedness of Contraction Hierarchy and Hierarchical 2-Hop Index in Dynamic Road Networks |
2022 |
SIGMOD |
7.0955331e-05 |
| 3,798 |
All-in-One: Graph Processing in RDBMSs Revisited |
2017 |
SIGMOD |
7.0161889e-05 |
| 4,049 |
Reachability Querying: An Independent Permutation Labeling Approach |
2014 |
VLDB |
6.8302372e-05 |
| 4,050 |
Revisiting the Index Construction of Proximity Graph-Based Approximate Nearest Neighbor Search |
2025 |
VLDB |
6.8298981e-05 |
| 4,080 |
Natural Language Question Answering over RDF — A Graph Data Driven Approach |
2014 |
SIGMOD |
6.8181487e-05 |
| 4,372 |
Graph Analytics Through Fine-Grained Parallelism |
2016 |
SIGMOD |
6.6302732e-05 |
| 4,457 |
Lightweight and Accurate Cardinality Estimation by Neural Network Gaussian Process |
2022 |
SIGMOD |
6.5913732e-05 |
| 4,587 |
Fast Continuous Subgraph Matching over Streaming Graphs via Backtracking Reduction |
2023 |
SIGMOD |
6.5161686e-05 |
| 4,604 |
Finding the Cost-Optimal Path with Time Constraint over Time-Dependent Graphs |
2014 |
VLDB |
6.505032e-05 |
| 4,778 |
False Positive or False Negative: Mining Frequent Itemsets from High Speed Transactional Data Streams |
2004 |
VLDB |
6.4174716e-05 |
| 5,101 |
Relational Approach for Shortest Path Discovery over Large Graphs |
2012 |
VLDB |
6.2732849e-05 |
| 5,277 |
Top-K Structural Diversity Search in Large Networks |
2013 |
VLDB |
6.1999805e-05 |
| 5,290 |
How to Build Templates for RDF Question/Answering —An Uncertain Graph Similarity Join Approach |
2015 |
SIGMOD |
6.1937978e-05 |
| 5,396 |
Fast and Robust Distributed Subgraph Enumeration |
2019 |
VLDB |
6.1494643e-05 |
| 5,531 |
Efficient and Progressive Group Steiner Tree Search |
2016 |
SIGMOD |
6.0935114e-05 |
| 5,550 |
Parameter Free Bursty Events Detection in Text Streams |
2005 |
VLDB |
6.0879624e-05 |
| 5,580 |
Bloom Histogram: Path Selectivity Estimation for XML Data with Updates |
2004 |
VLDB |
6.0769576e-05 |
| 5,645 |
Repairing Vertex Labels under Neighborhood Constraints |
2014 |
VLDB |
6.0533594e-05 |
| 5,662 |
Efficiently Computing k-Edge Connected Components via Graph Decomposition |
2013 |
SIGMOD |
6.0472942e-05 |
| 5,703 |
Hub Labeling for Shortest Path Counting |
2020 |
SIGMOD |
6.0303375e-05 |
| 5,764 |
Question Answering Over Knowledge Graphs: Question Understanding Via Template Decomposition |
2018 |
VLDB |
6.0030951e-05 |