Overlapping B+-trees: An implementation of a transaction time access method

Data and Knowledge Engineering

Volumn 29, Issue 3, 1999, Pages 381-404

  Tzouramanis, Theodoros ^a   Manolopoulos, Yannis ^a   Lorentzos, Nikos ^b  

^a ARISTOTLE UNIVERSITY OF THESSALONIKI   (Greece)

^b AGRICULTURAL UNIVERSITY OF ATHENS   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SYSTEMS PROGRAMMING; DATA ACQUISITION; DATA REDUCTION; DATA STRUCTURES; INDEXING (OF INFORMATION); QUERY LANGUAGES; RESPONSE TIME (COMPUTER SYSTEMS);

GENERAL PURE-KEY QUERY;

DISTRIBUTED DATABASE SYSTEMS;

EID: 0033097237     PISSN: 0169023X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0169-023X(98)00046-9     Document Type: Article

References (23)

1. B. Becker, S. Gschwind, T. Ohler, B. Seeger, P. Widmayer, On optimal multi-version access structures, The VLDB Journal 5(4) (1996) 264-275.
2. F.W. Burton, M.W. Huntbach, J. Kollias, Multiple generation text files using overlapping tree structures, The Computer Journal 28(4) (1985) 414-416.
3. F.W. Burton, J.G. Kollias, V.G. Kollias, D.G. Matsakis, Implementation of overlapping B-trees for time and space efficient representation of collection of similar files, The Computer Journal 33(3) (1990) 279-280.
4. M.C. Easton, Key-sequence data sets on indelible storage, IBM Journal on Development 30(3) (1986) 230-241.
5. R. Elmasri, M. Jaseemuddin, V. Kouramajian, Partition of time index for optical disks, Proc. 8th IEEE International Conference on Data Engineering, Phoenix, AZ (1992) pp. 574-583.
6. A. Guttman, R-trees - A dynamic index structure for spatial searching, Proc. ACM SIGMOD Conf., Boston, MA (1984) pp. 47-57.
7. C.S. Jensen, J. Clifford, R. Elmasri, S. Gadia, P. Hayes, S. Jajodia, C. Dyreson, F. Grandi, W. Kafer, N. Kline, N. Lorentzos, Y. Mitsopoulos, A. Montanari, D. Nonen, E. Peressi, B. Pernici, J. Roddick, N. Sarda, M. Scalas, A. Segev, R. Snodgrass, M. Soo, A. Tansel, P. Tiberio, G. Wiederhold (Eds.), A consensus glossary of temporal database concepts, ACM SIGMOD Record 23(1) (1994) 52-64.
8. A. Kumar, V.J. Tsotras, C. Faloutsos, Designing access methods for bi-temporal databases, IEEE Trans. on Knowledge and Data Engineering 10(1) (1998) 1-20.
9. SD. Lang, J.R. Driscoll, Improving the differential file technique via batch operations for tree structured file organizations, Proc. IEEE Int. Conf. on Data Engineering, Los Angeles, CA (1986).
10. +-trees, Proc. ACM SIGMOD Conf., Denver, CO (1991) pp. 426-435.
11. D. Lomet, B. Salzberg, Transaction time databases. In: A. Tansel, J. Clifford, S. Gadia, S. Jajodia, A. Segev, R. Snodgrass (Eds.), Temporal Databases: Theory, Design and Implementation, Benjamin/Cummings (1993) pp. 388-417.
12. N.A. Lorentzos, Y. Manolopoulos, Functional requirements for historical and interval extensions to the relational model, Data and Knowledge Engineering, 17 (1995) 59-86.
13. N.A. Lorentzos, Y.G. Mitsopoulos, SQL extension for interval data, IEEE Trans. on Knowledge and Data Engineering 9(3) (1997) 480-499.
14. +-trees for temporal data, Proc. 5th JCIT Conf., Jerusalem, Israel (October 1990) pp. 491-498.
15. +-trees, Ph.D. Dissertation, Technical Report, Southern Methodist University, 1995; http://www.dcc.unicamp.br/~mario/papers.html/dissertation.ps.gz
16. M. Nascimento, M. Eich, An Introductory Survey to Indexing Techniques for Temporal Databases, Technical Report, Southern Methodist University, 1995; http://www.dcc.unicamp.br/~mario/papers.html/tr-95-cse-01.ps.gz
17. M. Nascimento, M. Eich, R. Elmasri, M-IVTT - An index for bi-temporal databases, Proc. 7th DEXA Conf., Lecture Notes in Computer Science, Vol. 1134, Springer Verlag, Zurich, Switzerland (1996) pp. 779-790.
18. B. Saltzberg, V. Tsotras, A comparison of access methods for time evolving data, ACM Computing Surveys, in press; ftp://ftp.ccs.neu.edu/pub/people/salzberg/tempsurvey.ps.gz
19. R.T. Snodgrass, I. Ahn, Temporal databases, IEEE Computer 19(9) (1986) 35-42.
20. A. Tansel, J. Clifford, S. Gadia, S. Jajodia, A. Segev, R. Snodgrass (Eds.), Temporal Databases: Theory, Design and Implementation, Benjamin/Cummings (1993).
21. V. Tsotras, N. Kangelaris, The snapshot index - An I/O optimal access method for timeslice queries, Information Systems 20(3) (1995) 237-260.
22. T. Tzouramanis, M. Vassilakopoulos, Y. Manolopoulos, Overlapping linear quadtrees - A spatiotemporal access method, Proc. 6th ACM Workshop on Advances in Geographical Information Systems (ACM-GIS 98), pp. 1-7, Bethesda, MD (1998).
23. P.J. Varman, R.M. Verma, An efficient multi-version access structure, IEEE Trans. on Knowledge and Data Engineering 9(3) (1997) 391-409.