Database Paper Browser

Back to papers

Closest Pairs Search Over Data Stream

Summary: Introduces k-closest pair (KCP) search over streaming data, enabling incremental maintenance for arbitrary k. Proposes NNS (Nearest-Neighbor Set) and TNNS, plus a tau-DLBP partition, to access only O(k) objects and support efficient KCP updates on data streams. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
6709
Venue
SIGMOD
Year
2023
Pagerank
4.1945683e-05
Overall Rank
11,207 | 22.04%
DOI
10.1145/3617326

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

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 10 of 10 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