| 34 |
Similarity Search in High Dimensions via Hashing |
1999 |
VLDB |
0.00076824554 |
| 78 |
A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces |
1998 |
VLDB |
0.00056385781 |
| 399 |
Multi-Probe LSH: Efficient Indexing for High-Dimensional Similarity Search |
2007 |
VLDB |
0.00024359304 |
| 821 |
Dimensionality Reduction for Similarity Searching in Dynamic Databases |
1998 |
SIGMOD |
0.00016232579 |
| 929 |
The Pyramid-Technique: Towards Breaking the Curse of Dimensionality |
1998 |
SIGMOD |
0.0001523035 |
| 1,013 |
HD-Index: Pushing the Scalability-Accuracy Boundary for Approximate kNN Search in High-Dimensional Spaces |
2018 |
VLDB |
0.00014632051 |
| 1,225 |
SK-LSH : An Efficient Index Structure for Approximate Nearest Neighbor Search |
2014 |
VLDB |
0.00013182109 |
| 1,613 |
MindReader: Querying databases through multiple examples |
1998 |
VLDB |
0.00011141103 |
| 1,802 |
Local Dimensionality Reduction: A New Approach to Indexing High Dimensional Spaces |
2000 |
VLDB |
0.0001048177 |
| 1,923 |
The A-tree: An Index Structure for High-Dimensional Spaces Using Relative Approximation |
2000 |
VLDB |
0.00010079134 |
| 2,020 |
Efficient Retrieval of the Top-k Most Relevant Spatial Web Objects |
2009 |
VLDB |
9.7766925e-05 |
| 3,018 |
Approximate NN Queries on Streams with Guaranteed Error/performance Bounds |
2004 |
VLDB |
7.6995792e-05 |
| 3,259 |
A Revised R*-tree in Comparison with Related Index Structures |
2009 |
SIGMOD |
7.3101573e-05 |
| 3,278 |
Quadtree and R-tree Indexes in Oracle Spatial: A Comparison using GIS Data |
2002 |
SIGMOD |
7.2858181e-05 |
| 3,301 |
Indexing the Distance: An Efficient Method to KNN Processing |
2001 |
VLDB |
7.2450912e-05 |
| 3,340 |
Fast Time-Series Searching with Scaling and Shifting |
1999 |
PODS |
7.1987694e-05 |
| 4,096 |
Finding Near Neighbors Through Cluster Pruning |
2007 |
PODS |
6.4506806e-05 |
| 4,230 |
Locality-Sensitive Hashing Scheme based on Longest Circular Co-Substring |
2020 |
SIGMOD |
6.3337893e-05 |
| 5,530 |
Efficient Streaming Subgraph Isomorphism with Graph Neural Networks |
2021 |
VLDB |
5.4562393e-05 |
| 5,577 |
Revisiting the Index Construction of Proximity Graph-Based Approximate Nearest Neighbor Search |
2025 |
VLDB |
5.423881e-05 |
| 6,778 |
A New Method for Similarity Indexing of Market Basket Data |
1999 |
SIGMOD |
4.9237313e-05 |
| 8,354 |
Waffle: A Workload-Aware and Query-Sensitive Framework for Disk-Based Spatial Indexing |
2023 |
VLDB |
4.5329424e-05 |
| 8,687 |
A Generalized Approach for Reducing Expensive Distance Calls for A Broad Class of Proximity Problems |
2021 |
SIGMOD |
4.4621895e-05 |
| 8,759 |
Smooth Tradeoffs between Insert and Query Complexity in Nearest Neighbor Search |
2015 |
PODS |
4.4520434e-05 |
| 8,895 |
Fast and Adaptive Indexing of Multi-Dimensional Observational Data |
2016 |
VLDB |
4.423024e-05 |
| 9,119 |
Hypersphere Dominance: An Optimal Approach |
2014 |
SIGMOD |
4.3881453e-05 |
| 9,173 |
Similarity Query Processing Using Disk Arrays |
1998 |
SIGMOD |
4.3807204e-05 |
| 10,165 |
Fast-Convergent Proximity Graphs for Approximate Nearest Neighbor Search |
2026 |
SIGMOD |
4.1905499e-05 |
| 11,545 |
Fast Algorithm for Anchor Graph Hashing |
2021 |
VLDB |
4.1905499e-05 |
| 11,777 |
Efficient Ad-Hoc Graph Inference and Matching in Biological Databases |
2017 |
SIGMOD |
4.1905499e-05 |
| 12,285 |
Transforming Range Queries To Equivalent Box Queries To Optimize Page Access |
2010 |
VLDB |
4.1905499e-05 |
| 12,610 |
Efficiency-Quality Tradeoffs for Vector Score Aggregation |
2004 |
VLDB |
4.1905499e-05 |
| 12,634 |
The ND-Tree: A Dynamic Indexing Technique for Multidimensional Non-ordered Discrete Data Spaces |
2003 |
VLDB |
4.1905499e-05 |
| 12,679 |
Fast Evaluation Techniques for Complex Similarity Queries |
2001 |
VLDB |
4.1905499e-05 |
| 12,680 |
An Extendible Hash for Multi-Precision Similarity Querying of Image Databases |
2001 |
VLDB |
4.1905499e-05 |
| 12,756 |
Fast High-Dimensional Data Search in Incomplete Databases |
1998 |
VLDB |
4.1905499e-05 |