research-article

Free access

Continuous probabilistic nearest-neighbor queries for uncertain trajectories

Authors:

Goce Trajcevski,

Roberto Tamassia,

Peter Scheuermann,

Isabel F. CruzAuthors Info & Claims

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

Pages 874 - 885

https://doi.org/10.1145/1516360.1516460

Published: 24 March 2009 Publication History

Abstract

This work addresses the problem of processing continuous nearest neighbor (NN) queries for moving objects trajectories when the exact position of a given object at a particular time instant is not known, but is bounded by an uncertainty region. As has already been observed in the literature, the answers to continuous NN-queries in spatio-temporal settings are time parameterized in the sense that the objects in the answer vary over time. Incorporating uncertainty in the model yields additional attributes that affect the semantics of the answer to this type of queries. In this work, we formalize the impact of uncertainty on the answers to the continuous probabilistic NN-queries, provide a compact structure for their representation and efficient algorithms for constructing that structure. We also identify syntactic constructs for several qualitative variants of continuous probabilistic NN-queries for uncertain trajectories and present efficient algorithms for their processing.

References

[1]

F. Aurenhammer. Voronoi diagrams---a survey of a fundamental geometric data structure. ACM Comput. Surv., 23(3), 1991.

Digital Library

[2]

R. Benetis, C. Jensen, G. Karciauskas, and S. Saltenis. Nearest and reverse nearest neighbor queries for moving objects. VLDB Journal, 15(3):229--249, 2006.

Digital Library

[3]

H. Cao, O. Wolfson, and G. Trajcevski. Spatio-temporal data reduction with deterministic error bounds. VLDB Journal, 15(3), 2006.

Digital Library

[4]

R. Cheng, J. Chen, M. F. Mokbel, and C.-Y. Chow. Probabilistic verifiers: Evaluating constrained nearest-neighbor queries over uncertain data. In ICDE, 2008.

Digital Library

[5]

R. Cheng, D. Kalashnikov, and S. Prabhakar. Querying imprecise data in moving objects environments. IEEE Transactions on Knowledge and Data Engineering, 16(9), 2003.

Digital Library

[6]

M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf. Computational Geometry: Algorithms and Applications. Springer, 2001.

Digital Library

[7]

B. V. Gnedenko. Course of Probability Theory. Nauka, 1988.

[8]

R. Güting and M. Schneider. Moving Objects Databases. Morgan Kaufmann, 2005.

[9]

M. Hadjieleftheriou, G. Kollios, V. J. Tsotras, and D. Gunopulos. Efficient indexing of spatiotemporal objects. In EDBT, 2002.

Digital Library

[10]

G. R. Hjaltason and H. Samet. Distance browsing in spatial databases. ACM Transactions on Database Systems, 24(2):265--318, 1999.

Digital Library

[11]

K. Hornsby and M. Egenhofer. Modeling moving objects over multiple granularities. Ann. Math. Artif. Intell., 36(1--2):177--194, 2002.

Digital Library

[12]

Y.-K. Huang, C.-C. Chen, and C. Lee. Continuous k-nearest neighbor query for moving objects with uncertain velocity. GeoInformatica, 2007. DOI 10.1007/s10707-007-0041-0.

Digital Library

[13]

G. Iwerks, H. Samet, and K. Smith. Maintenance of K-nn and spatial join queries on continuously moving points. ACM Transactions on Database Systems, 31(2), 2006.

Digital Library

[14]

M. Karavelas. Voronoi diagrams for moving disks and applications. In WADS, pages 62--74, 2001.

Digital Library

[15]

G. Kollios, D. Gunopulos, and V. Tsotras. Nearest neighbor queries in a mobile environment. In Spatio-Temporal Database Management, pages 119--134, 1999.

[16]

J. Lema, L. Forlizzi, R. Güting, E. Nardelli, and M. Schneider. Algorithms for moving objects databases. Computing Journal, 46(6), 2003.

[17]

J. S. Lim. Two-Dimensional Signal and Image Processing. Prentice Hall, 1990.

Digital Library

[18]

M. Mokbel, X. Xiong, and W. Aref. SINA: Scalable incremental processing of continuous queries in spatio-temporal databases. In ACM SIGMOD, 2004.

Digital Library

[19]

K. Mouratidis, M. Yiu, D. Papadias, and N. Mamoulis. Continuous nearest neighbor monitoring in road networks. In VLDB, pages 43--54, 2006.

Digital Library

[20]

P. Olofsson. Probability, Statistics and Stochastic Processes. Wiley-Interscience, 2005.

[21]

J. Pei, M. Hua, Y. Tao, and X. Lin. Query answering techniques on uncertain and probabilistic data: tutorial summary. In ACM SIGMOD, 2008.

Digital Library

[22]

D. Pfoser and C. Jensen. Capturing the uncertainty of moving objects representation. In SSD, 1999.

Digital Library

[23]

K. Raptopoulou, A. Papadopoulos, and Y. Manolopoulos. Fast nearest-neighbor query processing in moving-object databases. GeoInformatica, 7(2):113--137, 2003.

Digital Library

[24]

N. Roussopoulos, S. Kelley, and F. Vincent. Nearest neighbor queries. In ACM SIGMOD, pages 71--79, 1995.

Digital Library

[25]

H. Royden. Real Analysis. Macmillan Co., 1963.

[26]

J. Schiller and A. Voisard. Location-based Services. Morgan Kaufmann Publishers, 2004.

Digital Library

[27]

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

Digital Library

[28]

G. Shakharovich, T. Darrel, and P. Indyk, editors. Nearest-Neighbor Methods in Learning and Vision: Theory and Practice. MIT Press, 2006.

Digital Library

[29]

M. Sharir and P. K. Agarwal. Davenport-Schinzel Sequences and Their Geometric Applications. Cambridge University Press, 1995.

Digital Library

[30]

M. Soliman, I. Ilyas, and K.-C. Chang. Top-k query processing in uncertain databases. In ICDE, 2007.

[31]

D. Suciu and N. Dalvi. Foundations of probabilistic answers to queries. In ACM SIGMOD, 2005. Tutorial.

Digital Library

[32]

P.-N. Tan, M. Steinbach, and V. Kumar. Introduction to Data Mining. Addison-Wesley, 2005.

Digital Library

[33]

Y. Tao and D. Papadias. Spatial queries in dynamic environments. ACM Transactions on Database Systems, 28(2), 2003.

Digital Library

[34]

Y. Tao, D. Papadias, and Q. Shen. Continuous nearest neighbor search. In VLDB, 2002.

Digital Library

[35]

Y. Tao, X. Xiao, and R. Cheng. Range search on multidimensional uncertain data. ACM Transactions on Database Systems, 32(3), 2007.

Digital Library

[36]

G. Trajcevski, R. Tamassia, H. Ding, P. Scheuermann, and I. F. Cruz. Moving convolutions and continuous probabilistic nearest-neighbor queries for uncertain trajectories. Technical Report NWU-EECS-08-12, Northwestern University, Department of EECS, 2008. http://www.eecs.northwestern.edu/docs/techreports/.

[37]

G. Trajcevski, O. Wolfson, K. Hinrichs, and S. Chamberlain. Managing uncertainty in moving objects databases. ACM Transactions on Database Systems, 29(3), 2004.

Digital Library

[38]

O. Wolfson, A. P. Sistla, S. Chamberlain, and Y. Yesha. Updating and querying databases that track mobile units. Distributed and Parallel Databases, 7, 1999.

Digital Library

[39]

X. Xiong, M. Mokbel, and W. Aref. SEA-CNN: Scalable processing of continuous k-nearest neighbor queries in spatio-temporal databases. In ICDE, pages 643--654, 2005.

Digital Library

[40]

X. Yu, K. Pu, and N. Koudas. Monitoring k-nearest neighbor queries over moving objects. In ICDE, pages 631--642, 2005.

Digital Library

Cited By

Li HLu HJensen CTang BCheema M(2022)Spatial Data Quality in the Internet of Things: Management, Exploitation, and ProspectsACM Computing Surveys10.1145/349833855:3(1-41)Online publication date: 3-Feb-2022
https://dl.acm.org/doi/10.1145/3498338
Zufle ATrajcevski GPfoser DKim J(2020)Managing Uncertainty in Evolving Geo-Spatial Data2020 21st IEEE International Conference on Mobile Data Management (MDM)10.1109/MDM48529.2020.00021(5-8)Online publication date: Jun-2020
https://doi.org/10.1109/MDM48529.2020.00021
Bai LLi NSun CZhao Y(2019)Prediction of Uncertain Spatiotemporal Data Based on XML Integrated With Markov ChainEmerging Technologies and Applications in Data Processing and Management10.4018/978-1-5225-8446-9.ch008(154-183)Online publication date: 2019
https://doi.org/10.4018/978-1-5225-8446-9.ch008
Show More Cited By

Recommendations

Probabilistic Group Nearest Neighbor Queries in Uncertain Databases

The importance of query processing over uncertain data has recently arisen due to its wide usage in many real-world applications. In the context of uncertain databases, previous work have studied many query types such as nearest neighbor query, range ...
Probabilistic Reverse Nearest Neighbor Queries on Uncertain Data

Uncertain data are inherent in various important applications and reverse nearest neighbor (RNN) query is an important query type for many applications. While many different types of queries have been studied on uncertain data, there is no previous work ...
Probabilistic nearest neighbor queries on uncertain moving object trajectories

Nearest neighbor (NN) queries in trajectory databases have received significant attention in the past, due to their applications in spatio-temporal data analysis. More recent work has considered the realistic case where the trajectories are uncertain; ...

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

54
Total Citations
View Citations
534
Total Downloads

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

Reflects downloads up to 05 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

Li HLu HJensen CTang BCheema M(2022)Spatial Data Quality in the Internet of Things: Management, Exploitation, and ProspectsACM Computing Surveys10.1145/349833855:3(1-41)Online publication date: 3-Feb-2022
https://dl.acm.org/doi/10.1145/3498338
Zufle ATrajcevski GPfoser DKim J(2020)Managing Uncertainty in Evolving Geo-Spatial Data2020 21st IEEE International Conference on Mobile Data Management (MDM)10.1109/MDM48529.2020.00021(5-8)Online publication date: Jun-2020
https://doi.org/10.1109/MDM48529.2020.00021
Bai LLi NSun CZhao Y(2019)Prediction of Uncertain Spatiotemporal Data Based on XML Integrated With Markov ChainEmerging Technologies and Applications in Data Processing and Management10.4018/978-1-5225-8446-9.ch008(154-183)Online publication date: 2019
https://doi.org/10.4018/978-1-5225-8446-9.ch008
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
Ji XMi HYang FShao ZPan J(2018)Cost evaluation and improvement of TB-tree insertion algorithmJournal of Computational Methods in Sciences and Engineering10.3233/JCM-18080018:2(445-458)Online publication date: 3-May-2018
https://doi.org/10.3233/JCM-180800
Trajcevski GScheuermann P(2018)Targets and Shapes Tracking (Advanced Seminar)2018 19th IEEE International Conference on Mobile Data Management (MDM)10.1109/MDM.2018.00015(7-10)Online publication date: Jun-2018
https://doi.org/10.1109/MDM.2018.00015
Uddin RRice MRavishankar CTsotras V(2017)Assembly QueriesProceedings of the 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems10.1145/3139958.3139993(1-10)Online publication date: 7-Nov-2017
https://dl.acm.org/doi/10.1145/3139958.3139993
Zufle ATrajcevski GPfoser DRenz MRice MLeslie TDelamater PEmrich T(2017)Handling Uncertainty in Geo-Spatial Data2017 IEEE 33rd International Conference on Data Engineering (ICDE)10.1109/ICDE.2017.212(1467-1470)Online publication date: Apr-2017
https://doi.org/10.1109/ICDE.2017.212
Züfle A(2016)Bayesian network movement modelSIGSPATIAL Special10.1145/3024087.30240908:2(18-25)Online publication date: 9-Dec-2016
https://dl.acm.org/doi/10.1145/3024087.3024090
Kanza Y(2016)Uncertainty in geosocial dataSIGSPATIAL Special10.1145/3024087.30240888:2(3-10)Online publication date: 9-Dec-2016
https://dl.acm.org/doi/10.1145/3024087.3024088
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