A time efficient indexing scheme for complex spatiotemporal retrieval

Authors:
G. Lagogiannis;N. Lorentzos;S. Sioutas;E. Theodoridis
Affiliations:
Agricultural University of Athens, Athens, Greece;Agricultural University of Athens, Athens, Greece;Ionian University, Corfu, Greece;University of Patras, Greece
Venue:
ACM SIGMOD Record
Year:
2010

Citing 13
Cited 1

Making data structures persistent

Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
The R*-tree: an efficient and robust access method for points and rectangles

SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Fully persistent B+-trees

SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
Multidimensional access methods

ACM Computing Surveys (CSUR)
Time-evolving rule-based knowledge bases

Data & Knowledge Engineering
Comparison of access methods for time-evolving data

ACM Computing Surveys (CSUR)
A foundation for representing and querying moving objects

ACM Transactions on Database Systems (TODS)
An Efficient Multiversion Access Structure

IEEE Transactions on Knowledge and Data Engineering
Novel Approaches in Query Processing for Moving Object Trajectories

VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Specifications for Efficient Indexing in Spatiotemporal Databases

SSDBM '98 Proceedings of the 10th International Conference on Scientific and Statistical Database Management
An asymptotically optimal multiversion B-tree

The VLDB Journal — The International Journal on Very Large Data Bases
Complex spatio-temporal pattern queries

VLDB '05 Proceedings of the 31st international conference on Very large data bases
A new approach on indexing mobile objects on the plane

Data & Knowledge Engineering

Distance histogram computation based on spatiotemporal uniformity in scientific data

Proceedings of the 15th International Conference on Extending Database Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper is concerned with the time efficient processing of spatiotemporal predicates, i.e. spatial predicates associated with an exact temporal constraint. A set of such predicates forms a buffer query or a Spatio-temporal Pattern (STP) Query with time. In the more general case of an STP query, the temporal dimension is introduced via the relative order of the spatial predicates (STP queries with order). Therefore, the efficient processing of a spatiotemporal predicate is crucial for the efficient implementation of more complex queries of practical interest. We propose an extension of a known approach, suitable for processing spatial predicates, which has been used for the efficient manipulation of STP queries with order. The extended method is supported by efficient indexing structures. We also provide experimental results that show the efficiency of the technique.