File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: All-nearest-neighbors queries in spatial databases

TitleAll-nearest-neighbors queries in spatial databases
Authors
KeywordsComputers
Software metrology and standardization
Issue Date2004
PublisherIEEE Computer Society.
Citation
The 16th International Conference on Scientific and Statistical Database Management, Santorini Island, Greece, 21-23 June 2004. In International Conference on Scientific and Statistical Database Management Proceedings, 2004, p. 297-306 How to Cite?
AbstractGiven two sets A and B of multidimensional objects, the all-nearest-neighbors (ANN) query retrieves for each object in A its nearest neighbor in B. Although this operation is common in several applications, it has not received much attention in the database literature. In this paper we study alternative methods for processing ANN queries depending on whether A and B are indexed: Our algorithms are evaluated through extensive experimentation using synthetic and real datasets. The performance studies show that they are an order of magnitude faster than a previous approach based on closest-pairs query processing.
Persistent Identifierhttp://hdl.handle.net/10722/45531
ISSN
References

 

DC FieldValueLanguage
dc.contributor.authorZhang, Jen_HK
dc.contributor.authorMamoulis, Nen_HK
dc.contributor.authorPapadias, Den_HK
dc.contributor.authorTao, Yen_HK
dc.date.accessioned2007-10-30T06:28:35Z-
dc.date.available2007-10-30T06:28:35Z-
dc.date.issued2004en_HK
dc.identifier.citationThe 16th International Conference on Scientific and Statistical Database Management, Santorini Island, Greece, 21-23 June 2004. In International Conference on Scientific and Statistical Database Management Proceedings, 2004, p. 297-306en_HK
dc.identifier.issn1551-6393en_HK
dc.identifier.urihttp://hdl.handle.net/10722/45531-
dc.description.abstractGiven two sets A and B of multidimensional objects, the all-nearest-neighbors (ANN) query retrieves for each object in A its nearest neighbor in B. Although this operation is common in several applications, it has not received much attention in the database literature. In this paper we study alternative methods for processing ANN queries depending on whether A and B are indexed: Our algorithms are evaluated through extensive experimentation using synthetic and real datasets. The performance studies show that they are an order of magnitude faster than a previous approach based on closest-pairs query processing.en_HK
dc.format.extent365889 bytes-
dc.format.extent4295 bytes-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypetext/plain-
dc.languageengen_HK
dc.publisherIEEE Computer Society.en_HK
dc.relation.ispartofInternational Conference on Scientific and Statistical Database Management Proceedings-
dc.rights©2004 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.-
dc.subjectComputersen_HK
dc.subjectSoftware metrology and standardizationen_HK
dc.titleAll-nearest-neighbors queries in spatial databasesen_HK
dc.typeConference_Paperen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=1551-6393&volume=&spage=297&epage=306&date=2004&atitle=All-nearest-neighbors+queries+in+spatial+databasesen_HK
dc.description.naturepublished_or_final_versionen_HK
dc.identifier.doi10.1109/SSDM.2004.1311221en_HK
dc.identifier.scopuseid_2-s2.0-5444228951-
dc.identifier.hkuros103375-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-5444228951&selection=ref&src=s&origin=recordpage-
dc.identifier.scopusauthoridZhang, J=14030943100-
dc.identifier.scopusauthoridMamoulis, N=6701782749-
dc.identifier.scopusauthoridPapadias, D=7005757795-
dc.identifier.scopusauthoridTao, Y=7402420191-
dc.customcontrol.immutablesml 160107 - amend-
dc.identifier.issnl1551-6393-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats