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

01/04/2019
by   Rodrigo Rivera, et al.
0

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 shows that our approach is both faster and smaller than existing solutions.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/10/2012

Modularity-Based Clustering for Network-Constrained Trajectories

We present a novel clustering approach for moving object trajectories th...
research
08/28/2020

Cache-Efficient Sweeping-Based Interval Joins for Extended Allen Relation Predicates (Extended Version)

We develop a family of efficient plane-sweeping interval join algorithms...
research
10/18/2018

Towards a compact representation of temporal rasters

Big research efforts have been devoted to efficiently manage spatio-temp...
research
11/10/2022

A new data structure for efficient search on isovists

Spatial data structures allow to make efficient queries on Geographical ...
research
12/26/2019

Efficient processing of raster and vector data

In this work, we propose a framework to store and manage spatial data, w...
research
02/27/2020

Semantrix: A Compressed Semantic Matrix

We present a compact data structure to represent both the duration and l...
research
08/12/2019

An Efficient Skyline Computation Framework

Skyline computation aims at looking for the set of tuples that are not w...

Please sign up or login with your details

Forgot password? Click here to reset