A new approach on indexing mobile objects on the plane

Authors:
S. Sioutas;K. Tsakalidis;K. Tsichlas;C. Makris;Y. Manolopoulos
Affiliations:
Department of Informatics, Ionian University, Corfu, Greece;Department of Computer Engineering and Informatics, University of Patras, Greece;Department of Informatics, Aristotle University of Thessaloniki, Greece;Department of Computer Engineering and Informatics, University of Patras, Greece;Department of Informatics, Aristotle University of Thessaloniki, Greece
Venue:
Data & Knowledge Engineering
Year:
2008

Citing 29
Cited 2

Filtering search: a new approach to query answering

SIAM Journal on Computing
A balanced search tree with O(1) worst case update time

Acta Informatica
Applications of random sampling in computational geometry, II

Discrete & Computational Geometry - Selected papers from the fourth ACM symposium on computational geometry, Univ. of Illinois, Urbana-Champaign, June 6 8, 1988
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
Reporting points in halfspaces

SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
B-trees with lazy parent split

Information Sciences—Informatics and Computer Science: An International Journal
A constant update time finger search tree

Information Processing Letters
Processing queries by linear constraints

PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Multidimensional access methods

ACM Computing Surveys (CSUR)
On indexing mobile objects

PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On two-dimensional indexability and optimal range search indexing

PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Comparison of access methods for time-evolving data

ACM Computing Surveys (CSUR)
Advanced database indexing

Advanced database indexing
Indexing moving points (extended abstract)

PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Indexing the positions of continuously moving objects

SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Ubiquitous B-Tree

ACM Computing Surveys (CSUR)
Efficient searching with linear constraints

Journal of Computer and System Sciences - Special issue on the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems
Indexing Mobile Objects on the Plane

DEXA '02 Proceedings of the 13th International Workshop on Database and Expert Systems Applications
Handbook of massive data sets

Handbook of massive data sets
Indexing of Moving Objects for Location-Based Services

ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Eliminating Amortization: On Data Structures with Guaranteed Response Time

Eliminating Amortization: On Data Structures with Guaranteed Response Time
STRIPES: an efficient index for predicted trajectories

SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
I/O-efficient dynamic planar point location

Computational Geometry: Theory and Applications
Efficient processing of past-future spatiotemporal queries

Proceedings of the 2006 ACM symposium on Applied computing
On past-time indexing of moving objects

Journal of Systems and Software
The TPR*-tree: an optimized spatio-temporal access method for predictive queries

VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
The power of geometric duality

SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
Dynamic half-space reporting, geometric optimization, and minimum spanning trees

SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
ISB-tree: a new indexing scheme with efficient expected behaviour

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation

A time efficient indexing scheme for complex spatiotemporal retrieval

ACM SIGMOD Record
Editorial: An efficient index buffer management scheme for implementing a B-tree on NAND flash memory

Data & Knowledge Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a set of time-efficient approaches to index objects moving on the plane to efficiently answer range queries about their future positions. Our algorithms are based on previously described solutions as well as on the employment of efficient access methods. Finally, an experimental evaluation is included that shows the performance, scalability and efficiency of our methods.