| 1,357 |
RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Search |
2024 |
SIGMOD |
0.00011043994 |
| 1,735 |
High-Dimensional Approximate Nearest Neighbor Search: with Reliable and Efficient Distance Comparison Operations |
2023 |
SIGMOD |
9.9004924e-05 |
| 2,453 |
Efficient Algorithms for Maximal k-Biplex Enumeration |
2022 |
SIGMOD |
8.5574945e-05 |
| 2,696 |
Trajectory Simplification: On Minimizing the Direction-based Error |
2015 |
VLDB |
8.24578e-05 |
| 2,964 |
Direction-Preserving Trajectory Simplification |
2013 |
VLDB |
7.9156383e-05 |
| 3,108 |
Practical and Asymptotically Optimal Quantization of High-Dimensional Vectors in Euclidean Space for Approximate Nearest Neighbor Search |
2025 |
SIGMOD |
7.7499741e-05 |
| 3,286 |
iRangeGraph: Improvising Range-dedicated Graphs for Range-filtering Nearest Neighbor Search |
2024 |
SIGMOD |
7.5596483e-05 |
| 3,458 |
Collective Spatial Keyword Queries: A Distance Owner-Driven Approach |
2013 |
SIGMOD |
7.3961486e-05 |
| 3,799 |
SymphonyQG: Towards Symphonious Integration of Quantization and Graph for Approximate Nearest Neighbor Search |
2025 |
SIGMOD |
7.114484e-05 |
| 3,993 |
Efficient k-Clique Listing: An Edge-Oriented Branching Strategy |
2024 |
SIGMOD |
6.9688824e-05 |
| 4,751 |
The RLR-Tree: A Reinforcement Learning Based R-Tree for Spatial Data |
2023 |
SIGMOD |
6.5241784e-05 |
| 4,786 |
Architecture-Intact Oracle for Fastest Path and Time Queries on Dynamic Spatial Networks |
2020 |
SIGMOD |
6.5083151e-05 |
| 4,939 |
Efficient k-Regret Query Algorithm with Restriction-free Bound for any Dimensionality |
2018 |
SIGMOD |
6.4336325e-05 |
| 5,141 |
Maximum k-Biplex Search on Bipartite Graphs: A Symmetric-BK Branching Approach |
2023 |
SIGMOD |
6.3485708e-05 |
| 5,758 |
Fast Maximum Common Subgraph Search: A Redundancy-Reduced Backtracking Approach |
2025 |
SIGMOD |
6.0972035e-05 |
| 5,997 |
Efficient and Effective Similar Subtrajectory Search with Deep Reinforcement Learning |
2020 |
VLDB |
6.0146869e-05 |
| 6,023 |
On Optimal Worst-Case Matching |
2013 |
SIGMOD |
6.0032138e-05 |
| 6,683 |
Efficient Algorithms for Optimal Location Queries in Road Networks |
2014 |
SIGMOD |
5.8037274e-05 |
| 7,032 |
Fast Maximal Quasi-clique Enumeration: A Pruning and Branching Co-Design Approach |
2023 |
SIGMOD |
5.7222954e-05 |
| 7,761 |
DEG: Efficient Hybrid Vector Search Using the Dynamic Edge Navigation Graph |
2025 |
SIGMOD |
5.550467e-05 |
| 8,003 |
Towards Designing and Learning Piecewise Space-Filling Curves |
2023 |
VLDB |
5.5084586e-05 |
| 8,478 |
T-FSM: A Task-Based System for Massively Parallel Frequent Subgraph Pattern Mining from a Big Graph |
2023 |
SIGMOD |
5.4170414e-05 |
| 9,261 |
Hypersphere Dominance: An Optimal Approach |
2014 |
SIGMOD |
5.2968259e-05 |
| 9,504 |
Points-of-Interest Relationship Inference with Spatial-enriched Graph Neural Networks |
2022 |
VLDB |
5.2585442e-05 |
| 9,540 |
Efficient Maximum s-Bundle Search via Local Vertex Connectivity |
2025 |
SIGMOD |
5.2528121e-05 |
| 9,551 |
Maximum k-Plex Search: An Alternated Reduction-and-Bound Method |
2025 |
VLDB |
5.2528121e-05 |
| 10,268 |
Maximal Biclique Enumeration with Improved Worst-Case Time Complexity Guarantee: A Partition-Oriented Strategy |
2026 |
SIGMOD |
5.093636e-05 |
| 10,283 |
Querying Cohesive Subgraphs in Temporal Graphs |
2026 |
SIGMOD |
5.093636e-05 |
| 10,367 |
Efficient Size-Bounded Community Search, Revisited: Frameworks for Practical Improvements |
2026 |
SIGMOD |
5.093636e-05 |
| 10,447 |
Efficient and Robust Out-Of-Distribution Vector Similarity Search with Cross-Distribution Monotonic Graph |
2026 |
SIGMOD |
5.093636e-05 |
| 11,193 |
BT-Tree: A Reinforcement Learning Based Index for Big Trajectory Data |
2024 |
SIGMOD |
5.093636e-05 |
| 11,993 |
Distance Oracle on Terrain Surface |
2017 |
SIGMOD |
5.093636e-05 |
| 12,194 |
Terrain-Toolkit: A Multi-Functional Tool for Terrain Data |
2014 |
VLDB |
5.093636e-05 |