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)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Rui Zhu (Shenyang Aerospace University)
- 2. Bin Wang (Northeastern University)
- 3. Xiaochun Yang (Northeastern University)
- 4. Baihua Zheng (Singapore Management University)
BibTeX Citation
@inproceedings{zhu_sigmod23,
title = {{Closest Pairs Search Over Data Stream}},
author = {Zhu, Rui and Wang, Bin and Yang, Xiaochun and Zheng, Baihua},
series = {{SIGMOD} '23},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3617326},
url = {https://dl.acm.org/doi/10.1145/3617326},
year = {2023}
}Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,189 | Adaptive Outlier Detection over Data Stream | 2026 | SIGMOD | 5.093636e-05 |
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.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,137 | A Cost Model For Nearest Neighbor Search in High-Dimensional Data Space | 1997 | PODS | 0.00012027131 |
| 1,685 | Closest Pair Queries in Spatial Databases | 2000 | SIGMOD | 0.00010017073 |
| 1,698 | A Generic Framework for Monitoring Continuous Spatial Queries over Moving Objects | 2005 | SIGMOD | 9.980335e-05 |
| 2,205 | Conceptual Partitioning: An Efficient Method for Continuous Nearest Neighbor Monitoring | 2005 | SIGMOD | 8.9591376e-05 |
| 3,562 | Location-based Spatial Queries | 2003 | SIGMOD | 7.3080612e-05 |
| 4,937 | The V*-Diagram: A Query-Dependent Approach to Moving KNN Queries | 2008 | VLDB | 6.4350791e-05 |
| 7,023 | C2P: Clustering based on Closest Pairs | 2001 | VLDB | 5.7242118e-05 |
| 7,140 | Continuous Obstructed Nearest Neighbor Queries in Spatial Databases | 2009 | SIGMOD | 5.6928705e-05 |
| 8,206 | Mining Top-k Pairs of Correlated Subgraphs in a Large Network | 2020 | VLDB | 5.4666548e-05 |
| 9,080 | Processing Moving kNN Queries Using Influential Neighbor Sets | 2015 | VLDB | 5.3251649e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 21 | Similarity Search in High Dimensions via Hashing | 1999 | VLDB |
| 2 | 1,281 | Continuous Nearest Neighbor Search | 2002 | VLDB |
| 3 | 3,866 | Fast Parallel Similarity Search in Multimedia Databases | 1997 | SIGMOD |
| 4 | 2,205 | Conceptual Partitioning: An Efficient Method for Continuous Nearest Neighbor Monitoring | 2005 | SIGMOD |
| 5 | 1,605 | Efficient Search for the Top-k Probable Nearest Neighbors in Uncertain Databases | 2008 | VLDB |
| 6 | 93 | Fast Approximate Nearest Neighbor Search With The Navigating Spreading-out Graph | 2019 | VLDB |
| 7 | 7,426 | Dynamic Range-Filtering Approximate Nearest Neighbor Search | 2025 | VLDB |
| 8 | 1,685 | Closest Pair Queries in Spatial Databases | 2000 | SIGMOD |
| 9 | 1,244 | Efficient Approximate Nearest Neighbor Search in Multi-dimensional Databases | 2023 | SIGMOD |
| 10 | 2,886 | Approximate NN Queries on Streams with Guaranteed Error/performance Bounds | 2004 | VLDB |