Minimizing Time-Space Cost For Database Version Control.

@inproceedings{DBLP:conf/pods/YuR88,
  author    = {Lin Yu and
               Daniel J. Rosenkrantz},
  title     = {Minimizing Time-Space Cost For Database Version Control},
  booktitle = {Proceedings of the Seventh ACM SIGACT-SIGMOD-SIGART Symposium
               on Principles of Database Systems, March 21-23, 1988, Austin,
               Texas},
  publisher = {ACM},
  year      = {1988},
  isbn      = {0-89791-263-2},
  pages     = {294-301},
  ee        = {http://doi.acm.org/10.1145/308386.308460, db/conf/pods/YuR88.html},
  crossref  = {DBLP:conf/pods/88},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

Copyright © 1988 by the ACM, Inc., used by permission. Permission to make digital or hard copies is granted provided that copies are not made or distributed for profit or direct commercial advantage, and that copies show this notice on the first page or initial screen of a display along with the full citation.

• 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
• UNIX/LINUX/Mac: use mount point /pods8298/... 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
• UNIX/LINUX/Mac: use mount point /aDVD1/... or /cdrom/...

Printed Edition

Online Edition: ACM Digital Library

References

[Bern]

...

[BLW]

Marshall W. Bern, Eugene L. Lawler, A. L. Wong: Why Certain Subgraph Computations Require Only Linear Time. FOCS 1985: 117-125 BibTeX

[Cook]

Stephen A. Cook: The Complexity of Theorem-Proving Procedures. STOC 1971: 151-158 BibTeX

[DLW]

Peter Dadam, Vincent Y. Lum, H.-D. Werner: Integration of Time Versions into a Relational Database System. VLDB 1984: 509-522 BibTeX

[Floy]

...

[Fred]

Michael L. Fredman: New Bounds on the Complexity of the Shortest Path Problem. SIAM J. Comput. 5(1): 83-89(1976) BibTeX

[FMW]

...

[GJ]

M. R. Garey, David S. Johnson: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman 1979, ISBN 0-7167-1044-7
BibTeX

[Gold]

...

[HG]

Mark N. Haynie, Karl Gohl: Revision Relations - Maintaining History Information. IEEE Database Eng. Bull. 7(2): 26-34(1984) BibTeX

[Karp]

...

[KB]

...

[KL]

...

[KL2]

Randy H. Katz, Tobin J. Lehman: Database Support for Versions and Alternatives of Large Design Files. IEEE Trans. Software Eng. 10(2): 191-200(1984) BibTeX

[Lich]

David Lichtenstein: Planar Formulae and Their Uses. SIAM J. Comput. 11(2): 329-343(1982) BibTeX

[Lin]

...

[MT]

Alistair Moffat, Tadao Takaoka: An All Pairs Shortest Path Algorithm with Expected Running Time O(n^2 log n). FOCS 1985: 101-105 BibTeX

[Perr]

...

[PS]

...

[Roch]

Marc J. Rochkind: The Source Code Control System. IEEE Trans. Software Eng. 1(4): 364-370(1975) BibTeX

[SL]

Dennis G. Severance, Guy M. Lohman: Differential Files: Their Application to the Maintenance of Large Databases. ACM Trans. Database Syst. 1(3): 256-267(1976) BibTeX

[Tarj]

...

[TFL]

...

[Tich]

...

[Tic2]

Walter F. Tichy: RCS - A System for Version Control. Softw., Pract. Exper. 15(7): 637-654(1985) BibTeX

[YR]

...

Referenced by

1. Lin Yu, Daniel J. Rosenkrantz: Ancestor Controlled Submodule Inclusion in Design Databases. IEEE Trans. Knowl. Data Eng. 5(2): 352-362(1993)
2. Lin Yu, Daniel J. Rosenkrantz: Representability of Design Objects by Ancestor-Controlled Hierarchical Specifications. PODS 1990: 28-39