Fast Evaluation Techniques for Complex Similarity Queries
Summary: GeVAS: Generalized VA-File-based search for fast evaluation of complex, multi-feature similarity queries. Extends VA-File to feature types, enables parallel search over query objects, and offers distance-based variants for interactive retrieval. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Klemens Böhm
- 2. Michael Mlivoncic
- 3. Hans-Jörg Schek
- 4. Roger Weber
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 8 of 8 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 6 | The R*-tree: An Efficient and Robust Access Method for Points and Rectangles | 1990 | SIGMOD | 0.0016162015 |
| 17 | Optimizing Multi-Feature Queries for Image Databases | 2000 | VLDB | 0.00096067547 |
| 72 | Combining Fuzzy Information from Multiple Systems | 1996 | PODS | 0.00058577335 |
| 79 | A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces | 1998 | VLDB | 0.00056242144 |
| 91 | M-tree: An Efficient Access Method for Similarity Search in Metric Spaces | 1997 | VLDB | 0.0005181666 |
| 284 | The SR-tree: An Index Structure for High-Dimensional Nearest Neighbor Queries | 1997 | SIGMOD | 0.00028994728 |
| 1,925 | The A-tree: An Index Structure for High-Dimensional Spaces Using Relative Approximation | 2000 | VLDB | 0.00010073407 |
| 2,107 | What is the nearest neighbor in high dimensional spaces? | 2000 | VLDB | 9.5330494e-05 |
Previous
Page 1 / 1
Next