Improving Adaptable Similarity Query Processing by Using Approximations

Summary: Conservative approximations cut exact distance computations for adaptable quad-form similarity, enabling efficient kNN with no false drops. Experiments on synthetic data and a 112k-image color database show up to 6× speedups with multidimensional indexes. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 8680
Venue: VLDB
Year: 1998
Pagerank: 6.0702428e-05
Overall Rank: 5,838 | 59.95%
DOI: -

Incoming Non-self Citations Over Time

Authors

1. Mihael Ankerst (University of Munich)
2. Bernhard Braunmüller (University of Munich)
3. Hans-Peter Kriegel (University of Munich)
4. Thomas Seidl (University of Munich)

BibTeX Citation

@article{ankerst_vldb98,
        title = {{Improving Adaptable Similarity Query Processing by Using Approximations}},
        author = {Ankerst, Mihael and Braunmüller, Bernhard and Kriegel, Hans-Peter and Seidl, Thomas},
        journal = {PVLDB},
        series = {{VLDB} '98},
        pages = {206},
        year = {1998}
}

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
8,178	Adaptable Similarity Search using Non-Relevant Information	2002	VLDB	5.4728384e-05
8,391	Similarity Search for Adaptive Ellipsoid Queries Using Spatial Transformation	2001	VLDB	5.4356884e-05
8,442	Efficient Geometry-based Similarity Search of 3D Spatial Databases	1999	SIGMOD	5.4246876e-05

Outgoing Citations (Sorted by Pagerank)

Showing 14 of 14 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank	Cited Paper	Year	Venue	Pagerank
2	R-Trees: A Dynamic Index Structure For Spatial Searching	1984	SIGMOD	0.0020210012
4	The R*-tree: An Efficient and Robust Access Method for Points and Rectangles	1990	SIGMOD	0.001157935
28	Nearest Neighbor Queries	1995	SIGMOD	0.00052102434
41	Fast Subsequence Matching in Time-Series Databases	1994	SIGMOD	0.00046675394
42	The R+-Tree: A Dynamic Multi-Dimensional Index for Objects	1987	VLDB	0.00046170812
85	The X-tree: An Index Structure for High-Dimensional Data	1996	VLDB	0.00035405879
350	A Retrieval Technique for Similar Shapes	1991	SIGMOD	0.00020425134
371	Fast Similarity Search in the Presence of Noise, Scaling, and Translation in Time-Series Databases	1995	VLDB	0.00019869565
796	Optimal Multi-Step k-Nearest Neighbor Search	1998	SIGMOD	0.00013932561
815	Fast Nearest Neighbor Search in Medical Image Databases	1996	VLDB	0.00013835761
1,137	A Cost Model For Nearest Neighbor Search in High-Dimensional Data Space	1997	PODS	0.00012027131
1,776	Efficient User-Adaptable Similarity Search in Large Multimedia Databases	1997	VLDB	9.7853414e-05
3,866	Fast Parallel Similarity Search in Multimedia Databases	1997	SIGMOD	7.061829e-05
8,392	S3: Similarity Search in CAD Database Systems	1997	SIGMOD	5.4356884e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	12,944	Algorithms for Querying by Spatial Structure	1998	VLDB
2	797	Dimensionality Reduction for Similarity Searching in Dynamic Databases	1998	SIGMOD
3	8,655	A Non-Linear Dimensionality-Reduction Technique for Fast Similarity Search in Large Databases	2006	SIGMOD
4	3,866	Fast Parallel Similarity Search in Multimedia Databases	1997	SIGMOD
5	1,384	Content-Based Image Indexing	1994	VLDB
6	8,442	Efficient Geometry-based Similarity Search of 3D Spatial Databases	1999	SIGMOD
7	21	Similarity Search in High Dimensions via Hashing	1999	VLDB
8	796	Optimal Multi-Step k-Nearest Neighbor Search	1998	SIGMOD
9	8,391	Similarity Search for Adaptive Ellipsoid Queries Using Spatial Transformation	2001	VLDB
10	1,776	Efficient User-Adaptable Similarity Search in Large Multimedia Databases	1997	VLDB