Computation and monitoring of exclusive closest pairs
U L.H.1; Mamoulis N.1; Yiu M.L.2
2008-12-01
Source PublicationIEEE Transactions on Knowledge and Data Engineering
ISSN10414347
Volume20Issue:12Pages:1641-1654
Abstract

Given two data sets A and B, their exclusive closest pairs (ECP) join is a one-to-one assignment of objects from the two data sets, such that 1 ) the closest pair (a, b) in A × B is in the result and 2) the remaining pairs are determined by removing objects a, b from A, B, respectively, and recursively searching for the next closest pair. A real application of ECP is the computation of (car and parking slot) assignments. This paper introduces the problem and proposes several solutions that solve it in main-memory, exploiting space partitioning. In addition, we define a dynamic version of the problem, where the objective is to continuously monitor the ECP join solution, in an environment where the joined data sets change positions and content. Finally, we study an extended form of the query, where objects in one of the two joined sets (e.g., parking slots) have a capacity constraint, allowing them to match with multiple objects from the other set (e.g., cars). We show how our techniques can be extended for this variant and compare them with a previous solution to this problem. Experimental results on a system prototype demonstrate the efficiency and applicability of the proposed algorithms. © 2008 IEEE.

KeywordQuery Processing Spatial Databases
DOI10.1109/TKDE.2008.85
URLView the original
Indexed BySCIE
Language英语
WOS Research AreaComputer Science ; Engineering
WOS SubjectComputer Science, Artificial Intelligence ; Computer Science, Information Systems ; Engineering, Electrical & Electronic
WOS IDWOS:000260057800006
Fulltext Access
Citation statistics
Cited Times [WOS]:9   [WOS Record]     [Related Records in WOS]
Document TypeJournal article
CollectionDEPARTMENT OF COMPUTER AND INFORMATION SCIENCE
Affiliation1.The University of Hong Kong
2.Aalborg Universitet
Recommended Citation
GB/T 7714
U L.H.,Mamoulis N.,Yiu M.L.. Computation and monitoring of exclusive closest pairs[J]. IEEE Transactions on Knowledge and Data Engineering,2008,20(12):1641-1654.
APA U L.H.,Mamoulis N.,&Yiu M.L..(2008).Computation and monitoring of exclusive closest pairs.IEEE Transactions on Knowledge and Data Engineering,20(12),1641-1654.
MLA U L.H.,et al."Computation and monitoring of exclusive closest pairs".IEEE Transactions on Knowledge and Data Engineering 20.12(2008):1641-1654.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[U L.H.]'s Articles
[Mamoulis N.]'s Articles
[Yiu M.L.]'s Articles
Baidu academic
Similar articles in Baidu academic
[U L.H.]'s Articles
[Mamoulis N.]'s Articles
[Yiu M.L.]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[U L.H.]'s Articles
[Mamoulis N.]'s Articles
[Yiu M.L.]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.