File Download
There are no files associated with this item.
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: Continuous monitoring of exclusive closest pairs
Title | Continuous monitoring of exclusive closest pairs |
---|---|
Authors | |
Issue Date | 2007 |
Publisher | Springer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/ |
Citation | Lecture Notes In Computer Science (Including Subseries Lecture Notes In Artificial Intelligence And Lecture Notes In Bioinformatics), 2007, v. 4605 LNCS, p. 1-19 How to Cite? |
Abstract | Given two datasets A and B, their exclusive closest pairs (ECP) join is a one-to-one assignment of objects from the two datasets, such that (i) the closest pair (a, b) in A × B is in the result and (ii) the remaining pairs are determined by removing objects a, b from A, B respectively, and recursively searching for the next closest pair. An application of exclusive closest pairs is the computation of (car, parking slot) assignments. In this paper, we propose algorithms for the computation and continuous monitoring of ECP joins in memory, given a stream of events that indicate dynamic assignment requests and releases of pairs. Experimental results on a system prototype demonstrate the efficiency of our solutions in practice. © Springer-Verlag Berlin Heidelberg 2007. |
Persistent Identifier | http://hdl.handle.net/10722/93331 |
ISSN | 2023 SCImago Journal Rankings: 0.606 |
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Leong Hou, U | en_HK |
dc.contributor.author | Mamoulis, N | en_HK |
dc.contributor.author | Yiu, ML | en_HK |
dc.date.accessioned | 2010-09-25T14:57:51Z | - |
dc.date.available | 2010-09-25T14:57:51Z | - |
dc.date.issued | 2007 | en_HK |
dc.identifier.citation | Lecture Notes In Computer Science (Including Subseries Lecture Notes In Artificial Intelligence And Lecture Notes In Bioinformatics), 2007, v. 4605 LNCS, p. 1-19 | en_HK |
dc.identifier.issn | 0302-9743 | en_HK |
dc.identifier.uri | http://hdl.handle.net/10722/93331 | - |
dc.description.abstract | Given two datasets A and B, their exclusive closest pairs (ECP) join is a one-to-one assignment of objects from the two datasets, such that (i) the closest pair (a, b) in A × B is in the result and (ii) the remaining pairs are determined by removing objects a, b from A, B respectively, and recursively searching for the next closest pair. An application of exclusive closest pairs is the computation of (car, parking slot) assignments. In this paper, we propose algorithms for the computation and continuous monitoring of ECP joins in memory, given a stream of events that indicate dynamic assignment requests and releases of pairs. Experimental results on a system prototype demonstrate the efficiency of our solutions in practice. © Springer-Verlag Berlin Heidelberg 2007. | en_HK |
dc.language | eng | en_HK |
dc.publisher | Springer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/ | en_HK |
dc.relation.ispartof | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | en_HK |
dc.title | Continuous monitoring of exclusive closest pairs | en_HK |
dc.type | Conference_Paper | en_HK |
dc.identifier.email | Mamoulis, N:nikos@cs.hku.hk | en_HK |
dc.identifier.authority | Mamoulis, N=rp00155 | en_HK |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.scopus | eid_2-s2.0-37849048363 | en_HK |
dc.identifier.hkuros | 136120 | en_HK |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-37849048363&selection=ref&src=s&origin=recordpage | en_HK |
dc.identifier.volume | 4605 LNCS | en_HK |
dc.identifier.spage | 1 | en_HK |
dc.identifier.epage | 19 | en_HK |
dc.publisher.place | Germany | en_HK |
dc.identifier.scopusauthorid | Leong Hou, U=23135408200 | en_HK |
dc.identifier.scopusauthorid | Mamoulis, N=6701782749 | en_HK |
dc.identifier.scopusauthorid | Yiu, ML=8589889600 | en_HK |
dc.identifier.issnl | 0302-9743 | - |