File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Computation and monitoring of exclusive closest pairs

TitleComputation and monitoring of exclusive closest pairs
Authors
KeywordsQuery processing
Spatial databases
Issue Date2008
PublisherI E E E. The Journal's web site is located at http://www.computer.org/tkde
Citation
Ieee Transactions On Knowledge And Data Engineering, 2008, v. 20 n. 12, p. 1641-1654 How to Cite?
AbstractGiven 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.
Persistent Identifierhttp://hdl.handle.net/10722/60612
ISSN
2015 Impact Factor: 2.476
2015 SCImago Journal Rankings: 2.087
ISI Accession Number ID
Funding AgencyGrant Number
Hong Kong RGCHKU 7160/05E
Funding Information:

This work was supported by grant HKU 7160/05E from Hong Kong RGC.

References
Grants

 

DC FieldValueLanguage
dc.contributor.authorU, LHen_HK
dc.contributor.authorMamoulis, Nen_HK
dc.contributor.authorYiu, MLen_HK
dc.date.accessioned2010-05-31T04:14:58Z-
dc.date.available2010-05-31T04:14:58Z-
dc.date.issued2008en_HK
dc.identifier.citationIeee Transactions On Knowledge And Data Engineering, 2008, v. 20 n. 12, p. 1641-1654en_HK
dc.identifier.issn1041-4347en_HK
dc.identifier.urihttp://hdl.handle.net/10722/60612-
dc.description.abstractGiven 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.en_HK
dc.languageengen_HK
dc.publisherI E E E. The Journal's web site is located at http://www.computer.org/tkdeen_HK
dc.relation.ispartofIEEE Transactions on Knowledge and Data Engineeringen_HK
dc.subjectQuery processingen_HK
dc.subjectSpatial databasesen_HK
dc.titleComputation and monitoring of exclusive closest pairsen_HK
dc.typeArticleen_HK
dc.identifier.emailMamoulis, N:nikos@cs.hku.hken_HK
dc.identifier.authorityMamoulis, N=rp00155en_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1109/TKDE.2008.85en_HK
dc.identifier.scopuseid_2-s2.0-56149092436en_HK
dc.identifier.hkuros154828en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-56149092436&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume20en_HK
dc.identifier.issue12en_HK
dc.identifier.spage1641en_HK
dc.identifier.epage1654en_HK
dc.identifier.isiWOS:000260057800006-
dc.publisher.placeUnited Statesen_HK
dc.relation.projectContinuous Constraint Query Evaluation for Spatio-temporal Data Sequences-
dc.identifier.scopusauthoridU, LH=25647036700en_HK
dc.identifier.scopusauthoridMamoulis, N=6701782749en_HK
dc.identifier.scopusauthoridYiu, ML=8589889600en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats