Skip to main content

Temporal Indexing with Multidimensional File Structures

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

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

Included in the following conference series:

  • 318 Accesses

Abstract

Multidimensional file structures designed for storing point data can be used to store spatial objects if the objects can be transformed into n-dimensional points. We adapt this transformation technique to design a flexible indexing technique for temporal databases. This approach can be used to support valid-time, transaction-time, and bitemporal indices. The evaluation of various kinds of temporal selections on such indices is discussed, and we present an experimental comparison with an indexing technique for valid-time databases.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. C.-H. Ang, K.-P. Tan: The Interval B-Tree, Information Processing Letters, 53(2), 1995, 85–89.

    Article  MATH  Google Scholar 

  2. N. Beckmann, H.-P. Kriegel, R. Schneider, B. Seeger: The R*-tree: An Efficient and Robust Access Method for Points and Rectangles, Proc. ACM SIGMOD Conf. 1990, 322–321.

    Google Scholar 

  3. L. Becker, A. Voigtmann, K. Hinrichs: Developing Applications with the Object-Oriented GISKernel GOODAC, in: M.J. Kraak, M. Molenaar (Eds.): Proc. SDH’ 96, Vol. I, 5A1–5A18.

    Google Scholar 

  4. L. Becker, K. Hinrichs, U. Finke: A New Algorithm for Computing Joins with Grid Files, Proc. ICDE 1993, 190–198.

    Google Scholar 

  5. S. Berchthold, D. Keim, H.-P. Kriegel: The X-Tree: An Index Structure fir High-Dimensional Data, Proc. VLDB 1996, 29–39.

    Google Scholar 

  6. S. Berchthold, C. Böhm, H.-P. Kriegel: The Pyramid-Technique: Towards Breaking the Curse of Dimensionality, Proc. ACM SIGMOD Conf. 1998, 142–153.

    Google Scholar 

  7. E. Bertino et al.: Indexing Techniques for Advanced Database Systems, Kluwer 1997.

    Google Scholar 

  8. R. Bliujute, C. S. Jensen, S. Saltenis, G. Slivinskas: R-tree Based Indexing of Now-Relative Bitemporal Data, TR-25, Time-Center Technical Report, 1998.

    Google Scholar 

  9. R. Elmasri, G.T.J. Wuu, Y.-J. Kim: The Time Index: An Access Structure For Temporal Data, Proc. VLDB 1990, 1–12.

    Google Scholar 

  10. R. Elmasri, G.T.J. Wuu, Y.-J. Kim: The Time Index and the Monotonic B +-tree, in [30], 433–456.

    Google Scholar 

  11. U. Finke, K. Hinrichs, L. Becker: The Binary-Radix Bucket-Region Directory: A Simple New Directory for the Grid File, Proc. Panel’92, 460–472, 1992.

    Google Scholar 

  12. H. Gunadhi, A. Segev: Efficient Indexing Methods for Temporal Relations, IEEE Transactions on Knowledge and Data Engineering, 5(3), 496–509, 1993.

    Article  Google Scholar 

  13. K. Hinrichs: Implementation of the Grid File: Design, Concepts and Experience, BIT 25, 1985, 569–592.

    MATH  MathSciNet  Google Scholar 

  14. K. H. Hinrichs, J. Nievergelt: The grid file: a data structure to support proximity queries on spatial objects, in: M. Nagl, J. Perl (eds.): Proc. WG’83, 100–113.

    Google Scholar 

  15. V. Kouramajian, R. Elmasri, A. Chaudhry: The Time Index+: An Incremental Access Structure For Temporal Databases, Proc. ICDE 1994, 232–242.

    Google Scholar 

  16. H.P. Kriegel, H. Horn, M. Schiwietz: The Performance of Object Decomposition Techniques for Spatial Query Processing, Proc. 2nd SSD 1991, 257–276.

    Google Scholar 

  17. A. Kumar, V. J. Tsotras, and C. Faloutsos: Designing Access Methods for Bitemporal Databases, IEEE Transactions on Knowledge and Data Engineering, 10(1), 1–20, 1998.

    Article  Google Scholar 

  18. K.I. Lin, H. V. Jagadish, C. Faloutsos: The TV-Tree: An Index for High-Dimensional Data, VLDB Journal, 3(4), 1994, 517–542.

    Article  Google Scholar 

  19. D. Lomet, B. Salzberg: Transaction Time Databases, in [30], 388–417.

    Google Scholar 

  20. M.A. Nascimento, M.H. Dunham, R. Elmasri: M-IVTT: An Index for Bitemporal Databases, Proc. DEXA’ 96, 779–790.

    Google Scholar 

  21. M.A. Nascimento, M.H. Dunham, V. Kouramajian: A Multiple Tree Mapping Based Approach for Valid-Time Index Ranges, Journal of the Brazilian Computer Society, 2(3), 1996.

    Google Scholar 

  22. M. A. Nascimento, M. H. Eich: An Introductory Survey to Indexing Techniques for Temporal Databases, Technical Report 95-CSE-01, Southern Methodist University, Dallas, TX, 1995.

    Google Scholar 

  23. J. Nievergelt, K. Hinrichs: Storage and Access Structures for Geometric Data Bases, Proc. Intern. Conf. on Foundations of Data Organization, 335–345, 1985.

    Google Scholar 

  24. J. Nievergelt, H. Hinterberger, K.C. Sevcik: The Grid File: An Adaptable, Symmetric Multikey File Structure, ACM TODS 9(1), 38–71, 1984.

    Article  Google Scholar 

  25. B.-C. Ooi, C. H. Goh, and K.-L. Tan: Indexing Bitemporal Databases as Points, Information and Software Technology (40), 327–337, 1998.

    Article  Google Scholar 

  26. J.F. Roddick, J.D. Patrick: Temporal Semantics in Information Systems-A Survey, Information Systems, 17(3), 1992, 249–267.

    Article  Google Scholar 

  27. B. Salzberg, V. J. Tsotras: A Comparison of Access Methods for Time Evolving Data, Technical Report NU-CCS-94-21, College of Computer Science, Northeastern University, 1994.

    Google Scholar 

  28. B. Seeger, H.-P. Kriegel: Techniques for Design and Implementation of Efficient Spatial Access Methods, Proc. VLDB 1988, 360–371.

    Google Scholar 

  29. H. Shen, B.C. Ooi, H. Lu: The TP-Index: A Dynamic and Efficient Indexing Mechanism for Temporal Databases, Proc. ICDE 1994, 274–281.

    Google Scholar 

  30. A.U. Tansel, J. Clifford, S. Gadia, S. Jajodia, A. Segev, R. Snodgrass (eds.): Temporal Databases-Theory, Design, and Implementation, Benjamin-Cummings, Redwood, CA, 1993.

    Google Scholar 

  31. V.J. Tsotras, N. Kanelagris: The Snapshot Index, an I/O Optimal Access Method for Timeslice Queries, Information Systems, 3(20), 237–260, 1995.

    Article  Google Scholar 

  32. V.J. Tsotras, A. Kumar: Temporal Database Bibliography Update, ACM SIGMOD Record, 25(1), 1996, 41–51.

    Google Scholar 

  33. A. Voigtmann, L. Becker, K. Hinrichs: An Object-Oriented Data Model and a Query Language for Geographic Information Systems, Bericht Nr. 15/95.-I, Institut für Informatik, Universität Münster, Germany, 1995.

    Google Scholar 

  34. A. Voigtmann, L. Becker, K. Hinrichs: A Query Language for Geo-Applications, Bericht Nr. 5/96-I, Institut für Informatik, Universität Münster, Germany, 1996.

    Google Scholar 

  35. A. Voigtmann, L. Becker, K. H. Hinrichs: Temporal extensions for an Object-Oriented Geo-Data-Model, Proc. SDH’96, 11A.25–11A.41.

    Google Scholar 

  36. A. Voigtmann: An Object-Oriented Database Kernel for Spatio-Temporal Geo-Applications, Ph.D.-Thesis, Institut für Informatik, Universität Münster, Germany, 1998.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Becker, L., Voigtmann, A., Hinrichs, K.H. (1999). Temporal Indexing with Multidimensional File Structures. In: Bench-Capon, T.J., Soda, G., Tjoa, A.M. (eds) Database and Expert Systems Applications. DEXA 1999. Lecture Notes in Computer Science, vol 1677. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48309-8_97

Download citation

  • DOI: https://doi.org/10.1007/3-540-48309-8_97

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-48309-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics