Skip to main content
SpringerLink
Log in

The RABTree and RAB−Tree: lean index structures for snapshot access in transaction-time databases

  • Published:
Annals of Mathematics and Artificial Intelligence Aims and scope Submit manuscript

An Erratum to this article was published on 10 June 2016

Abstract

In this work we introduce two lean temporal index structures to efficiently support snapshot access (i.e., timeslice queries) in a transaction-time database. The two proposed structures, the RABTree and its RAB−Tree variant, are conceptually simple, easy to implement and efficient index solutions. In particular, the RABTree index guarantees optimal performances for transaction-time data which are naturally clustered according to their insertion time without redundancy. A theoretical and experimental evaluation of the two indexes, in comparison with their previously proposed competitors, is also provided.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Etzion, D., Jajodia, S., Sripada, S. (eds.): Temporal Databases - Research and Practice. LNCS, vol. 1399. Springer-Verlag, Berlin (1998)

  2. Jensen, C.S., Snodgrass, R.T.: Temporal database. In: Liu, L., Özsu, M.T. (eds.) Encyclopedia of Database Systems, pp 2957–2960. Springer-Verlag, Berlin (2009)

  3. Grandi, F.: Temporal databases. In: Khosrow-Pour, M. (ed.) Encyclopedia of Information Science and Technology. 3rd edn., pp 1914–1922. Hershey, IGI Global (2014)

  4. Jensen, C.S., Dyreson, C.E., Böhlen, M.H., Clifford, J., Elmasri, R., Gadia, S.K., Grandi, F., Hayes, P., Jajodia, S., Käfer, W., Kline, N., Lorentzos, N., Mitsopoulos, Y., Montanari, A., Nonen, D., Peressi, E., Pernici, B., Roddick, J.F., Sarda, N.L., Scalas, M.R., Segev, A., Snodgrass, R.T., Soo, M.D., Tansel, A., Tiberio, P. , Wiederhold, G.: The consensus glossary of temporal database concepts - February 1998 Version. In: [1], pp. 367–405 (1998)

  5. Clifford, J., Dyreson, C.E., Isakowitz, T., Jensen, C.S., Snodgrass, R.T.: On the semantics of “now” in databases. ACM Trans. Database Syst. 22(2), 171–214 (1997)

    Article  Google Scholar 

  6. Kulkarni, K., Michels, J.-K.: Temporal features in SQL:2011. ACM SIGMOD Rec 41(3), 34–43 (2011)

    Article  Google Scholar 

  7. Salzberg, B., Tsotras, V. J.: Comparison of access methods for time-evolving data. ACM Comput. Surv. 31(2), 158–221 (1999)

    Article  Google Scholar 

  8. Tsotras, V. J., Kangerlaris, N.: The Snapshot Index: An I/O-optimal access method for timeslice queries. Inf. Syst. 20(3), 237–260 (1995)

    Article  Google Scholar 

  9. Lomet, D., Salzberg, B.: The performance of a multiversion access method. In: Proc. 1990 ACM SIGMOD Int. Conf. on Management of Data, pp. 353–363. Atlantic City (1990)

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

    Article  Google Scholar 

  11. Gunadhi, H., Segev, A: Efficient indexing methods for temporal relations. IEEE Trans. Knowl. Data Eng. 5(3), 496–509 (1993)

    Article  Google Scholar 

  12. Elmasri, R., Wuu, G. T. J., Kim, Y.-J.: The time index: An access structure for temporal data. In: Proc. 16th Int. Conf. on Very Large Data Bases, pp. 1–12. Brisbane (1990)

  13. Tsotras, V. J., Gopinath, B., Hart, G.W.: Efficient management of time-evolving databases. IEEE Trans. Knowl. Data Eng. 7(4), 591–608 (1995)

    Article  Google Scholar 

  14. Grandi, F.: Lean index structures for snapshot access in transaction-time databases. In: Proc. 21st Int. Symposium on Temporal Representation and Reasoning, pp. 91–100. Verona (2014)

  15. Comer, D.: The ubiquitous B-Tree. ACM Comput. Surv. 11(2), 123–137 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  16. Elmasri, R., Navathe, S.B.: Fundamentals of Database Systems, 6th edn., pp 652–660. Addison-Wesley, Boston (2011)

  17. Amadesi, L., Grandi, F.: An adaptive split policy for the Time-Split B-Tree. Data Knowl. Eng. 29(1), 1–15 (1999)

    Article  MATH  Google Scholar 

  18. Elmasri, R., Wuu, G. T., Kouramajian, V.: The time index and the monotonic B+-Tree . In: Tansel, A. U., Clifford, J., Gadia, S. K., Segev, A., Snodgrass, R. T. (eds.) Temporal Databases: Theory, Design, and Implementation, pp 433–456. Benjamin/Cummings, San Francisco (1993)

  19. Elmasri, R., Kim, Y.-J., Wuu, G. T. J.: Efficient implementation techniques for the time index. In: Proc. 7th Int. Conf. on Data Engineering, pp. 102–111. Kobe (1991)

  20. Kouramajian, V., Kamel, I., Elmasri, R., Waheed, S.: “The time index+: An incremental access structure for temporal databases. In: Proc. 3rd Int. Conf. on Information and Knowledge Management, pp. 296–303. Gaithersburg (1994)

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering (DISI), Alma Mater Studiorum - Università di Bologna, Viale Risorgimento 2, 40136, Bologna, BO, Italy

    Fabio Grandi

Authors
  1. Fabio Grandi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Fabio Grandi.

Additional information

An erratum to this article is available at http://dx.doi.org/10.1007/s10472-016-9514-x.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Grandi, F. The RABTree and RAB−Tree: lean index structures for snapshot access in transaction-time databases. Ann Math Artif Intell 80, 219–245 (2017). https://doi.org/10.1007/s10472-016-9509-7

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10472-016-9509-7

Keywords

Mathematics Subject Classifications (2010)

Search

Navigation