A framework for access methods for versioned data

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

Volumn 2992, Issue , 2004, Pages 730-747

  Salzberg, Betty ^a   Jiang, Linan ^b   Lomet, David ^c   Barrena, Manuel ^d   Shan, Jing ^a   Kanoulas, Evangelos ^a  

^a Northeastern University   (United States)

^b ORACLE CORPORATION   (United States)

^c MICROSOFT RESEARCH   (United States)

^d UNIVERSITY OF EXTREMADURA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTERS;

ACCESS METHODS; CLUSTERING DATA; COMPACT REPRESENTATION; FUNDAMENTAL PROPERTIES; MINIMAL REPRESENTATION; NUMBER OF DATUM; SPATIO TEMPORAL; VERSIONING;

ARTIFICIAL INTELLIGENCE;

EID: 35048823433     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24741-8_42     Document Type: Article

References (13)

1. B. Becker, S. Gschwind, T. Ohler, B. Seeger, and P. Widmayer. On optimal multiversion access structures. In Froc. Int. Symp. on Spatial Databases, pages 123-141, Singapore, 1993.
2. Paul F. Dietz and Daniel D. Sleator. Two algorithms for maintaining order in a list. In Proceedings of the nineteenth annual ACM conference on Theory of computing, 1987.
3. James R. Driscoll, Neil Sarnak, and Daniel D. Sleator. Making data structure persistent. Journal of Computer and System Sciences, 38, February 1989.
4. M. C. Easton. Key-sequence data sets on indelible storage. IBM J. Res. Development, pages 230-241, 1986.
5. Georgios Evangelidis, David B. Lomet, and Betty Salzberg. The hB-Pi-Tree: A multi-attribute index supporting concurrency, recovery and node consolidation. The VLDB Jounal, pages 1-25, January 1997.
6. Marios Hadjieleftheriou, George Kollios, Vassilis J. Tsotras, and Dimitrios Gunopulos. Efficient indexing of spatiotemporal objects. In EDBT 2002, LNCS 2287, pages 251-268, 2002.
7. Linan Jiang, Betty Salzberg, David Lomet, and Manuel Barrena. The BT-Tree: A branched and temporal access method. In International Conference on Very Large Data Bases, pages 451-460, 2000.
8. Linian Jiang, Betty Salzberg, David Lomet, and Manuel Barrena. The BTR-Tree: Path-defined version-range splitting in a branched and temporal structure. In Proceedings of the Eighth International Symposium on Spatial and Temporal Databases, SSTD 2003, Santorini Island, Greece, LNCS 2750.
9. Evangelos Kanoulas and Georgios Evangelidis. Indexing of spatiotemporal data with the hB-Pi Tree. In HDMS'02 1st Hellenic Data Management Symposium, Athens, Hellas, July 2002.
10. +-trees. In Proceedings of ACM/SIGMOD Annual Conference on Management of Data, pages 426-435, 1991.
11. D. Lomet and B. Salzberg. The performance of a multiversion access method. In Proceedings of ACM/SIGMOD Annual Conference on Management of Data, pages 354-363, 1990.
12. Yufei Tao and Dimitris Papadias. The MV3R-Tree: A spatio-temporal access method for timestamp and interval queries. In VLDB 2001, Proceedings of 27th International Conference on Very Large Data Bases, pages 431-440, Sep. 2001.
13. Peter J. Varman and Rakesh M. Verma. An efficient multiversion access structure. In IEEE Transaction on Knowledge and Data Engineering, pages 391-409, May/June 1997.