Faster and Smaller Two-Level Index for Network-Based Trajectories

  title={Faster and Smaller Two-Level Index for Network-Based Trajectories},
  author={Rodrigo Alvarez-Icaza Rivera and M. Andrea Rodr{\'i}guez and Diego Seco},
Two-level indexes have been widely used to handle trajectories of moving objects that are constrained to a network. The top-level of these indexes handles the spatial dimension, whereas the bottom level handles the temporal dimension. The latter turns out to be an instance of the interval-intersection problem, but it has been tackled by non-specialized spatial indexes. In this work, we propose the use of a compact data structure on the bottom level of these indexes. Our experimental evaluation… 
1 Citations


Indexing in-network trajectory flows
This paper proposes T-PARINET, an access method to efficiently retrieve the trajectories of objects moving in networks, which significantly outperforms the reference R-tree-based access methods for in-network trajectory databases.
Indexing the Trajectories of Moving Objects in Networks*
A new index structure for moving objects on networks, the MON-Tree is proposed in terms of the basic algorithms for insertion and querying and shows good scalabiliy and outperforms the competing index structures in updating (index creation) as well as in querying.
Indexing Objects Moving on Fixed Networks
A new indexing technique, named Fixed Network R-Tree (FNR-Tree), is proposed for objects constrained to move on fixed networks in 2-dimensional space, and it is shown that the F NR-Tree outperforms the traditional R- tree in most cases.
Efficient Compression and Indexing of Trajectories
We present a new compressed representation of free trajectories of moving objects. It combines a partial-sums-based structure that retrieves in constant time the position of the object at any
Network-Matched Trajectory-Based Moving-Object Database: Models and Applications
Empirical studies with large real trajectory data set offer insight into the design properties of the proposed NMT MOD and suggest that the NMTMOD significantly outperforms other mobile-map free-moving-object database models in terms of precision of both location tracking and network-based traffic flow analysis.
A Framework for Generating Network-Based Moving Objects
In this paper, the most important properties of network-based moving objects are presented and discussed and a framework is proposed where the user can control the behavior of the generator by re-defining the functionality of selected object classes.
GraCT: A Grammar Based Compressed Representation of Trajectories
3DGraCT improves space requirements of traditional spatio-temporal data structures by two orders of magnitude, being competitive for the considered types of queries, even leading the comparison for a particular one.
CiNCT: Compression and Retrieval for Massive Vehicular Trajectories via Relative Movement Labeling
This paper presents a compressed data structure for moving object trajectories in a road network, which are represented as sequences of road edges based on FM-index, a fast and compact dataructure for pattern matching.
Path-based queries on trajectory data
An extensive performance study of NETTRA using a very large real-world trajectory data set, consisting of 1.7 million trajectories and a road network with 1.3 million edges, shows a speed-up of two orders of magnitude compared to state-of-the-art trajectory indexes.
Compact Trip Representation over Networks
A new Compact Trip Representation that allows us to manage users’ trips (moving objects) over networks and can solve relevant spatial and spatio-temporal queries over large sets of trajectories is presented.