Object-Relational Indexing for General Interval Relationships | SpringerLink
Skip to main content
Springer Nature Link
Log in

Object-Relational Indexing for General Interval Relationships

  • Conference paper
  • First Online:
Advances in Spatial and Temporal Databases (SSTD 2001)

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

Included in the following conference series:

Abstract

Intervals represen t a fundamental data type for temporal, scientific, and spatial databases where time stamp s and d point data are extended to time spans and range data, res pectively. For O LTP and OLAP a pplications on large amounts of data, no t only intersection que ries have to be processed efficiently but a lso general interval relationships including before, meets, overlaps, starts, finishes, contains, equals, during, startedBy, finishedBy, overlappedBy, metBy and after. Our new algorithms use the Relational Interval Tree, a purely SQL-based and object-relationally wrapped index structure. The technique therefore preserves the industrial strength of the underly ing RDBMS including stability, transactions, and performance. The efficiency of our approach is demonstrated by an experimental evaluation on area l weblog data set containing one million sessions.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 5719
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 7149
Price includes VAT (Japan)
  • 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.

Similar content being viewed by others

References

  1. Allen J. F: Maintaining Knowledge about Temporal Internals. Communications of the ACM 26(11): 832–843, 1983

    Article  MATH  Google Scholar 

  2. Bliujute R., Saltenis S., Slivinskas G., Jensen C.S.: Developing a DataBladefor a New Index. Proc. IEEE 15th Int. Conf. on Data Engineering (ICDE): 314–323, 1999

    Google Scholar 

  3. Chen W., Chow J.-H., Fuh Y.-C, Grandbois J., Jou M., Mattos N., Tran B., Wang Y.: High Level Indexing of User-Defined Types. Proc. 25th Int. Conf. on Very Largi Databases (VLDB): 554–564, 1999

    Google Scholar 

  4. Edelsbrunner H.: Dynamic Rectangle Intersection Searching. Inst. for Informatioi Processing Report 47, Technical University of Graz, Austria, 1980

    Google Scholar 

  5. Eisenberg A., Melton J.: SQL: 1999, formerly known as SQL3. ACM SIGMOI Record, 28(1): 131–138, 1999

    Article  Google Scholar 

  6. Goh C. H., Lu H., Ooi B. C, Tan K.-L.: Indexing Temporal Data Using Existing B+-Trees. Data & Knowledge Engineering, Elsevier, 18(2): 147–165, 1996

    Article  MATH  Google Scholar 

  7. IBM Corp.: IBM DB2 Universal Database Application Development Guide, Vs. 6. Armonk, NY, 1999

    Google Scholar 

  8. Informix Software, Inc.: DataBlade Developers Kit User’s Guide. Menlo Park, CA, 1998

    Google Scholar 

  9. Jensen C. S., Snodgrass R. T.: Temporal Data Management. IEEE Transactions on Knowledge and Data Engineering, 11(1): 36–44, 1999

    Article  Google Scholar 

  10. Kornacker M.: High-Performance Extensible Indexing. Proc. 25th Int. Conf. on Very Large Databases (VLDB): 699–708, 1999

    Google Scholar 

  11. Kriegel H.-P, Pötke M., Seidl T.: Managing Intervals Efficiently in Object-Relational Databases. Proc. 26th Int. Conf. on Very Large Databases (VLDB): 407–418, 2000

    Google Scholar 

  12. Li W., Snodgrass R. T., Deng S., Gattu V. K., Kasthurirangan A.: Efficient Sequenced Temporal Integrity Checking. Proc. IEEE 17th Int. Conf. on Data Engineering (ICDE): 131–140, 2001

    Google Scholar 

  13. Nascimento M. A., Dunham M.H.: Indexing Valid Time Databases via B+-Trees. IEEE Trans, on Knowledge and Data Engineering (TKDE) 11(6): 929–947, 1999

    Article  Google Scholar 

  14. Olston C, Loo B. T., Widom J.: Adaptive Precision Setting for Cached Approximate Values. Proc. ACM SIGMOD Int. Conf. on Management of Data, 2001

    Google Scholar 

  15. Oracle Corp.: Oracle8i Data Cartridge Developer’s Guide, Release 2 (8.1.6). Redwood City, CA, 1999

    Google Scholar 

  16. Ramaswamy S.: Efficient Indexing for Constraint and Temporal Databases. Proc. 6th Int. Conf. on Database Theory (ICDT), LNCS 1186: 419–413, 1997

    Google Scholar 

  17. Samet H.: Applications ofSpatial Data Structures. Addison-Wesley, 1990.

    Google Scholar 

  18. Srinivasan J., Murthy R., Sundara S., Agarwal N., DeFazio S.: Extensible Indexing: A Framework for Integrating Domain-Specific Indexing Schemes into Oracle8i. Proc. IEEE 16th Int. Conf. on Data Engineering (ICDE): 91–100, 2000

    Google Scholar 

  19. Snodgrass R T.: Developing Time-Oriented Database Applications in SQL. Morgan Kaufmann, 2000

    Google Scholar 

  20. Stonebraker M.: Inclusion of New Types in Relational Data Base Systems. Proc. IEEE 2nd Int. Conf. on Data Engineering (ICDE): 262–269, 1986

    Google Scholar 

  21. Tansel A. U., Clifford J., Gadia S., Jajodia S., Segev A., Snodgrass R.: Temporal Databases: Theory, Design and Implementation. Redwood City, CA, 1993.

    Google Scholar 

  22. Torp K., Jensen C. S., Snodgrass R. T.: Stratum Approaches to Temporal DBMS Implementation. Proc. IDEAS Conf.: 4–13, 1998

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute for Compu ter Science, University o f Mun ich, Oettingenstr. 67, 80538, Munich, Germany

    Hans-Peter Kriegel, Marco Pötke & Thomas Seidl

Authors
  1. Hans-Peter Kriegel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Marco Pötke
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Thomas Seidl
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Aalborg University, Fredrik Bajers Vej 7E, 9220, Aalborg Øst, Denmark

    Christian S. Jensen

  2. Praktische Informatik IV, FernUniversität Hagen, 58084, Hagen, Germany

    Markus Schneider

  3. Fachbereich Mathematik und Informatik, Philipps-Universität Marburg, 35032, Marburg, Germany

    Bernhard Seeger

  4. Department of Computer Science and Engineering, University of California, Riverside, CA, 92521, USA

    Vassilis J. Tsotras

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kriegel, HP., Pötke, M., Seidl, T. (2001). Object-Relational Indexing for General Interval Relationships. In: Jensen, C.S., Schneider, M., Seeger, B., Tsotras, V.J. (eds) Advances in Spatial and Temporal Databases. SSTD 2001. Lecture Notes in Computer Science, vol 2121. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47724-1_27

Download citation

  • DOI: https://doi.org/10.1007/3-540-47724-1_27

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42301-0

  • Online ISBN: 978-3-540-47724-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation