On optimal multiversion access structures

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 692 LNCS, Issue , 1993, Pages 123-141

  Becker, Bruno ^a   Gschwind, Stephan ^a   Ohler, Thomas ^b   Seeger, Bernhard ^c   Widmayer, Peter ^b  

^a UNIVERSITY OF FREIBURG   (Germany)

^b ETH ZURICH   (Switzerland)

^c UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DIGITAL STORAGE;

ACCESS STRUCTURE; ASYMPTOTICALLY OPTIMAL; DATA ITEMS; INSERTIONS AND DELETIONS; LOSS OF EFFICIENCIES; MULTI-VERSION; RANGE QUERY; STORAGE SPACES;

STRUCTURAL OPTIMIZATION;

EID: 0040583840     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-56869-7_8     Document Type: Conference Paper

References (19)

1. P.A. Bernstein, V. Hadzilacos, and N. Goodman. Concurrency control and recovery in database systems. Addison Wesley Pubi, Co., Reading, Massachusetts, 1987.
2. N.S. Barghouti and G.E. Kaiser. Concurrency control in advanced database applications. ACM Computing Surveys, 23(3):269-317, 1991.
3. N. Beckmann, H.P. Kriegei, R. Schneider, and B. Seeger. The R*-tree: An efficient and robust access method for points and rectangles. ACM SIGMOD International Conf. on Management of Data, 19:322-331, 1990.
4. J. Clifford and G. Ariav. Temporal data management: models and systems. New directions for database systems, Eds. Ariav, G. and Clifford, J. Ablex, Publishing Co., Norwood, N.J., pages 168-186, 1986.
5. I J.R. Driscoll, N. Sarnak, D.D. Sleator, and R.E. Tarjan. Making data structures persistent. Journal of Comp, and System Sci., 38:86-124, 1989.
6. M. Easton. Key-sequence data sets on indelible storage. IBM J. Res. Development SO, 3, pages 230-241, 1986.
7. R. Elmasri, G. Wuu, and Y.-J. Kim. The time index: An access structure for temporal data. ACM SIGMOD International Conf. on Management of Data, 19:1-12, 1990.
8. M.W. Freeston. The BANG-file: a new kind of grid file. ACM SIGMOD International Conf. on Management of Data, 16:260-269, 1987.
9. D. Greene. An implementation and performance analysis of spatial access methods. Fifth IEEE International Conference on Data Engineering, Los Angeles, 5:606-615, 1989.
10. O. Giinther and J. Bilmes. Tree-based access methods for spatial databases: implementation and performance evaluation. IEEE Trans, on Knowledge and Data Eng., pages 342-356, 1991.
11. A. Guttman. R-trees: A dynamic index structure for spatial searching. ACM SIGMOD International Conf. on Management of Data, 12:47-57, 1984.
12. R.H. Katz. Towards a unified framework for version modeling in engineering databases. A CM Computing Surveys, 22(4):375-408, 1990.
13. C. Kolovson and M. Stonebraker. Indexing techniques for historical databases. IEEE Trans, on Knowledge and Data Eng., pages 127-137, 1989.
14. G. Langran. Time in Geographical Information Systems. Taylor and Francis, 1992.
15. S. Lanka and E. Mays. Fully persistent B+-trees. ACM SIGMOD International Conf. on Management of Data, 20:426-435, 1991.
16. D. Lomet and B. Salzberg. Access methods for multiversion data. ACM SIGMOD International Conf. on Management of Data, 18:315-324, 1989.
17. D. Lomet and B. Salzberg. The performance of a multiversion access method. ACM SIGMOD International Conf. on Management of Data, 19:353-363, 1990.
18. H. Samet. The design and analysis of spatial data structures. Addison-Wesley, 1989.
19. H. Samet. Applications of spatial data structures: computer graphies, image Processing, and GIS. Addison-Wesley, 1989.