research-article

Voronoi-based range query for trajectory data in spatial networks

Authors:

Gencai ChenAuthors Info & Claims

SAC '11: Proceedings of the 2011 ACM Symposium on Applied Computing

Pages 1022 - 1026

https://doi.org/10.1145/1982185.1982410

Published: 21 March 2011 Publication History

Abstract

Query processing for trajectory data is very important to spatio-temporal databases. Most of the research work in this field is based on the Euclidean space. However, in many applications, the spatio-temporal trajectories of moving objects are distributed in spatial network environment intensively, and the movements of moving objects are constrained by given network segments. Under such circumstances, existing Euclidean-based methods are ineffective. In this paper, we present a Network Voronoi Diagram (NVD) based method, to solve range query problem on a huge amount of spatio-temporal trajectories in spatial networks. The experiments demonstrated that our method is very efficient even when the trajectory datasets are huge.

References

[1]

Cai, Y., and Ng., R. Indexing spatio-temporal trajectories with chebyshev polynomials. In Proc. SIGMOD, pages 599--610, 2004.

Digital Library

[2]

Trajcevski, G., Ding, H., and Scheuermann, P. Contextaware optimization of continuous range queries maintenance for trajectories. In Proc. MobiDE, pages 1--8, 2005.

Digital Library

[3]

Hadjieleftheriou, M., Kollios, G., Bakalov, P., and Tsotras, V. J. Complex spatio-temporal pattern queries. In Proc. VLDB, pages 877--888, 2005.

Digital Library

[4]

Rasetic, S., Sander, J., Elding, J., and Nascimento, M. A. A trajectory splitting model for efficient spatio-temporal indexing. In Proc. VLDB, pages 934--945, 2005.

Digital Library

[5]

Chen, Z., Shen, H. T., Zhou, X., Zheng, Y., and Xie, X. Searching trajectories by locations - an efficiency study. In Proc. SIGMOD, pages 255--266, 2010.

Digital Library

[6]

Vieria, M. R., Bakalov, P., and Tsotras, V. J. Querying trajectories using flexible patterns. In Proc. EDBT, pages 406--417, 2010.

Digital Library

[7]

Papadias, D., Zhang, J., Mamoulis, N., and Tao, Y. Query processing in spatial network databases. In Proc. VLDB, pages 802--813, 2003.

Digital Library

[8]

Sankaranarayanan, J., Alborzi, H., and Samet, H. Efficient query processing on spatial networks. In Proc. GIS, pages 200--209, 2005.

Digital Library

[9]

Hu, H., Lee, D. L., and Lee, V. C. S. Distance indexing on road networks. In Proc. VLDB, pages 894--905, 2006.

Digital Library

[10]

Kriegel, H-P., Kröger, P., Kunath, P., Renz, M., and Schmidt, T. Proximity queries in large traffic networks. In Proc. GIS, pages 1--8, 2007.

Digital Library

[11]

Okabe, A., Boots, B., Sugihara, K., and Chiu, S. N. Spatial tessellations: Concepts and applications of voronoi diagrams, second edition, John Wiley and Sons Ltd., 2000.

Digital Library

[12]

Cormen, T. H., Leiserson, C. E., Rivest, R. L., and Stein, C. Introduction to algorithms, second edition, MIT Press, 2001.

Digital Library

[13]

Kolahdouzan, M., and Shahabi, C. Voronoi-based k nearest neighbor search for spatial network databases. In Proc. VLDB, pages 840--851, 2004.

Digital Library

[14]

Guttman, A. R-trees: a dynamic index structure for spatial searching. In Proc. SIGMOD, pages 47--57, 1984.

Digital Library

[15]

SANET. Available at: http://sanet.csis.u-tokyo.ac.jp.

[16]

Xuan, K., Zhao, G., Taniar, D., Srinivasan, B., Safar, M., and Gavrilova, M. Network Voronoi Diagram Based Range Search. In Proc. AINA, pages 741--748, 2009.

Digital Library

Cited By

Shi YHuang SZheng CJi H(2019)A Hybrid Aggregate Index Method for Trajectory DataMathematical Problems in Engineering10.1155/2019/17848642019:1Online publication date: 18-Aug-2019
https://doi.org/10.1155/2019/1784864
Shi YHuang SFeng JLu J(2019)A Probabilistic Range Query of Moving Objects in Road NetworkIEEE Access10.1109/ACCESS.2019.29071087(40165-40174)Online publication date: 2019
https://doi.org/10.1109/ACCESS.2019.2907108
Chen LTang YLv MChen G(2015)Partition-based range query for uncertain trajectories in road networksGeoinformatica10.1007/s10707-014-0206-619:1(61-84)Online publication date: 1-Jan-2015
https://dl.acm.org/doi/10.1007/s10707-014-0206-6

Index Terms

Voronoi-based range query for trajectory data in spatial networks
1. Human-centered computing
  1. Visualization
    1. Visualization application domains
      1. Geographic visualization
2. Information systems
  1. Information systems applications
    1. Spatial-temporal systems

Recommendations

A New Signature-Based Indexing Scheme for Trajectories of Moving Objects on Spatial Networks
ICCS '08: Proceedings of the 8th international conference on Computational Science, Part I

Because moving objects usually move on spatial networks, their trajectories play an important role in indexing them for spatial network databases. In this paper, we propose a new signature-based indexing scheme for moving objects' trajectories on ...
Efficient trajectory compression and range query processing
Abstract
Nowadays, there are ubiquitousness of GPS sensors in various devices collecting, transmitting and storing tremendous trajectory data. However, such an unprecedented scale of GPS data has put great pressure on transmitting it on the internet and ...
Partition-based range query for uncertain trajectories in road networks

Query processing for trajectory data is a hot topic in the field of moving objects databases (MODs). Most of the previous research work focused on the Euclidean space, and the uncertain trajectories are represented as sheared cylinders. However, in many ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SAC '11: Proceedings of the 2011 ACM Symposium on Applied Computing

March 2011

1868 pages

ISBN:9781450301138

DOI:10.1145/1982185

Conference Chairs:
William Chu
Tunghai University, TaiChung, Taiwan
,
W. Eric Wong
University of Texas at Dallas, Richardson, Texas
,
Program Chairs:
Mathew J. Palakal
Indiana University Purdue University, Indianapolis
,
Chih-Cheng Hung
Southern Polytechnic State University, Marietta

Copyright © 2011 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

SIGAPP: ACM Special Interest Group on Applied Computing

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 21 March 2011

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Funding Sources

Science and Technology Department of Zhejiang Province
National Natural Science Foundation of China
Natural Science Foundation of Zhejiang Province

Conference

SAC'11

Sponsor:

SIGAPP

SAC'11: The 2011 ACM Symposium on Applied Computing

March 21 - 24, 2011

TaiChung, Taiwan

Acceptance Rates

Overall Acceptance Rate 1,650 of 6,669 submissions, 25%

Upcoming Conference

SAC '25

Sponsor:
sigapp

The 40th ACM/SIGAPP Symposium on Applied Computing

March 31 - April 4, 2025

Catania , Italy

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
260
Total Downloads

Downloads (Last 12 months)2
Downloads (Last 6 weeks)0

Reflects downloads up to 23 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Shi YHuang SZheng CJi H(2019)A Hybrid Aggregate Index Method for Trajectory DataMathematical Problems in Engineering10.1155/2019/17848642019:1Online publication date: 18-Aug-2019
https://doi.org/10.1155/2019/1784864
Shi YHuang SFeng JLu J(2019)A Probabilistic Range Query of Moving Objects in Road NetworkIEEE Access10.1109/ACCESS.2019.29071087(40165-40174)Online publication date: 2019
https://doi.org/10.1109/ACCESS.2019.2907108
Chen LTang YLv MChen G(2015)Partition-based range query for uncertain trajectories in road networksGeoinformatica10.1007/s10707-014-0206-619:1(61-84)Online publication date: 1-Jan-2015
https://dl.acm.org/doi/10.1007/s10707-014-0206-6

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.

Media

Figures

Other

Tables

View Table of Contents