Database Paper Browser

Back to papers

Efficient k-NN Search on Vertically Decomposed Data

Summary: Proposes vertical data decomposition and a BnB variant that trims high-dimensional space to a small k-NN candidate set. Applied to two image-similarity metrics, it outlines relational-DB implementation and reports speedups on real and synthetic data. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
3360
Venue
SIGMOD
Year
2002
Pagerank
6.9502303e-05
Overall Rank
3,579 | 75.11%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 7 of 7 citing papers.

Previous Page 1 / 1 Next

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.

Previous Page 1 / 1 Next

Semantically Similar Papers