Filters








791 Hits in 3.2 sec

Continuous probabilistic nearest-neighbor queries for uncertain trajectories

Goce Trajcevski, Roberto Tamassia, Hui Ding, Peter Scheuermann, Isabel F. Cruz
2009 Proceedings of the 12th International Conference on Extending Database Technology Advances in Database Technology - EDBT '09  
We also identify syntactic constructs for several qualitative variants of continuous probabilistic NN-queries for uncertain trajectories and present efficient algorithms for their processing.  ...  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  ...  The authors wish to thank Abraham Haddad, Ajit Tamhane, and the anonymous reviewers for their constructive comments.  ... 
doi:10.1145/1516360.1516460 dblp:conf/edbt/TrajcevskiTDSC09 fatcat:zx2syesewfgjnmm24jxdhh4j4m

Reverse-Nearest Neighbor Queries on Uncertain Moving Object Trajectories [chapter]

Tobias Emrich, Hans-Peter Kriegel, Nikos Mamoulis, Johannes Niedermayer, Matthias Renz, Andreas Züfle
2014 Lecture Notes in Computer Science  
A reverse nearest neighbor (RNN) query finds the objects having a given query object as its nearest neighbor. RNN queries find applications in data mining, marketing analysis, and decision making.  ...  In this paper, we study RNN queries in databases of uncertain trajectories.  ...  Probabilistic Reverse Nearest Neighbor Queries In the following we define two types of probabilistic time-parameterized RNN queries.  ... 
doi:10.1007/978-3-319-05813-9_7 fatcat:a64mzwybszh2doeaodiebuvxga

FP-CPNNQ: A Filter-Based Protocol for Continuous Probabilistic Nearest Neighbor Query [chapter]

Yinuo Zhang, Anand Panangadan, Viktor K. Prasanna
2015 Lecture Notes in Computer Science  
We propose an efficient probabilistic filter-based protocol for answering continuous nearest neighbor queries over uncertain sensor data.  ...  However, these distributed sensors usually have limited computational and communication power and thus the amount of sensor queries should be reduced to conserve system resources.  ...  Reynold Cheng (University of Hong Kong) for providing support in the early stage of this research.  ... 
doi:10.1007/978-3-319-18123-3_4 fatcat:nuuzdfsty5gpppy44dtdjci6wm

Special issue on data management for mobile services

Ralf Hartmut Güting, Nikos Mamoulis
2011 The VLDB journal  
The complex form of trajectory data obtained from objects (typically moving in road networks) calls for specialized methods for indexing, in order to meet the demands of online query evaluation.  ...  This special issue focuses on managing information about moving objects in space and time, both for online applications and for analysis of 'historical' trajectory data.  ...  The paper Ranking Continuous Nearest Neighbors for Uncertain Trajectories, by Goce Trajcevski, Roberto Tamassia, Isabel F.  ... 
doi:10.1007/s00778-011-0250-x fatcat:syidvlat35h3vliureceixmivy

Probabilistic Nearest Neighbor Queries on Uncertain Moving Object Trajectories [article]

Johannes Niedermayer, Andreas Züfle, Tobias Emrich, Matthias Renz, Nikos Mamoulis, Lei Chen, Hans-Peter Kriegel
2014 arXiv   pre-print
In this paper, we fill this gap by addressing probabilistic nearest neighbor queries in databases with uncertain trajectories modeled by stochastic processes, specifically the Markov chain model.  ...  We study three nearest neighbor query semantics that take as input a query state or trajectory q and a time interval. For some queries, we show that no polynomial time solution can be found.  ...  In addition to the ∃ and ∀ semantics for probabilistic nearest neighbor queries we now introduce a continuous query type which intuitively extends the spatio-temporal continuous nearest-neighbor query  ... 
arXiv:1305.3407v2 fatcat:4cfcj35lg5gr7fmixleh7vbmhe

Probabilistic nearest neighbor queries on uncertain moving object trajectories

Johannes Niedermayer, Andreas Züfle, Tobias Emrich, Matthias Renz, Nikos Mamoulis, Lei Chen, Hans-Peter Kriegel
2013 Proceedings of the VLDB Endowment  
In this paper, we fill this gap by addressing probabilistic nearest neighbor queries in databases with uncertain trajectories modeled by stochastic processes, specifically the Markov chain model.  ...  More recent work has considered the realistic case where the trajectories are uncertain; however, only simple uncertainty models have been proposed, which do not allow for accurate probabilistic search  ...  In addition to these semantics for probabilistic nearest neighbor queries we now introduce a continuous query type which intuitively extends the spatio-temporal continuous nearestneighbor query [21, 8  ... 
doi:10.14778/2732232.2732239 fatcat:bc2l5tyivnavroypwogsoubezq

Probabilistic Voronoi Diagrams for Probabilistic Moving Nearest Neighbor Queries [article]

Mohammed Eunus Ali, Egemen Tanin, Rui Zhang, Ramamohanarao Kotagiri
2011 arXiv   pre-print
In this paper, we propose the probabilistic Voronoi diagram (PVD) for processing moving nearest neighbor queries on uncertain data, namely the probabilistic moving nearest neighbor (PMNN) queries.  ...  A PMNN query finds the most probable nearest neighbor of a moving query point continuously.  ...  A nearest neighbor (NN) query on an uncertain database, called a Probabilistic Nearest Neighbor (PNN) query, returns a set of objects, where each object has a non-zero probability of being the nearest  ... 
arXiv:1106.5979v1 fatcat:ly65cxgtibe3hpqgtkfg2tpjfu

Managing uncertain spatio-temporal data

Thomas Bernecker, Tobias Emrich, Hans-Peter Kriegel, Andreas Zuefle, Lei Chen, Xiang Lian, Nikos Mamoulis
2011 Proceedings of the 2nd ACM SIGSPATIAL International Workshop on Querying and Mining Uncertain Spatio-Temporal Data - QUeST '11  
This paper is the first work to propose general models for spatiotemporal uncertain data that have the potential to allow efficient processing on a wide range of queries.  ...  In addition, we give examples of interesting spatiotemporal queries on uncertain data.  ...  The objective is to identify the nearest neighbors of an uncertain query trajectory, throughout its lifetime; i.e., to partition the lifetime into intervals, each containing a stable most probable nearest  ... 
doi:10.1145/2064969.2064972 dblp:conf/gis/BerneckerEKZ0LM11 fatcat:4onurqwx6ff2vkpjryjwjobgna

Probabilistic Spatial Queries on Existentially Uncertain Data [chapter]

Xiangyuan Dai, Man Lung Yiu, Nikos Mamoulis, Yufei Tao, Michail Vaitis
2005 Lecture Notes in Computer Science  
We propose adaptations of spatial access methods and search algorithms for probabilistic versions of range queries and nearest neighbors and conduct an extensive experimental study, which evaluates the  ...  Accordingly, a ranking probabilistic spatial query selects the objects with the highest probabilities to qualify the spatial predicates.  ...  Probabilistic nearest neighbor search for locationally uncertain data has been studied in [5] .  ... 
doi:10.1007/11535331_23 fatcat:ymxtnq55uzdhzoqhnjqeswnaka

Ranking continuous nearest neighbors for uncertain trajectories

Goce Trajcevski, Roberto Tamassia, Isabel F. Cruz, Peter Scheuermann, David Hartglass, Christopher Zamierowski
2011 The VLDB journal  
This article addresses the problem of performing Nearest Neighbor (NN) queries on uncertain trajectories.  ...  The answer to an NN query for certain trajectories is time parameterized due to the continuous nature of the motion.  ...  Acknowledgments We thank the anonymous reviewers for their constructive suggestions, Abraham Haddad and Ajit Tamhane for their useful comments, and Hui Ding for helping with the experiments presented in  ... 
doi:10.1007/s00778-011-0249-3 fatcat:rhy7cczl6fgh7ftjclp5jczchi

Dynamic Nearest Neighbor Queries in Euclidean Space [chapter]

Sarana Nutanong, Mohammed Eunus Ali, Egemen Tanin, Kyriakos Mouratidis
2017 Encyclopedia of GIS  
Synonyms Nearest neighbor monitoring; Temporal nearest neighbor query Definition Given a query point q and a set D of data points, a nearest neighbor (NN) query returns the data point p in D that minimizes  ...  One important variant of this query type is kNN query, which returns k data  ...  Cross-References Nearest Neighbor Query Queries in Spatio-temporal Databases, Time Parameterized Neighbor Queries in Euclidean Space, Fig. 1 Continuous k-nearest neighbor query with a moving query point  ... 
doi:10.1007/978-3-319-17885-1_1558 fatcat:425f2o25ynhwno5renou66xpci

Dynamic Nearest Neighbor Queries in Euclidean Space [chapter]

Sarana Nutanong, Mohammed Eunus Ali, Egemen Tanin, Kyriakos Mouratidis
2015 Encyclopedia of GIS  
Synonyms Nearest neighbor monitoring; Temporal nearest neighbor query Definition Given a query point q and a set D of data points, a nearest neighbor (NN) query returns the data point p in D that minimizes  ...  One important variant of this query type is kNN query, which returns k data  ...  Cross-References Nearest Neighbor Query Queries in Spatio-temporal Databases, Time Parameterized Neighbor Queries in Euclidean Space, Fig. 1 Continuous k-nearest neighbor query with a moving query point  ... 
doi:10.1007/978-3-319-23519-6_1558-1 fatcat:djuqr3v7k5g2jjvbd3xailxn2i

Probabilistic Voronoi diagrams for probabilistic moving nearest neighbor queries

Mohammed Eunus Ali, Egemen Tanin, Rui Zhang, Ramamohanarao Kotagiri
2012 Data & Knowledge Engineering  
In this paper, we propose the probabilistic Voronoi diagram (PVD) for processing moving nearest neighbor queries on uncertain data, namely the probabilistic moving nearest neighbor (PMNN) queries.  ...  A PMNN query finds the most probable nearest neighbor of a moving query point continuously.  ...  A nearest neighbor (NN) query on an uncertain database, called a Probabilistic Nearest Neighbor (PNN) query, returns a set of objects, where each object has a non-zero probability of being the nearest  ... 
doi:10.1016/j.datak.2012.02.001 fatcat:a54f2zyt2ngmnlf2fpu7kwjsgq

Uncertain Spatial Data Management:An Overview [article]

Andreas Zuefle
2020 arXiv   pre-print
The main scope of this chapter is to survey existing techniques for managing, querying, and mining uncertain spatial data.  ...  Examples and use-cases of querying uncertain spatial data are provided using the example of uncertain range queries.  ...  To answer such queries, we first need a crisp definition of what it means for an uncertain object to be a (probabilistic) nearest neighbor of a query object and how the probability of such an event is  ... 
arXiv:2009.01121v1 fatcat:kl6b57d7sbaqxce23wlrak6tc4

Predictive spatio-temporal queries

Abdeltawab M. Hendawi, Mohamed F. Mokbel
2012 Proceedings of the First ACM SIGSPATIAL International Workshop on Mobile Geographic Information Systems - MobiGIS '12  
In the last few years, one of the most exciting work on spatio-temporal data management is about predictive queries.  ...  The goal of this paper is to catch the interesting areas and future work under the umbrella of predictive queries over spatio-temporal data.  ...  For example, in a recent work [65] , a new concept based on u-bisector is used to evaluate two types of KNN queries, namely, Possible Nearest Neighbor Query (PNNQ) and Trajectory Possible Nearest Neighbor  ... 
doi:10.1145/2442810.2442828 dblp:conf/gis/HendawiM12a fatcat:jstmvcb44fhgtmkqawmdwq4jfu
« Previous Showing results 1 — 15 out of 791 results