| 189 |
Querying K-Truss Community in Large and Dynamic Graphs |
2014 |
SIGMOD |
0.00026114928 |
| 364 |
Graph Clustering Based on Structural/Attribute Similarities |
2009 |
VLDB |
0.00020054172 |
| 431 |
Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism |
2008 |
VLDB |
0.00018577017 |
| 674 |
Finding Maximal Cliques in Massive Networks by H*-graph |
2010 |
SIGMOD |
0.00015081844 |
| 727 |
Graph Indexing: Tree + Delta >= Graph |
2007 |
VLDB |
0.00014565738 |
| 982 |
Influential Community Search in Large Networks |
2015 |
VLDB |
0.0001283311 |
| 1,113 |
Approximate Closest Community Search in Networks |
2016 |
VLDB |
0.00012124571 |
| 1,248 |
Entity Matching: How Similar Is Similar |
2011 |
VLDB |
0.00011498301 |
| 1,360 |
Efficient Computation of the Skyline Cube |
2005 |
VLDB |
0.00011040203 |
| 1,454 |
Diversifying Top-K Results |
2012 |
VLDB |
0.00010739504 |
| 1,509 |
Finding the Maximum Clique in Massive Graphs |
2017 |
VLDB |
0.00010539891 |
| 1,511 |
Speedup Graph Processing by Graph Ordering |
2016 |
SIGMOD |
0.00010538011 |
| 1,555 |
Keyword Search in Databases: The Power of RDBMS |
2009 |
SIGMOD |
0.00010370683 |
| 1,722 |
Indexable PLA for Efficient Similarity Search |
2007 |
VLDB |
9.9227051e-05 |
| 2,112 |
Speeding Up Set Intersections in Graph Algorithms using SIMD Instructions |
2018 |
SIGMOD |
9.1514258e-05 |
| 2,153 |
Monitoring Path Nearest Neighbor in Road Networks |
2009 |
SIGMOD |
9.0762376e-05 |
| 2,243 |
Unboundedness and Efficiency of Truss Maintenance in Evolving Graphs |
2019 |
SIGMOD |
8.8813183e-05 |
| 2,575 |
K-Reach: Who is in Your Small World |
2012 |
VLDB |
8.3982298e-05 |
| 2,580 |
Community Detection in Social Networks: An In-depth Benchmarking Study with a Procedure-Oriented Framework |
2015 |
VLDB |
8.3887788e-05 |
| 2,650 |
TreeSpan: Efficiently Computing Similarity All-Matching |
2012 |
SIGMOD |
8.2920414e-05 |
| 2,694 |
Holistic Twig Joins on Indexed XML Documents |
2003 |
VLDB |
8.2469414e-05 |
| 2,752 |
Efficient Algorithms for Budgeted Influence Maximization on Massive Social Networks |
2020 |
VLDB |
8.1648436e-05 |
| 2,885 |
High-Throughput Transaction Executions on Graphics Processors |
2011 |
VLDB |
7.9969529e-05 |
| 3,008 |
Scalable Big Graph Processing in MapReduce |
2014 |
SIGMOD |
7.8578871e-05 |
| 3,021 |
SCARAB: Scaling Reachability Computation on Large Graphs |
2012 |
SIGMOD |
7.8401031e-05 |
| 3,254 |
Skyline Community Search in Multi-valued Networks |
2018 |
SIGMOD |
7.5928992e-05 |
| 3,261 |
Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity |
2015 |
SIGMOD |
7.5853837e-05 |
| 3,283 |
A Learned Sketch for Subgraph Counting |
2021 |
SIGMOD |
7.56675e-05 |
| 3,311 |
Connected Substructure Similarity Search |
2010 |
SIGMOD |
7.5353184e-05 |
| 3,431 |
iGraph: A Framework for Comparisons of Disk-Based Graph Indexing Techniques |
2010 |
VLDB |
7.4189541e-05 |
| 3,599 |
Sliding-Window Top-k Queries on Uncertain Streams |
2008 |
VLDB |
7.2710351e-05 |
| 3,612 |
Relative Subboundedness of Contraction Hierarchy and Hierarchical 2-Hop Index in Dynamic Road Networks |
2022 |
SIGMOD |
7.2579119e-05 |
| 3,872 |
All-in-One: Graph Processing in RDBMSs Revisited |
2017 |
SIGMOD |
7.0580243e-05 |
| 3,979 |
Reachability Querying: An Independent Permutation Labeling Approach |
2014 |
VLDB |
6.9754185e-05 |
| 3,981 |
Natural Language Question Answering over RDF — A Graph Data Driven Approach |
2014 |
SIGMOD |
6.9746167e-05 |
| 4,297 |
Graph Analytics Through Fine-Grained Parallelism |
2016 |
SIGMOD |
6.7770261e-05 |
| 4,368 |
Lightweight and Accurate Cardinality Estimation by Neural Network Gaussian Process |
2022 |
SIGMOD |
6.7393882e-05 |
| 4,541 |
Finding the Cost-Optimal Path with Time Constraint over Time-Dependent Graphs |
2014 |
VLDB |
6.6397712e-05 |
| 4,683 |
False Positive or False Negative: Mining Frequent Itemsets from High Speed Transactional Data Streams |
2004 |
VLDB |
6.5641059e-05 |
| 4,712 |
Revisiting the Index Construction of Proximity Graph-Based Approximate Nearest Neighbor Search |
2025 |
VLDB |
6.5506649e-05 |
| 4,977 |
Relational Approach for Shortest Path Discovery over Large Graphs |
2012 |
VLDB |
6.4166233e-05 |
| 4,995 |
Fast Continuous Subgraph Matching over Streaming Graphs via Backtracking Reduction |
2023 |
SIGMOD |
6.4089186e-05 |
| 5,168 |
How to Build Templates for RDF Question/Answering —An Uncertain Graph Similarity Join Approach |
2015 |
SIGMOD |
6.3353772e-05 |
| 5,296 |
Fast and Robust Distributed Subgraph Enumeration |
2019 |
VLDB |
6.2782852e-05 |
| 5,410 |
Parameter Free Bursty Events Detection in Text Streams |
2005 |
VLDB |
6.227694e-05 |
| 5,459 |
Bloom Histogram: Path Selectivity Estimation for XML Data with Updates |
2004 |
VLDB |
6.2108888e-05 |
| 5,507 |
Neighborhood-Privacy Protected Shortest Distance Computing in Cloud |
2011 |
SIGMOD |
6.1924452e-05 |
| 5,519 |
Repairing Vertex Labels under Neighborhood Constraints |
2014 |
VLDB |
6.1885644e-05 |
| 5,540 |
Efficiently Computing k-Edge Connected Components via Graph Decomposition |
2013 |
SIGMOD |
6.1809407e-05 |
| 5,571 |
Hub Labeling for Shortest Path Counting |
2020 |
SIGMOD |
6.1686653e-05 |