research-article

Free access

Processing probabilistic spatio-temporal range queries over moving objects with uncertainty

Authors:

Bruce S. E. Chung,

Wang-Chien Lee,

Arbee L. P. ChenAuthors Info & Claims

EDBT '09: Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology

Pages 60 - 71

https://doi.org/10.1145/1516360.1516369

Published: 24 March 2009 Publication History

Abstract

Range queries for querying the current and future positions of the moving objects have received growing interests in the research community. Existing methods, however, assume that an object only moves along an anticipated path. In this paper, we study the problem of answering probabilistic range queries on moving objects based on an uncertainty model, which captures the possible movements of objects with probabilities. Evaluation of probabilistic queries is challenging due to large objects volume and costly computation. We map the uncertain movements of all objects to a dual space for indexing. By querying the index, we quickly eliminate unqualified objects and employ an approximate approach to examine the remaining candidates for final answer. We conduct a comprehensive performance study, which shows our proposal significantly reduces the number of object examinations and the overall cost of the query evaluation.

References

[1]

R. Cheng, D. V. Kalashnikov, and S. Prabhakar. Evaluating Probabilistic Queries over Imprecise Data. In Proceedings of the ACM SIGMOD International Conference on Management of Data, pp 551--562, 2003.

Digital Library

[2]

R. Cheng, D. V. Kalashnikov, and S. Prabhakar. Querying Imprecise Data in Moving Object Environments. In IEEE Transactions on Knowledge and Data Engineering, pp 1112--1127, 2004.

Digital Library

[3]

R. Cheng, Y. Xia, S. Prabhakar, R. Shah, and J. S. Vitter. Efficient Indexing Methods for Probabilistic Threshold Queries over Uncertain Data. In Proceedings of the 30th International Conference on Very Large Data Bases, pp 876--887, 2004.

Digital Library

[4]

W. Feller. An Introduction to Probability Theory and Its Applications 2nd edn. (Wiley), pp 340--391, 1957.

[5]

A. Guttman. R-Trees: A Dynamic Index Structure for Spatial Searching. In Proceedings of the ACM SIGMOD International Conference on Management of Data, pp 47--57, 1984.

Digital Library

[6]

V. Gaede, O. Günther. Multidimensional Access Methods. In ACM Computing Surveys, pp 170--231, 1998.

Digital Library

[7]

J. Goldstein, R. Ramakrishnan, U. Shaft, J. B. Yu. Processing Queries by Linear Constraints. In Proceedings of the 16th ACM PODS Symposium on Principles of Database Systems, pp 257--267, 1997.

Digital Library

[8]

P. V. C. Hough. Method and Means for Recognizing Complex Patterns, U. S. Patent No. 306964, 1962.

[9]

H. V. Jagadish. On Indexing Line Segments. In Proceedings of 16th International Conference on Very Large Data Bases, pp 614--625, 1990.

Digital Library

[10]

S. Karlin and H. M. Taylor. A First Course in Stochastic Processes 2nd edn. (Academic Press), pp. 340--391, 1975.

[11]

G. Kollios, D. Papadopoulos, D. Gunopulos, and J. Tsotras. Indexing Mobile Objects using Dual Transformations. In The International Journal on Very Large Data Bases, pp 238--256, 2005.

Digital Library

[12]

Z. Lei, C. U. Saraydar, and N. B. Mandayam. Paging Area Optimization based on Interval Estimation in Wireless Personal Communication Networks. In Mobile Networks and Applications, pp 85--99, 2000.

Digital Library

[13]

A. Papoulis. Probability, Random Variables and Stochastic Processes 3rd edn. (McGraw-Hill), 1991.

[14]

H. Packard. Normal and Inverse Normal Distribution for the HP-67. "http://www.hpmuseum.org/software/67pacs/67ndist.htm".

[15]

C. Rose. Minimizing the Average Cost of Paging and Registration: A Timer-based Method. In Wireless Networks, pp 109--116, 1996.

Digital Library

[16]

S. Saltenis, C. S. Jensen, S. T. Leutenegger, and M. A. Lopez. Indexing the Positions of Continuously Moving Objects. In Proceedings of the ACM SIGMOD International Conference on Management of Data, pp 331--342, 2000.

Digital Library

[17]

A. P. Sistla, O. Wolfson, S. Chamberlain, and S. Dao. Modeling and Querying Moving Objects. In Proceedings of the 13th International Conference on Data Engineering, pp 422--432, 1997.

Digital Library

[18]

Y. Tao, C. Faloutsos, D. Papadias, and B. Liu. Prediction and Indexing of Moving Objects with Unknown Motion Patterns. In Proceedings of the ACM SIGMOD International Conference on Management of Data, pp 611--622, 2004.

Digital Library

[19]

Y. Tao, D. Papadias, and J. Sun. The TPR*-Tree: An Optimized Spatio-Temporal Access Method for Predictive Queries. In Proceedings of 29th International Conference on Very Large Data Bases, pp 790--801, 2003.

Digital Library

[20]

Y. Tao, R. Cheng, X. Xiao, W. K. Ngai, B. Kao, and S. Prabhakar. Indexing Multi-Dimensional Uncertain Data with Arbitrary Probability Density. In Proceedings of the 31st international conference on Very large data bases, pp 922--933, 2005.

Digital Library

Cited By

Huang YLee C(2024)Efficient processing of all neighboring object group queries with budget range constraint in road networksComputing10.1007/s00607-024-01260-7106:5(1359-1393)Online publication date: 16-Feb-2024
https://doi.org/10.1007/s00607-024-01260-7
Chen FZhang PYu CLin HTang SHu X(2022)Path–Based Continuous Spatial Keyword QueriesComplexity10.1155/2022/40912452022(1-19)Online publication date: 10-Jun-2022
https://doi.org/10.1155/2022/4091245
Huang Y(2019)Distributed Processing of Location-Based Aggregate Queries Using MapReduceISPRS International Journal of Geo-Information10.3390/ijgi80903708:9(370)Online publication date: 23-Aug-2019
https://doi.org/10.3390/ijgi8090370
Show More Cited By

Recommendations

Efficient processing of probabilistic spatio-temporal range queries over moving objects
CIKM '08: Proceedings of the 17th ACM conference on Information and knowledge management

Range queries for querying the current and future positions of the moving objects have received growing interests in the research community. Existing methods, however, assume that an object only moves along an anticipated path. In this paper, we study ...
Probabilistic range queries in moving objects databases with uncertainty
MobiDe '03: Proceedings of the 3rd ACM international workshop on Data engineering for wireless and mobile access

This work addresses the issue of answering spatio-temporal range queries when there is uncertainty associated with the model of the moving objects. Uncertainty is inherent in Moving Objects Database (MOD) applications and capturing it in the data model ...
Efficient evaluation of continuous spatio-temporal queries on moving objects with uncertain velocity

Continuous Range (CR) query and Continuous K-Nearest Neighbor (CKNN) query are two important types of spatio-temporal queries. Given a time interval [t _s, t ...

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences

EDBT '09: Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology

March 2009

1180 pages

ISBN:9781605584225

DOI:10.1145/1516360

Editors:
Martin Kersten
CWI, The Netherlands
,
Boris Novikov
University of Saint Petersburg, Russia
,
Jens Teubner
ETH Zurich, Switzerland
,
Vladimir Polutin
HP Labs, Russia
,
Stefan Manegold
CWI, The Netherlands

Copyright © 2009 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]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 24 March 2009

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Research-article

Funding Sources

Conference

EDBT/ICDT '09

EDBT/ICDT '09: EDBT/ICDT '09 joint conference

March 24 - 26, 2009

Saint Petersburg, Russia

Acceptance Rates

Overall Acceptance Rate 7 of 10 submissions, 70%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

27
Total Citations
View Citations
442
Total Downloads

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

Reflects downloads up to 10 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Huang YLee C(2024)Efficient processing of all neighboring object group queries with budget range constraint in road networksComputing10.1007/s00607-024-01260-7106:5(1359-1393)Online publication date: 16-Feb-2024
https://doi.org/10.1007/s00607-024-01260-7
Chen FZhang PYu CLin HTang SHu X(2022)Path–Based Continuous Spatial Keyword QueriesComplexity10.1155/2022/40912452022(1-19)Online publication date: 10-Jun-2022
https://doi.org/10.1155/2022/4091245
Huang Y(2019)Distributed Processing of Location-Based Aggregate Queries Using MapReduceISPRS International Journal of Geo-Information10.3390/ijgi80903708:9(370)Online publication date: 23-Aug-2019
https://doi.org/10.3390/ijgi8090370
Huang YSu CLee CHo CDesai BHong J(2017)Efficient Evaluation of Shortest Average Distance Query on Heterogeneous Neighboring Objects in Road NetworksProceedings of the 21st International Database Engineering & Applications Symposium10.1145/3105831.3105848(209-218)Online publication date: 12-Jul-2017
https://dl.acm.org/doi/10.1145/3105831.3105848
Huang Y(2017)Location-Based Aggregate Queries for Heterogeneous Neighboring ObjectsIEEE Access10.1109/ACCESS.2017.26884725(4887-4899)Online publication date: 2017
https://doi.org/10.1109/ACCESS.2017.2688472
Parisi FGrant J(2017)On repairing and querying inconsistent probabilistic spatio-temporal databasesInternational Journal of Approximate Reasoning10.1016/j.ijar.2017.02.00384:C(41-74)Online publication date: 1-May-2017
https://dl.acm.org/doi/10.1016/j.ijar.2017.02.003
Huang Y(2017)Efficient processing of intelligent probabilistic collision detection queriesComputing10.1007/s00607-016-0516-799:4(383-404)Online publication date: 1-Apr-2017
https://dl.acm.org/doi/10.1007/s00607-016-0516-7
Wang ZYao BCheng RGao XZou LGuan HGuo M(2016)SMeGeoinformatica10.1007/s10707-015-0230-120:1(19-58)Online publication date: 1-Jan-2016
https://dl.acm.org/doi/10.1007/s10707-015-0230-1
Huang YKuo WLee CWang TDesai BToyama M(2015)Shortest Average-Distance Query on Heterogeneous Neighboring ObjectsProceedings of the 19th International Database Engineering & Applications Symposium10.1145/2790755.2790767(116-125)Online publication date: 13-Jul-2015
https://dl.acm.org/doi/10.1145/2790755.2790767
Zhi-Jie Wang Dong-Hua Wang Bin Yao Minyi Guo (2015)Probabilistic Range Query over Uncertain Moving Objects in Constrained Two-Dimensional SpaceIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2014.234540227:3(866-879)Online publication date: 1-Mar-2015
https://doi.org/10.1109/TKDE.2014.2345402
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

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

Media

Figures

Other

Tables

View Table of Contents