Skip to main content
SpringerLink
Log in

Bitemporal Indexing

  • Reference work entry
  • First Online:
Book cover Encyclopedia of Database Systems

  • 12 Accesses

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 4,499.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 6,499.99
Price excludes VAT (USA)
  • Durable hardcover 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

Recommended Reading

  1. Becker B, Gschwind S, Ohler T, Seeger B, Widmayer P. An asymptotically optimal multiversion B-tree. VLDB J. 1996;5(4):264–75.

    Article  Google Scholar 

  2. Bliujute R, Jensen CS, Saltenis S, Slivinskas G. R-tree based indexing of now-relative bitemporal data. In: Proceedings of the 24th International Conference on Very Large Data Bases; 1998. p. 345–56.

    Google Scholar 

  3. Burton FW, Huntbach MM, Kollias JG. Multiple generation text files using overlapping tree structures. Comput J. 1985;28(4):414–6.

    Article  Google Scholar 

  4. Driscoll JR, Sarnak N, Sleator DD, Tarjan RE. Making data structures persistent. J Comput Syst Sci. 1989;38(1):86–124.

    Article  MathSciNet  MATH  Google Scholar 

  5. Kumar A, Tsotras VJ, Faloutsos C. Designing access methods for bitemporal databases. IEEE Trans Knowl Data Eng. 1998;10(1):1–20.

    Article  Google Scholar 

  6. Nascimento MA, Silva JRO. Towards historical R-trees. In: Proceedings of the 1998 ACM Symposium on Applied Computing; 1998. p. 235–40.

    Google Scholar 

  7. Salzberg B, Tsotras VJ. A comparison of access methods for time-evolving data. ACM Comput Surv. 1999;31(2):158–221.

    Article  Google Scholar 

  8. Snodgrass RT, Ahn I. Temporal databases. IEEE Comput. 1986;19(9):35–42.

    Article  MATH  Google Scholar 

  9. Tzouramanis T, Vassilakopoulos M, Manolopoulos Y. Overlapping linear quadtrees and spatio-temporal query processing. Comput J. 2000;43(4):325–43.

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Departamento de Ciencia da Computaçao, Universidade Federal de Minas Gerais – UFMG, Belo Horizonte, MG, Brazil

    Mirella M. Moro

  2. University of California-Riverside, Riverside, CA, USA

    Vassilis J. Tsotras

Authors
  1. Mirella M. Moro
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Vassilis J. Tsotras
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mirella M. Moro .

Editor information

Editors and Affiliations

  1. Georgia Institute of Technology College of Computing, Atlanta, GA, USA

    Ling Liu

  2. University of Waterloo School of Computer Science, Waterloo, ON, Canada

    M. Tamer Özsu

Section Editor information

  1. University of Arizona, Tucson, AZ, USA

    Richard T. Snodgrass

  2. Aalborg University, Aalborg Øst, Denmark

    Christian S. Jensen

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Science+Business Media, LLC, part of Springer Nature

About this entry

Check for updates. Verify currency and authenticity via CrossMark

Cite this entry

Moro, M.M., Tsotras, V.J. (2018). Bitemporal Indexing. In: Liu, L., Özsu, M.T. (eds) Encyclopedia of Database Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-8265-9_1514

Download citation

Publish with us

Policies and ethics

Search

Navigation