Closest pairs search over data stream

• Main Authors: ZHU, Rui Zhu, WANG, Bin, YANG, Xiaochun, ZHENG, Baihua
• Format: text
• Language: English
• Published: Institutional Knowledge at Singapore Management University 2024
• Subjects: Streaming Data; ��-Closest Pair Search; Partition; Cube; Databases and Information Systems
• Online Access: https://ink.library.smu.edu.sg/sis_research/9097; https://ink.library.smu.edu.sg/context/sis_research/article/10100/viewcontent/3617326_vor.pdf
• Institution: Singapore Management University

��-closest pair (KCP for short) search is a fundamental problem in database research. Given a set of��-dimensional streaming data S, KCP search aims to retrieve �� pairs with the shortest distances between them. While existing works have studied continuous 1-closest pair query (i.e., �� = 1) over dy...