Nearest neighbor search on moving object trajectories

Authors:
Elias Frentzos;Kostas Gratsias;Nikos Pelekis;Yannis Theodoridis
Affiliations:
Department of Informatics, University of Piraeus, Piraeus, Greece;Department of Informatics, University of Piraeus, Piraeus, Greece;Department of Informatics, University of Piraeus, Piraeus, Greece;Department of Informatics, University of Piraeus, Piraeus, Greece
Venue:
SSTD'05 Proceedings of the 9th international conference on Advances in Spatial and Temporal Databases
Year:
2005

Citing 15
Cited 20

Nearest neighbor queries

SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Enhanced nearest neighbour search on the R-tree

ACM SIGMOD Record
Distance browsing in spatial databases

ACM Transactions on Database Systems (TODS)
Indexing the positions of continuously moving objects

SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Time-parameterized queries in spatio-temporal databases

Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Novel Approaches in Query Processing for Moving Object Trajectories

VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Nearest Neighbor and Reverse Nearest Neighbor Queries for Moving Objects

IDEAS '02 Proceedings of the 2002 International Symposium on Database Engineering & Applications
On the Generation of Spatiotemporal Datasets

SSD '99 Proceedings of the 6th International Symposium on Advances in Spatial Databases
K-Nearest Neighbor Search for Moving Query Point

SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
A Road Network Embedding Technique for K-Nearest Neighbor Search in Moving Object Databases

Geoinformatica
Analysis of predictive spatio-temporal queries

ACM Transactions on Database Systems (TODS)
R-Trees: Theory and Applications (Advanced Information and Knowledge Processing)

R-Trees: Theory and Applications (Advanced Information and Knowledge Processing)
Continuous nearest neighbor search

VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Continuous K-nearest neighbor queries for continuously moving points with updates

VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Spatio-Temporal Indexing for Large Multimedia Applications

ICMCS '96 Proceedings of the 1996 International Conference on Multimedia Computing and Systems

Efficient k-nearest-neighbor search algorthims for historical moving object trajectories

Journal of Computer Science and Technology
Privacy Risks in Trajectory Data Publishing: Reconstructing Private Trajectories from Continuous Properties

KES '08 Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part II
Algorithms for constrained k-nearest neighbor queries over moving object trajectories

Geoinformatica
Efficient algorithms for historical continuous kNN query processing over moving object trajectories

APWeb/WAIM'07 Proceedings of the joint 9th Asia-Pacific web and 8th international conference on web-age information management conference on Advances in data and web management
Discovering private trajectories using background information

Data & Knowledge Engineering
Anonymization of moving objects databases by clustering and perturbation

Information Systems
Group visible nearest neighbor queries in spatial databases

WAIM'10 Proceedings of the 11th international conference on Web-age information management
History trajectory privacy-preserving through graph partition

Proceedings of the 1st international workshop on Mobile location-based service
Retrieving k-nearest neighboring trajectories by a set of point locations

SSTD'11 Proceedings of the 12th international conference on Advances in spatial and temporal databases
A rough set approach to spatio-temporal outlier detection

WILF'11 Proceedings of the 9th international conference on Fuzzy logic and applications
Motion-Alert: automatic anomaly detection in massive moving objects

ISI'06 Proceedings of the 4th IEEE international conference on Intelligence and Security Informatics
Moving objects in networks databases

EDBT'06 Proceedings of the 2006 international conference on Current Trends in Database Technology
BFPkNN: an efficient k-nearest-neighbor search algorithm for historical moving object trajectories

ADVIS'06 Proceedings of the 4th international conference on Advances in Information Systems
PPZTEM: An efficient approximate trajectory extraction method with error bound constraint for wireless sensor networks

Computer Communications
Spatio-temporal aggregations in trajectory data warehouses

DaWaK'07 Proceedings of the 9th international conference on Data Warehousing and Knowledge Discovery
iSampling: framework for developing sampling methods considering user's interest

Proceedings of the 21st ACM international conference on Information and knowledge management
A clustering-based approach for personalized privacy preserving publication of moving object trajectory data

NSS'12 Proceedings of the 6th international conference on Network and System Security
Calibrating trajectory data for similarity-based analysis

Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Model-driven matching and segmentation of trajectories

Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
A Hybrid Grid-based Method for Mining Arbitrary Regions-of-Interest from Trajectories

Proceedings of Workshop on Machine Learning for Sensory Data Analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

With the increasing number of Mobile Location Services (MLS), the need for effective k-NN query processing over historical trajectory data has become the vehicle for data analysis, thus improving existing or even proposing new services. In this paper, we investigate mechanisms to perform NN search on R-tree-like structures storing historical information about moving object trajectories. The proposed branch-and-bound algorithms vary with respect to the type of the query object (stationary or moving point) as well as the type of the query result (continuous or not). We also propose novel metrics to support our search ordering and pruning strategies. Using the implementation of the proposed algorithms on a member of the R-tree family for trajectory data (the TB-tree), we demonstrate their scalability and efficiency through an extensive experimental study using synthetic and real datasets.