Article

Distance join queries on spatial networks

Authors:

Jagan Sankaranarayanan,

Houman Alborzi,

Hanan SametAuthors Info & Claims

GIS '06: Proceedings of the 14th annual ACM international symposium on Advances in geographic information systems

Pages 211 - 218

https://doi.org/10.1145/1183471.1183506

Published: 10 November 2006 Publication History

Abstract

The result of a distance join operation on two sets of objects R, S on a spatial network G is a set P of object pairs pq, p É R, q É S such that the distance of an object pair pq is the shortest distance from p to q in G. Several variations to the distance join operation such as UnOrdered, Incremental, topk, Semi-Join impose additional constraints on the distance between the object pairs in P, the ordering of object pairs in P, and on the cardinality of P. A distance join algorithm on spatial networks is proposed that works in conjunction with the SILC framework, which is a new approach to query processing on spatial networks. Experimental results demonstrate up to an order of magnitude speed up when compared with a prominent existing technique.

References

[1]

S. N. Bespamyatnikh. An optimal algorithm for closest pair maintenance. In SCG '95: Proceedings of the Annual Symposium on Computational Geometry, pages 152--161, Vancouver, Canada, June 1995.

Digital Library

[2]

T. Brinkhoff, H.-P. Kriegel, and B. Seeger. Efficient processing of spatial joins using R-trees. In SIGMOD '93: Proceedings of the ACM SIGMOD Conference, pages 237--246, Washington, DC, May 1993.

Digital Library

[3]

M. J. Carey and D. Kossmann. On saying "enough already!" in SQL. In SIGMOD '97: Proceedings of the International Conference on Management of Data, pages 219--230, Tucson, AZ, May 1997.

Digital Library

[4]

H.-J. Cho and C.-W. Chung. An efficient and scalable approach to CNN queries in a road network. In VLDB'05: Proceedings of the 31th International Conference on Very Large Data Bases, pages 865--876, Trondheim, Norway, Sept. 2005.

Digital Library

[5]

K. L. Clarkson. Fast algorithm for the all nearest neighbors problem. In FOCS '83: Proceedings of the 24th IEEE Annual Symposium on Foundations of Computer Science, pages 226--232, Tucson, AZ, Nov. 1983.

Digital Library

[6]

I. Gargantini. An effective way to represent quadtrees. Commun. ACM, 25(12):905--910, Dec. 1982.

Digital Library

[7]

A. V. Goldberg and R. F. Werneck. Computing point-to-point shortest paths from external memory. In ALENEX '05: Proceedings of the 7th Workshop on Algorithm Engineering and Experiments, Vancouver, Canada, Jan. 2005.

[8]

A. Guttman. R-trees: a dynamic index structure for spatial searching. In SIGMOD '84: Proceedings of the International Conference on Management of Data, pages 47--57, Boston, MA, June 1984.

Digital Library

[9]

G. R. Hjaltason and H. Samet. Ranking in spatial databases. In SSD '95: Proceedings of the 4th International Symposium on Large Spatial Databases, pages 83--95, Portland, ME, Aug. 1995.

Digital Library

[10]

G. R. Hjaltason and H. Samet. Incremental distance join algorithms for spatial databases. In SIGMOD '98: Proceedings of the International Conference on Management of Data, pages 237--248, Seattle, WA, June 1998.

Digital Library

[11]

N. Jing, Y.-W. Huang, and E. A. Rundensteiner. Hierarchical encoded path views for path query processing: an optimal model and its performance evaluation. IEEE Transactions on Knowledge and Data Engineering, 10(3):409--432, May 1998.

Digital Library

[12]

M. R. Kolahdouzan and C. Shahabi. Voronoi-based k nearest neighbor search for spatial network databases. In VLDB'04: Proceedings of the 30th International Conference on Very Large Data Bases, pages 840--851, Toronto, Canada, Sept. 2004.

Digital Library

[13]

D. Papadias, J. Zhang, N. Mamoulis, and Y. Tao. Query processing in spatial network databases. In VLDB'03: Proceedings of the 29th International Conference on Very Large Databases, pages 802--813, Berlin, Germany, Sept. 2003.

Digital Library

[14]

H. Samet. Foundations of Multidimensional and Metric Data Structures. Morgan-Kaufmann, San Francisco, CA, Aug. 2006.

Digital Library

[15]

J. Sankaranarayanan, H. Alborzi, and H. Samet. Efficient query processing on spatial networks. In GIS'05: Proceedings of the 13th ACM International Workshop on Geographic Information Systems, pages 200--209, Bremen, Germany, Nov. 2005.

Digital Library

[16]

C. Shahabi, M. R. Kolahdouzan, and M. Sharifzadeh. A road network embedding technique for k-nearest neighbor search in moving object databases. GeoInformatica, 7(3):255--273, Sept. 2003.

Digital Library

[17]

S. Shekhar and J. S. Yoo. Processing in-route nearest neighbor queries: a comparison of alternative approaches. In GIS '03: Proceedings of the 11th ACM International Symposium on Advances in Geographic Information Systems, pages 9--16, New Orleans, LA, 2003.

Digital Library

[18]

H. Shin, B. Moon, and S. Lee. Adaptive multi-stage distance join processing. In SIGMOD '00: Proceedings of the International Conference on Management of Data, pages 343--354, Dallas, TX, May 2000.

Digital Library

[19]

P. M. Vaidya. An O(n log n) algorithm for the all-nearest-neighbor problem. Discrete & Computational Geometry, 4(2):101--115, 1989.

Digital Library

[20]

O. Wolfson, P. Sistla, B. Xu, J. Zhou, and S. Chamberlain. Domino: databases for moving objects tracking. In SIGMOD '99: Proceedings of the International Conference on Management of Data, pages 547--549, Philadelphia, PA, June 1999.

Digital Library

Cited By

Hotz MChondrogiannis TWörteler LGrossniklaus M(2021)Online Landmark-Based Batch Processing of Shortest Path QueriesProceedings of the 33rd International Conference on Scientific and Statistical Database Management10.1145/3468791.3468844(133-144)Online publication date: 6-Jul-2021
https://dl.acm.org/doi/10.1145/3468791.3468844
Jin RPeng ZWu WDragan FAgrawal GRen BAyguadé EHwu WBadia RHofstee H(2020)Parallelizing pruned landmark labelingProceedings of the 34th ACM International Conference on Supercomputing10.1145/3392717.3392745(1-13)Online publication date: 29-Jun-2020
https://dl.acm.org/doi/10.1145/3392717.3392745
Cho HAttique M(2020)Group Processing of Multiple k-Farthest Neighbor Queries in Road NetworksIEEE Access10.1109/ACCESS.2020.30022638(110959-110973)Online publication date: 2020
https://doi.org/10.1109/ACCESS.2020.3002263
Show More Cited By

Index Terms

Distance join queries on spatial networks

Recommendations

Efficient query processing on spatial networks
GIS '05: Proceedings of the 13th annual ACM international workshop on Geographic information systems

A framework for determining the shortest path and the distance between every pair of vertices on a spatial network is presented. The framework, termed SILC, uses path coherence between the shortest path and the spatial positions of vertices on the ...
A Taxonomy for Distance-Based Spatial Join Queries

Join operation is one of the most used operations in database management systems, including spatial databases. Hence, spatial join queries are very important in spatial database processing. There are many different kinds of spatial join queries, due to ...
New plane-sweep algorithms for distance-based join queries in spatial databases

Efficient and effective processing of the distance-based join query (DJQ) is of great importance in spatial databases due to the wide area of applications that may address such queries (mapping, urban planning, transportation planning, resource ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

GIS '06: Proceedings of the 14th annual ACM international symposium on Advances in geographic information systems

November 2006

264 pages

ISBN:1595935290

DOI:10.1145/1183471

General Chairs:
Rolf A. de By
ITC, The Netherlands
,
Silvia Nittel
University of Maine, USA

Copyright © 2006 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 10 November 2006

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

CIKM06

Sponsor:

CIKM06: Conference on Information and Knowledge Management

November 10 - 11, 2006

Virginia, Arlington, USA

Acceptance Rates

Overall Acceptance Rate 257 of 1,238 submissions, 21%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

28
Total Citations
View Citations
463
Total Downloads

Downloads (Last 12 months)3
Downloads (Last 6 weeks)1

Reflects downloads up to 28 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Hotz MChondrogiannis TWörteler LGrossniklaus M(2021)Online Landmark-Based Batch Processing of Shortest Path QueriesProceedings of the 33rd International Conference on Scientific and Statistical Database Management10.1145/3468791.3468844(133-144)Online publication date: 6-Jul-2021
https://dl.acm.org/doi/10.1145/3468791.3468844
Jin RPeng ZWu WDragan FAgrawal GRen BAyguadé EHwu WBadia RHofstee H(2020)Parallelizing pruned landmark labelingProceedings of the 34th ACM International Conference on Supercomputing10.1145/3392717.3392745(1-13)Online publication date: 29-Jun-2020
https://dl.acm.org/doi/10.1145/3392717.3392745
Cho HAttique M(2020)Group Processing of Multiple k-Farthest Neighbor Queries in Road NetworksIEEE Access10.1109/ACCESS.2020.30022638(110959-110973)Online publication date: 2020
https://doi.org/10.1109/ACCESS.2020.3002263
Ayhan SCostas PSamet H(2019)A Data-driven Framework for Long-Range Aircraft Conflict Detection and ResolutionACM Transactions on Spatial Algorithms and Systems10.1145/33288325:4(1-23)Online publication date: 12-Sep-2019
https://dl.acm.org/doi/10.1145/3328832
Cho H(2018)Shared Execution Approach to ε-Distance Join Queries in Dynamic Road NetworksISPRS International Journal of Geo-Information10.3390/ijgi70702707:7(270)Online publication date: 10-Jul-2018
https://doi.org/10.3390/ijgi7070270
Wei HFellegara RWang YDe Floriani LSamet HBanaei-Kashani FHoel EGüting RTamassia RXiong L(2018)Multi-level filtering to retrieve similar trajectories under the Fréchet distanceProceedings of the 26th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems10.1145/3274895.3274978(600-603)Online publication date: 6-Nov-2018
https://dl.acm.org/doi/10.1145/3274895.3274978
Ayhan SCostas PSamet HBanaei-Kashani FHoel EGüting RTamassia RXiong L(2018)Prescriptive analytics system for long-range aircraft conflict detection and resolutionProceedings of the 26th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems10.1145/3274895.3274947(239-248)Online publication date: 6-Nov-2018
https://dl.acm.org/doi/10.1145/3274895.3274947
Peng SSankaranarayanan JSamet HBanaei-Kashani FHoel EGüting RTamassia RXiong L(2018)DOSProceedings of the 26th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems10.1145/3274895.3274898(199-208)Online publication date: 6-Nov-2018
https://dl.acm.org/doi/10.1145/3274895.3274898
Ayhan SCostas PSamet HGuo YFarooq F(2018)Predicting Estimated Time of Arrival for Commercial FlightsProceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining10.1145/3219819.3219874(33-42)Online publication date: 19-Jul-2018
https://dl.acm.org/doi/10.1145/3219819.3219874
Samet H(2018)Sorting in Space and Words2018 IEEE 34th International Conference on Data Engineering (ICDE)10.1109/ICDE.2018.00222(1719-1722)Online publication date: May-2018
https://doi.org/10.1109/ICDE.2018.00222
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten