Probabilistic Nearest Neighbor Queries on Uncertain Moving Object Trajectories

Summary: Probabilistic NN queries on uncertain moving objects modeled as Markov chains; studies three semantics over a query and a time window. Proposes Bayesian-sampling to generate observation-consistent samples for Monte-Carlo; provides runtime analysis and experiments. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 11087
Venue: VLDB
Year: 2014
Pagerank: 5.2704151e-05
Overall Rank: 9,431 | 35.30%
DOI: 10.14778/2732232.2732239

Incoming Non-self Citations Over Time

Authors

1. Johannes Niedermayer (Ludwig Maximilian University of Munich)
2. Andreas Züfle (Ludwig Maximilian University of Munich)
3. Tobias Emrich (Ludwig Maximilian University of Munich)
4. Matthias Renz (Ludwig Maximilian University of Munich)
5. Nikos Mamoulis (University of Hong Kong)
6. Lei Chen (Hong Kong University of Science and Technology)
7. Hans-Peter Kriegel (Ludwig Maximilian University of Munich)

BibTeX Citation

@article{niedermayer_vldb14,
        title = {{Probabilistic Nearest Neighbor Queries on Uncertain Moving Object Trajectories}},
        author = {Niedermayer, Johannes and Züfle, Andreas and Emrich, Tobias and Renz, Matthias and Mamoulis, Nikos and Chen, Lei and Kriegel, Hans-Peter},
        journal = {PVLDB},
        series = {{VLDB} '14},
        volume = {7},
        number = {3},
        pages = {205--216},
        doi = {10.14778/2732232.2732239},
        url = {https://doi.org/10.14778/2732232.2732239},
        year = {2014}
}

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
10,054	An Extendable Framework for Managing Uncertain Spatio-Temporal Data	2014	SIGMOD	5.1685424e-05
11,850	Top-k Queries over Digital Traces	2019	SIGMOD	5.093636e-05
12,104	Supporting Data Uncertainty in Array Databases	2015	SIGMOD	5.093636e-05

Outgoing Citations (Sorted by Pagerank)

Showing 7 of 7 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank	Cited Paper	Year	Venue	Pagerank
4	The R*-tree: An Efficient and Robust Access Method for Points and Rectangles	1990	SIGMOD	0.001157935
27	Fast Algorithms for Mining Association Rules	1994	VLDB	0.00052255472
238	MCDB: A Monte Carlo Approach to Managing Uncertain Data	2008	SIGMOD	0.0002369322
1,281	Continuous Nearest Neighbor Search	2002	VLDB	0.00011349245
3,050	Event Queries on Correlated Probabilistic Streams	2008	SIGMOD	7.8140428e-05
3,394	Prediction and Indexing of Moving Objects with Unknown Motion Patterns	2004	SIGMOD	7.4500025e-05
3,462	Continuous K-Nearest Neighbor Queries for Continuously Moving Points with Updates	2003	VLDB	7.3922569e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	9,581	A Generic Framework for Handling Uncertain Data with Local Correlations	2011	VLDB
2	3,462	Continuous K-Nearest Neighbor Queries for Continuously Moving Points with Updates	2003	VLDB
3	1,363	Ranking Queries on Uncertain Data: A Probabilistic Threshold Approach	2008	SIGMOD
4	1,049	k-Nearest Neighbors in Uncertain Graphs	2010	VLDB
5	359	Evaluating Probabilistic Queries over Imprecise Data	2003	SIGMOD
6	7,463	Effectively Indexing Uncertain Moving Objects for Predictive Queries	2009	VLDB
7	6,561	Efficient Probabilistic Reverse Nearest Neighbor Query Processing on Uncertain Data	2011	VLDB
8	7,025	Nearest Neighbor Searching Under Uncertainty II	2013	PODS
9	4,850	Nearest-Neighbor Searching Under Uncertainty	2012	PODS
10	1,605	Efficient Search for the Top-k Probable Nearest Neighbors in Uncertain Databases	2008	VLDB