File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Aggregate nearest neighbor queries in road networks

TitleAggregate nearest neighbor queries in road networks
Authors
Yiu, MLMamoulis, NPapadias, D
KeywordsLocation-dependent and sensitive
Query processing
Spatial databases
Spatial databases and GIS
Issue Date2005
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, 2005, v. 17 n. 6, p. 820-833 How to Cite?
DOI: http://dx.doi.org/10.1109/TKDE.2005.87
AbstractAggregate nearest neighbor queries return the object that minimizes an aggregate distance function with respect to a set of query points. Consider, for example, several users at specific locations (query points) that want to find the restaurant (data point), which leads to the minimum sum of distances that they have to travel in order to meet. We study the processing of such queries for the case where the position and accessibility of spatial objects are constrained by spatial (e.g., road) networks. We consider alternative aggregate functions and techniques that utilize Euclidean distance bounds, spatial access methods, and/or network distance materialization structures. Our algorithms are experimentally evaluated with synthetic and real data. The results show that their relative performance depends on the problem characteristics. © 2005 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/43625
ISSN
1041-4347
2023 Impact Factor: 8.9
2023 SCImago Journal Rankings: 2.867
ISI Accession Number ID
WOS:000228453300009
References
References in Scopus

 

DC FieldValueLanguage
dc.contributor.authorYiu, MLen_HK
dc.contributor.authorMamoulis, Nen_HK
dc.contributor.authorPapadias, Den_HK
dc.date.accessioned2007-03-23T04:50:45Z-
dc.date.available2007-03-23T04:50:45Z-
dc.date.issued2005en_HK
dc.identifier.citationIeee Transactions On Knowledge And Data Engineering, 2005, v. 17 n. 6, p. 820-833en_HK
dc.identifier.issn1041-4347en_HK
dc.identifier.urihttp://hdl.handle.net/10722/43625-
dc.description.abstractAggregate nearest neighbor queries return the object that minimizes an aggregate distance function with respect to a set of query points. Consider, for example, several users at specific locations (query points) that want to find the restaurant (data point), which leads to the minimum sum of distances that they have to travel in order to meet. We study the processing of such queries for the case where the position and accessibility of spatial objects are constrained by spatial (e.g., road) networks. We consider alternative aggregate functions and techniques that utilize Euclidean distance bounds, spatial access methods, and/or network distance materialization structures. Our algorithms are experimentally evaluated with synthetic and real data. The results show that their relative performance depends on the problem characteristics. © 2005 IEEE.en_HK
dc.format.extent1529837 bytes-
dc.format.extent26624 bytes-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypeapplication/msword-
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.rights©2005 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.subjectLocation-dependent and sensitiveen_HK
dc.subjectQuery processingen_HK
dc.subjectSpatial databasesen_HK
dc.subjectSpatial databases and GISen_HK
dc.titleAggregate nearest neighbor queries in road networksen_HK
dc.typeArticleen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=1041-4347&volume=17&issue=6&spage=820&epage=833&date=2005&atitle=Aggregate+nearest+neighbor+queries+in+road+networksen_HK
dc.identifier.emailMamoulis, N:nikos@cs.hku.hken_HK
dc.identifier.authorityMamoulis, N=rp00155en_HK
dc.description.naturepublished_or_final_versionen_HK
dc.identifier.doi10.1109/TKDE.2005.87en_HK
dc.identifier.scopuseid_2-s2.0-20844452621en_HK
dc.identifier.hkuros103322-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-20844452621&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume17en_HK
dc.identifier.issue6en_HK
dc.identifier.spage820en_HK
dc.identifier.epage833en_HK
dc.identifier.isiWOS:000228453300009-
dc.publisher.placeUnited Statesen_HK
dc.identifier.scopusauthoridYiu, ML=8589889600en_HK
dc.identifier.scopusauthoridMamoulis, N=6701782749en_HK
dc.identifier.scopusauthoridPapadias, D=7005757795en_HK
dc.identifier.citeulike302445-
dc.identifier.issnl1041-4347-

Export via OAI-PMH Interface in XML Formats

OR

Export to Other Non-XML Formats