Scalable Algorithms for Nearest-Neighbor Joins on Big Trajectory Data

Abstract

International audienceTrajectory data are prevalent in systems that monitor the locations of moving objects. In a location-based service, for instance, the positions of vehicles are continuously monitored through GPS; the trajectory of each vehicle describes its movement history. We study joins on two sets of trajectories, generated by two sets M and R of moving objects. For each entity in M , a join returns its k nearest neighbors from R. We examine how this query can be evaluated in cloud environments. This problem is not trivial, due to the complexity of the trajectory, and the fact that both the spatial and temporal dimensions of the data have to be handled. To facilitate this operation, we propose a parallel solution framework based on MapReduce. We also develop a novel bounding technique, which enables trajectories to be pruned in parallel. Our approach can be used to parallelize existing single-machine trajectory join algorithms. We also study a variant of the join, which can further improve query efficiency. To evaluate the efficiency and the scalability of our solutions, we have performed extensive experiments on large real and synthetic datasets

Prospective Data Model and Distributed Query Processing for Mobile Sensing Data Streams

“…Considerable research efforts have been devoted to offline management and analysis of big trajectory data (multi-dimensional time series) [12,13,27,34]. These works are characterized by a complete storage of large historical data.…”

Feature Data Selection for Improving the Performance of Entity Similarity Searches in the Internet of Things

“…The similarity search refers to the technology of querying similar contents in a data set for a given sample. The similarity search has numerous uses, and has been studied extensively, such as for the content-based retrieval services for moving objects [8], the image similarity search [9], optimizes users' products and helps them to find potential consumers [10], web services for recommendations [11], and so on. With the development of network and sensor technologies, sensors have undergone rapid growth and are now collecting more complex multivariate data.…”

Precomputing Hybrid Index Architecture for Flexible Community Search over Location-Based Social Networks

“…There are considerable works conducted to study a spatio-social community search, as previously reviewed works assume non-spatial graphs [Sozio and Gionis, 2010, Cui et al, 2014, Huang et al, 2014, Li et al, 2015. A recent study named spatial-aware community (SAC) was undertaken by [Fang et al, 2016]. This study has adopted the concept of minimum degree using the k-core technique.…”