Efficient Management of Time-Evolving Databases.

@article{DBLP:journals/tkde/TsotrasGH95,
  author    = {Vassilis J. Tsotras and
               B. Gopinath and
               George W. Hart},
  title     = {Efficient Management of Time-Evolving Databases},
  journal   = {IEEE Trans. Knowl. Data Eng.},
  volume    = {7},
  number    = {4},
  year      = {1995},
  pages     = {591-608},
  ee        = {db/journals/tkde/TsotrasGH95.html},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

Copyright © 1995 by The Institute of Electrical and Electronic Engineers, Inc. (IEEE). Abstract used with permission.

Joint ACM SIGMOD / IEEE Computer Society Anthology

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the CD and click on the path of your mount point:
  /Anthology/An3-3 or /cdrom

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the DVD and click on the path of your mount point:
  /Anthology/aDVD2 or /dvd

References

[1]

Rafi Ahmed, Shamkant B. Navathe: Version Management of Composite Objects in CAD Databases. SIGMOD Conference 1991: 218-227 BibTeX

[2]

Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman: The Design and Analysis of Computer Algorithms. Addison-Wesley 1974, ISBN 0-201-00029-6
BibTeX

[3]

...

[4]

Bruno Becker, Stephan Gschwind, Thomas Ohler, Bernhard Seeger, Peter Widmayer: On Optimal Multiversion Access Structures. SSD 1993: 123-141 BibTeX

[5]

R. G. G. Cattell: Object Data Management: Object-Oriented and Extended Relational Database Systems. Addison-Wesley 1991, ISBN 0-201-53092-9
BibTeX

[6]

Bernard Chazelle: How to Search in History. Information and Control 64(1-3): 77-99(1985) BibTeX

[7]

Richard Cole: Searching and Storing Similar Lists. J. Algorithms 7(2): 202-220(1986) BibTeX

[8]

Martin Dietzfelbinger, Anna R. Karlin, Kurt Mehlhorn, Friedhelm Meyer auf der Heide, Hans Rohnert, Robert Endre Tarjan: Dynamic Perfect Hashing: Upper and Lower Bounds. FOCS 1988: 524-531 BibTeX

[9]

David P. Dobkin, J. Ian Munro: Efficient Uses of the Past. FOCS 1980: 200-206 BibTeX

[10]

James R. Driscoll, Neil Sarnak, Daniel Dominic Sleator, Robert Endre Tarjan: Making Data Structures Persistent. J. Comput. Syst. Sci. 38(1): 86-124(1989) BibTeX

[11]

Ramez Elmasri, Gene T. J. Wuu, Yeong-Joon Kim: The Time Index: An Access Structure for Temporal Data. VLDB 1990: 1-12 BibTeX

[12]

Michael L. Fredman, János Komlós, Endre Szemerédi: Storing a Sparse Table with 0(1) Worst Case Access Time. J. ACM 31(3): 538-544(1984) BibTeX

[13]

Christian S. Jensen, James Clifford, Ramez Elmasri, Shashi K. Gadia, Patrick J. Hayes, Sushil Jajodia: A Consensus Glossary of Temporal Database Concepts. SIGMOD Record 23(1): 52-64(1994) BibTeX

[14]

Randy H. Katz: Towards a Unified Framework for Version Modeling in Engineering Databases. ACM Comput. Surv. 22(4): 375-408(1990) BibTeX

[15]

Curtis P. Kolovson, Michael Stonebraker: Indexing Techniques for Historical Databases. ICDE 1989: 127-137 BibTeX

[16]

Sitaram Lanka, Eric Mays: Fully Persistent B+-trees. SIGMOD Conference 1991: 426-435 BibTeX

[17]

David B. Lomet, Betty Salzberg: Access Methods for Multiversion Data. SIGMOD Conference 1989: 315-324 BibTeX

[18]

David B. Lomet, Betty Salzberg: The Performance of a Multiversion Access Method. SIGMOD Conference 1990: 353-363 BibTeX

[19]

Nikos A. Lorentzos, Roger G. Johnson: Extending relational algebra to manipulate temporal data. Inf. Syst. 13(3): 289-296(1988) BibTeX

[20]

Shamkant B. Navathe, Rafi Ahmed: A Temporal Relational Model and a Query Language. Inf. Sci. 49(1-3): 147-175(1989) BibTeX

[21]

Mark H. Overmars: The Design of Dynamic Data Structures. Lecture Notes in Computer Science Vol. 156 Springer 1983, ISBN 3-540-12330-X
BibTeX

[22]

Franco P. Preparata, Michael Ian Shamos: Computational Geometry - An Introduction. Springer 1985, ISBN 3-540-96131-3
BibTeX

[23]

Betty Salzberg, Vassilis J. Tsotras: Comparison of Access Methods for Time-Evolving Data. ACM Comput. Surv. 31(2): 158-221(1999) BibTeX

[24]

Hanan Samet: Hierarchical Representations of Collections of Small Rectangles. ACM Comput. Surv. 20(4): 271-309(1988) BibTeX

[25]

Richard T. Snodgrass, Ilsoo Ahn: Temporal Databases. IEEE Computer 19(9): 35-42(1986) BibTeX

[26]

Richard T. Snodgrass: The Temporal Query Language TQuel. ACM Trans. Database Syst. 12(2): 247-298(1987) BibTeX

[27]

...

[28]

Vassilis J. Tsotras, B. Gopinath: Efficient Algorithms for Managing the History of Evolving Databases. ICDT 1990: 141-174 BibTeX

[29]

Vassilis J. Tsotras, B. Gopinath: Optimal Versioning of Objects. ICDE 1992: 358-365 BibTeX

[30]

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

[31]

Dan E. Willard: Log-Logarithmic Worst-Case Range Queries are Possible in Space Theta(N). Inf. Process. Lett. 17(2): 81-84(1983) BibTeX

[32]

Andrew Chi-Chih Yao: Should Tables Be Sorted? J. ACM 28(3): 615-628(1981) BibTeX

Referenced by

1. Anil Kumar, Vassilis J. Tsotras, Christos Faloutsos: Designing Access Methods for Bitemporal Databases. IEEE Trans. Knowl. Data Eng. 10(1): 1-20(1998)
2. Vassilis J. Tsotras, Christian S. Jensen, Richard T. Snodgrass: An Extensible Notation for Spatiotemporal Index Queries. SIGMOD Record 27(1): 47-53(1998)
3. Gad M. Landau, Jeanette P. Schmidt, Vassilis J. Tsotras: Historical Queries Along Multiple Lines of Time Evolution. VLDB J. 4(4): 703-726(1995)