A new framework for addressing temporal range queries and some preliminary results

  • Authors:

  • Qingmin Shi;Joseph JaJa

  • Affiliations:

  • Department of Electrical and Computer Engineering, Institute for Advanced Computer Studies, University of Maryland, College Park, MD;Department of Electrical and Computer Engineering, Institute for Advanced Computer Studies, University of Maryland, College Park, MD

  • Venue:
  • Theoretical Computer Science
  • Year:
  • 2005

Quantified Score

Hi-index 5.23

Visualization

Abstract

Given a set of n objects, each characterized by d attributes specified at m fixed time instances, we are interested in the problem of designing space efficient indexing structures such that a class of temporal range search queries can be handled efficiently. When m = 1, our problem reduces to the d-dimensional orthogonal search problem. We establish efficient data structures to handle several classes of the general problem. Our results include a linear size data structure that enables a query time of O(log n log m + f) for one-sided queries when d = 1, where f is the number of objects satisfying the query. A similar result is shown for counting queries. We also show that the most general problem can be solved with a polylogarithmic query time using superlinear space data structures.