Techniques for indexing and querying temporal observations for a collection of objects

Authors:
Qingmin Shi;Joseph JaJa
Affiliations:
Institute of Advanced Computer Studies, University of Maryland, College Park, MD;Institute of Advanced Computer Studies, University of Maryland, College Park, MD
Venue:
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Year:
2004

Citing 17
Cited 0

Introduction to algorithms

Introduction to algorithms
Overlapping B+trees for temporal data

JCIT Proceedings of the fifth Jerusalem conference on Information technology
Fully persistent B+-trees

SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
Further results on generalized intersection searching problems: counting, reporting, and dynamization

Journal of Algorithms
Overlapping linear quadtrees: a spatio-temporal access method

Proceedings of the 6th ACM international symposium on Advances in geographic information systems
Algorithms for three-dimensional dominance searching in linear space

Information Processing Letters
On indexing mobile objects

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)
Towards historical R-trees

SAC '98 Proceedings of the 1998 ACM symposium on Applied Computing
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
A unifying look at data structures

Communications of the ACM
Wireless sensor networks for habitat monitoring

WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Novel Approaches in Query Processing for Moving Object Trajectories

VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Range Searching in Categorical Data: Colored Range Searching on Grid

ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Optimal dynamic interval management in external memory

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Efficient Historical R-Trees

SSDBM '01 Proceedings of the 13th International Conference on Scientific and Statistical Database Management

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of dynamically indexing temporal observations about a collection of objects, each observation consisting of a key identifying the object, a list of attribute values and a timestamp indicating the time at which these values were recorded We make no assumptions about the rates at which these observations are collected, nor do we assume that the various objects have about the same number of observations We develop indexing structures that are almost linear in the total number of observations available at any given time instance, and that support dynamic additions of new observations in polylogarithmic time Moreover, these structures allow the quick handling of queries to identify objects whose attribute values fall within a certain range at every time instance of a specified time interval Provably good bounds are established.