Skip to main content
SpringerLink
Log in

Indexing valid time intervals

  • Conference paper
  • First Online:
Database and Expert Systems Applications (DEXA 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1460))

Included in the following conference series:

Abstract

To support temporal operators and to increase the efficiency of temporal queries, indexing based on temporal attributes is required. We consider the problem of indexing the temporal dimension in valid time databases where the temporal information of data objects are represented as valid time intervals that need to be managed dynamically by an efficient index structure. We propose an indexing scheme that uses augmented B+trees called Interval B+trees for indexing a dynamic set of valid time intervals. We apply time-splits at the leaf level of the IB+tree that would partition long valid time intervals into disjoint subintervals and distribute them among several leaf nodes to increase efficiency of search operation, especially for timeslice queries. We compared IB+trees with time-splits to one dimensional R-trees and observed that while their performances for timeslice queries are comparable, IB+trees are far more superior for many temporal queries that are based on beginning points of time intervals.

This work has been partially supported by NSF grants IRI 92-24660, IRI 96-31214, and the NSF FAW Award IRI-90-24152.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J.F. Allen, P.J. Hayes, “A Common-sense Theory of Time”, Proceedings of the International Joint Conference on Artificial Intelligence, August 1985.

    Google Scholar 

  2. T. Bozkaya, “Index Structures for Temporal and Multimedia Databases”, PHD Thesis, CES Dept., Case Western Reserve University, Cleveland, Ohio, May 1998.

    Google Scholar 

  3. B. Becker, S. Gschwind, T. Ohler, B. Seeger, P. Widmayer, “On Optimal Multiversion Access Structures”, Proceedings of Symposium on Large Spatial Databases, in LNCS, Vol 692, pages 123–141, Singapore 1993.

    Google Scholar 

  4. T. Bozkaya, M.Ozsoyoglu, “Indexing Transaction Time Databases”, to appear in Information Sciences.

    Google Scholar 

  5. T. H. Cormen, C. E. Leiserson, R.L. Rivest “Introduction to Algorithms”, MCGraw-Hill 1992.

    Google Scholar 

  6. R. Elmasri, G.T.J. Wuu, Y. Kim, “The Time-Index: An Access Structure for Temporal Data”, Proc. VLDB'90, pages 1–12, August 1990.

    Google Scholar 

  7. R. Elmasri, G. T. J. Wuu, V. Kouramajiam, “The Time-Index and The Monotonic B+tree”, In [T93], chapter 18.

    Google Scholar 

  8. C.H. Goh, H. Lu, B.C. Ooi, K-L. Tan, “Indexing Temporal Data Using Existing B+-Trees”, Data and Knowledge Engineering, vol 18, no 2, pages 147–165, March 1996.

    Article  MATH  Google Scholar 

  9. A. Guttman, “R-trees: A Dynamic Index Structure for Spatial Searching”, Proc. ACM SIGMOD'84, pages 47–57, May 1984.

    Google Scholar 

  10. A. Kumar, V.J. Tsotras, C. Faloutsos, “Access Methods for Bi-Temporal Databases”, Proc. International Workshop on Temporal Databases, Zurich, Switzerland, pages 235–254, 17–18 September 1995.

    Google Scholar 

  11. C. Kolovson, M. Stonebraker, “Segment Indexes: Dynamic Indexing Techniques for Multi-dimensional Interval Data”, Proc. ACM SIGMOD, pages 138–147, May 1991.

    Google Scholar 

  12. D.B. Lomet, B. Salzberg, “The Performance of a Multiversion Access Method”, Proc. ACM SIGMOD'90, pages 353–363, June 1990.

    Google Scholar 

  13. E.M. McCreight, “Priority Search Trees”, SIAM Journal on Computing, pages 257–277, 1985.

    Google Scholar 

  14. M.A. Nascimento and M.H. Dunham, “Indexing Valid Time Databases Via B+-Trees — The MAP21 Approach”, Technical Report 97-CSE-08, Southern Methodist University.

    Google Scholar 

  15. F.P. Preparata, M.I. Shamos, “Computational Geometry, An Introduction”, Springer-Verlag, 1985.

    Google Scholar 

  16. S. Ramaswamy, “Efficient Indexing for Constraint and Temporal Databases”, Proc. ICDT'97, January 1997.

    Google Scholar 

  17. A. Segev, H. Gunadhi, “Efficient Indexing Method for Temporal Relations”, IEEE Transactions on Knowledge and Data Engineering,5(3), pages 496–509, 1993.

    Article  Google Scholar 

  18. H. Shen, B. C. Ooi, H. Lu, “ The TP-Index: A Dynamic and Efficient Indexing Mechanism for Temporal Databases”, Proc. IEEE DE, pages 274–281, 1994.

    Google Scholar 

  19. B. Salzberg, V.J.Tsotras, “A Comparison of Access Methods for Time Evolving Data”, To appear in ACM Computing Surveys.

    Google Scholar 

  20. A. U. Tansel et. al. “Temporal Databases, Theory, Design and Implementation”, Benjamin/Cummings (1993).

    Google Scholar 

  21. V. J. Tsotras, N. Kangelaris, “The Snapshot Index: An I/O Optimal Access Method For Timeslice Queries”, Information Systems, 20(3), pages 237–260, 1995.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Engineering and Science Department, Case Western Reserve University, USA

    Tolga Bozkaya & Meral Ozsoyoglu

Authors
  1. Tolga Bozkaya
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Meral Ozsoyoglu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Gerald Quirchmayr Erich Schweighofer Trevor J.M. Bench-Capon

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bozkaya, T., Ozsoyoglu, M. (1998). Indexing valid time intervals. In: Quirchmayr, G., Schweighofer, E., Bench-Capon, T.J. (eds) Database and Expert Systems Applications. DEXA 1998. Lecture Notes in Computer Science, vol 1460. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0054512

Download citation

  • DOI: https://doi.org/10.1007/BFb0054512

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64950-2

  • Online ISBN: 978-3-540-68060-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation