This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Designing Access Methods for Bitemporal Databases
January/February 1998 (vol. 10 no. 1)
pp. 1-20

Abstract—By supporting the valid and transaction time dimensions, bitemporal databases represent reality more accurately than conventional databases. In this paper, we examine the issues involved in designing efficient access methods for bitemporal databases, and propose the partial-persistence and the double-tree methodologies. The partial-persistence methodology reduces bitemporal queries to partial persistence problems for which an efficient access method is then designed. The double-tree methodology "sees" each bitemporal data object as consisting of two intervals (a valid-time and a transaction-time interval) and divides objects into two categories according to whether the right endpoint of the transaction time interval is already known. A common characteristic of both methodologies is that they take into account the properties of each time dimension. Their performance is compared with a straightforward approach that "sees" the intervals associated with a bitemporal object as composing one rectangle, which is stored in a single multidimensional access method. Given that some limited additional space is available, our experimental results show that the partial-persistence methodology provides the best overall performance, especially for transaction timeslice queries. For those applications that require ready, off-the-shelf, access methods, the double-tree methodology is a good alternative.

[1] L. Arge and J.S. Vitter, "Optimal Dynamic Interval Management in External Memory," Proc. 37th IEEE Symp. Foundations Computer Science,Vermont, Oct. 1996.
[2] G. Ariav, "Information Systems for Managerial Planning and Control: A Conceptual Examination of their Temporal Structure," J. MIS, vol. 9, no. 2, pp. 77-98, 1992.
[3] B. Becker, S. Gschwind, T. Ohler, B. Seeger, and P. Widmayer, "An Asymptotically Optimal Multiversion B-Tree," Very Large Data Bases J., vol. 5, no. 4, pp. 264-275, 1996.
[4] N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger, “The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles,” Proc. ACM SIGMOD Conf. Management of Data, 1990.
[5] J.L. Bentley, "Algorithms for Klee's Rectangle Problems," Computer Science Dept., Carnegie Mellon Univ., Pittsburgh, 1977.
[6] T.H. Cormen,C.E. Leiserson, and R.L. Rivest,Introduction to Algorithms.Cambridge, Mass.: MIT Press/McGraw-Hill, 1990.
[7] J.R. Driscoll, N. Sarnak, D.D. Sleator, and R.E. Tarjan, "Making Data Structures Persistent," J. Computer and System Sciences, vol. 38, pp. 86-124, 1989.
[8] H. Edelsbrunner, "A New Approach to Rectangle Intersections," Parts I and II, Int'l J. Computer Mathematics, vol. 13, pp. 209-229, 1983.
[9] R. Elmasri, G.T.J. Wuu, and Y.-J. Kim, "The Time Index: An Access Structure for Temporal Data," Proc. VLDB Conf., pp. 1-12, 1990.
[10] J.F. Fries, "Time-Oriented Patient Records and a Computer Databank," J. Am. Medical Assoc., vol. 222, no. 12, 1972.
[11] A. Guttman, “R-Trees: A Dynamic Index Structure for Spatial Searching,” Proc. ACM SIGMOD Conf. Management of Data, 1984.
[12] V. Harinarayan, A. Rajaraman, and J. D. Ullman, “Implementing Data Cubes Efficiently,” Proc. ACM SIGMOD, pp. 205-216, June 1996
[13] C.S. Jensen, J. Clifford, R. Elmasri, S.K. Gadia, P. Hayes and S. Jajodia, eds., "A Glossary of Temporal Database Concepts," ACM SIGMOD Record, vol. 23, no. 1, pp. 52-64, Mar. 1994.
[14] C.S. Jensen, L. Mark, and N. Roussopoulos, "Incremental Implementation Model for Relational Databases with Transaction Time," IEEE Trans. Knowledge and Data Engineering, vol. 3, no. 4, pp. 461-473, Dec. 1991.
[15] P.C. Kanellakis, S. Ramaswamy, D.E. Vengroff, and J.S. Vitter, "Indexing for Data Models with Constraints and Classes," Proc. 12th ACM Symp. Principles Database Systems (PODS), pp. 233-243, 1993.
[16] C. Kolovson and M. Stonebraker, "Indexing Techniques for Historical Databases," Proc. IEEE Conf. Data Eng., pp. 127-137, 1989.
[17] C. Kolovson and M. Stonebraker, "Segment Indexes: Dynamic Indexing Techniques for Multi-Dimensional Interval Data," Proc. ACM SIGMOD Conf., pp. 138-147, 1991.
[18] A. Kumar, V.J. Tsotras, and C. Faloutsos, "Access Methods for Bitemporal Databases," Recent Advances in Temporal Databases, J. Clifford and A. Tuzhilin, eds., pp. 235-254. Springer-Verlag, 1995.
[19] A. Kumar, V.J. Tsotras, and C. Faloutsos, "Designing Access Methods for Bitemporal Databases," Tech. Report UMIACS-TR-97-24, Univ. of Maryland, 1997.
[20] G.M. Landau, J.P. Schmidt, and V.J. Tsotras, "On Historical Queries along Multiple Lines of Time Evolution," Very Large Data Bases J., vol. 4, no. 4, pp. 703-726, Oct. 1995.
[21] S. Lanka and E. Mays, "Fully Persistent B+ Trees," Proc. ACM SIGMOD Conf., pp. 426-435, 1991.
[22] T.Y.C. Leung and R.R. Muntz, "Stream Processing: Temporal Query Processing and Optimization," A. Tansel, J. Clifford, S.K. Gadia, S. Jajodia, A. Segev, and R.T. Snodgrass, eds., Temporal Databases: Theory, Design, and Implementation, pp. 329-355, Benjamin/Cummings, 1993.
[23] D. Lomet and B. Salzberg, "Access Methods for Multiversion Data," Proc. ACM SIGMOD Conf., pp. 315-324, 1989.
[24] Y. Manolopoulos and G. Kapetanakis, "Overlapping B+ Trees for Temporal Data," Proc. Fifth JCIT Conf.,Jerusalem, Israel, pp. 491-498, Oct. 1990.
[25] E.M. McCreight, "Priority Search Trees," SIAM J. Computing, vol. 14, no. 2, pp. 257-276, 1985.
[26] K. Melhorn, Data Structures and Algorithms: III, Multidimensional Searching and Computational Geometry. publisher? June 1991.
[27] G. Özsoyovglu and R.T. Snodgrass, “Temporal and Real-Time Databases: A Survey,” IEEE Trans. Knowledge and Data Eng., vol. 7, no. 4, pp. 513–532, 1995.
[28] B. Salzberg and V.J. Tsotras, "A Comparison of Access Methods for Time-Evolving Data," ACM Computing Surveys, to appear; also available as Technical Report No. TR-18, TimeCenter, Aalborg Univ., 1997: .
[29] H. Samet, The Design and Analysis of Spatial Data Structures. Addison-Wesley, 1990.
[30] A. Segev and H. Gunadhi, "Event-Join Optimization in Temporal Relational Databases," Proc. VLDB Conf., pp. 205-215, Aug. 1989.
[31] T. Sellis, N. Roussopoulos, and C. Faloutsos, “The R+-Tree: A Dynamic Index for Multidimensional Objects,” Proc. 13th Int'l Conf. Very Large Data Bases (VLDB), 1987.
[32] R.T. Snodgrass, I. Ahn, G. Ariav, D.S. Batory, J. Clifford, C.E. Dyreson, R. Elmasri, F. Grandi, C.S. Jensen, W. Kafer, N. Kline, K. Kulkanri, T.Y.C. Leung, N. Lorentzos, J.F. Roddick, A. Segev, M.D. Soo, and S.M. Sripada, "TSQL2 Language Specification," SIGMOD Record, vol. 23, no. 1, pp. 65-86, Mar. 1994.
[33] R.T. Snodgrass and I. Ahn, "Temporal Databases," Computer, vol. 19, no. 9, pp. 35-42, Sept. 1986.
[34] V.J. Tsotras, C.S. Jensen, and R.T. Snodgrass, “An Extensible Notation for Spatiotemporal Index Queries,” SIGMOD Record, vol. 27, no. 1, pp. 47-53, 1998.
[35] V. J. Tsotras, B. Gopinath, and G.W. Hart, "Efficient Management of Time-Evolving Databases," IEEE Trans. Knowledge and Data Eng., vol. 7, no. 4, pp. 591-608, Aug. 1995.
[36] V.J. Tsotras and N. Kangelaris, "The Snapshot Index: An I/O-Optimal Access Method for Timeslice Queries," Information Systems, vol. 20, no. 3, pp. 237-260, 1995.
[37] P.J. Varman and R.M. Verma, "An Efficient Multiversion Access Structure," IEEE Trans. Knowledge and Data Eng., vol. 9, no. 3, pp. 391-409, May/June 1997.
[38] R. Weber, "Audit Trail System Support in Advance Computer-Based Accounting Systems," Accounting Rev., vol. LVII, no. 2, pp. 311-325, 1982.

Index Terms:
Bitemporal databases, access methods, transaction-time, valid-time, data structures.
Citation:
Anil Kumar, Vassilis J. Tsotras, Christos Faloutsos, "Designing Access Methods for Bitemporal Databases," IEEE Transactions on Knowledge and Data Engineering, vol. 10, no. 1, pp. 1-20, Jan.-Feb. 1998, doi:10.1109/69.667079
Usage of this product signifies your acceptance of the Terms of Use.