Fast Algorithms for a Class of Temporal Range Queries

  • Qingmin Shi
  • Joseph JaJa
Conference paper

DOI: 10.1007/978-3-540-45078-8_9

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2748)
Cite this paper as:
Shi Q., JaJa J. (2003) Fast Algorithms for a Class of Temporal Range Queries. In: Dehne F., Sack JR., Smid M. (eds) Algorithms and Data Structures. WADS 2003. Lecture Notes in Computer Science, vol 2748. Springer, Berlin, Heidelberg

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 efficient indexing structures such that the following type of queries can be handled efficiently: given d value ranges and a time interval, report or count all the objects whose attributes fall within the corresponding d value ranges at each time instance lying in the specified time interval. 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 output size. We also show that the most general problem can be solved with polylogarithmic query time using nonlinear space data structures.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Qingmin Shi
    • 1
  • Joseph JaJa
    • 1
  1. 1.Institute for Advanced Computer Studies, Department of Electrical and Computer EngineeringUniversity of MarylandCollege ParkUSA

Personalised recommendations