caa a22 4500 46798977X CHVBK 20180323112541.0 cr unu---uuuuu 170328e19900701xx s 000 0 eng 10.1007/BF00259470 doi (NATIONALLICENCE)springer-10.1007/BF00259470 Minimizing time-space cost for database version control [Elektronische Daten] [Lin Yu, Daniel Rosenkrantz] Summary: We introduce the concept of a version graph to model the problem of minimizing the combined cost of storage space and version regeneration time for database version control systems. We show that, in general, this problem and several of its variations are NP-complete. Several heuristics are developed, and performance guarantees for these heuristics are obtained. We also present linear time algorithms for special classes of version graphs; these special classes are likely to apply in many version control systems. Springer-Verlag, 1990 Yu Lin Department of Computer Science, State University of New York at Albany, 12222, Albany, NY, USA aut Rosenkrantz Daniel Department of Computer Science, State University of New York at Albany, 12222, Albany, NY, USA aut Acta Informatica Springer-Verlag 27/7(1990-07-01), 627-663 0001-5903 27:7<627 1990 27 236 https://doi.org/10.1007/BF00259470 text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1007/BF00259470 text/html Onlinezugriff via DOI NATIONALLICENCE 700 1- Yu Lin Department of Computer Science, State University of New York at Albany, 12222, Albany, NY, USA aut NATIONALLICENCE 700 1- Rosenkrantz Daniel Department of Computer Science, State University of New York at Albany, 12222, Albany, NY, USA aut NATIONALLICENCE 773 0- Acta Informatica Springer-Verlag 27/7(1990-07-01), 627-663 0001-5903 27:7<627 1990 27 236 Metadata rights reserved Springer special CC-BY-NC licence nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-springer