Efficient algorithms for managing the history of evolving databases
 Vassilis J. Tsotras,
 B. Gopinath
 … show all 2 hide
Abstract
We propose a novel method for representing evolving databases by “evolving sets”, which is particularly useful when we are interested in reconstructing any past state of a database. This theoretical framework therefore reduces the problem concerning the history management of databases to the problem of efficiently managing the history of a set evolving in time. We present a dynamic algorithm that reconstructs the state of the set at a given time t in the past in O(s(t) + loglogT) time, where s(t) is the size of the answer and T is the maximal size of the time interval (t ≤ T). The space used is linear to the number of changes that occurred during the set's evolution. The resulting algorithm is thereby more efficient than all previous methods dealing with the history management of evolving databases. In fact the proposed algorithm is optimal within a constant factor, because a lower bound of Ω(s(t) + loglogT) is also proved. Furthermore, if a total of O((logT)^{1/c }) parallel processors is available, where c is a positive constant (c ≥ 1), the above bound is reduced to O(s(t)).
 M. Ajtai, “A Lower Bound for Finding Predecessors in Yao's Cell Probe Model”, Combinatorica, to appear.
 M. Ajtai, M. Fredman, J. Komlos, “Hash Functions for Priority Queues”, 24th IEEE FOCS 1983, pp 299–303.
 B. Chazelle, “How to Search in History”, Information and Control, 1985, Vol. 64, pp 77–99.
 M. Dietzfelbinger, A. Karlin, K. Mehlhorn, F. Meyer, H. Rohnhert and R. Tarjan, “Dynamic Perfect Hashing: Upper and Lower Bounds”, Proc. 29th IEEE FOCS, 1988.
 D.P. Dobkin, J.L. Munro, “Efficient Uses of the Past”, 21st IEEE FOCS, 1980, pp 200–206.
 A. Fiat, M. Naor, “Implicit O(1) Probe Search”, manuscript, 1988.
 A. Fiat, M. Naor, A. Schaffer, J.P. Schmidt, A. Siegel, “Storing and Searching a Multikey Table”, 20th ACM STOC, 1988, pp 344–353.
 A. Fiat, M. Naor, J.P. Schmidt, A. Siegel, “NonOblivious Hashing”, 20th ACM STOC, 1988, pp 367–376.
 M.L. Fredman, J. Komlos, “On the Size of Separating Systems and Families of Perfect Hash Functions”, SIAM J. Alg. Disc. Math., March 1984, Vol.5, No.1, pp 61–68.
 M.L. Fredman, J. Komlos, E. Szemeredi, “Storing a Sparse Table with O(1) Worst Case Access Time”, JACM, July 1984, Vol.31, pp 538–544.
 M.L. Fredman, M. Saks, “The Cell Probe Complexity of Dynamic Data Structures”, to appear.
 G.H. Gonnet, “Expected Length of the Longest Probe Sequence in Hash Code Searching”, JACM, April 1981, Vol.28, No.2, pp 289–304.
 K. Melhorn, “Data Structures and Algorithms I: Sorting and Searching”, Springer Verlag, Berlin, Heidelberg, 1984.
 J.I. Munro, “Searching a Two Key Table Under a Single Key”, 19th ACM STOC, 1987, pp 383–387.
 M. Overmars, “The Design of Dynamic Data Structures”, Springer Lecture Notes in Comp. Sc. 156, Springer Verlag, Berlin, 1983.
 F.P. Preparata, M.I. Shamos, “Computational Geometry, An Introduction”, Springer Verlag, Berlin, 1985.
 M. Snir, “On Parallel Searching”, SIAM J. of Computing, Vol. 14, No 3, Aug. 1985, pp 688–708.
 V.J. Tsotras, B. Gopinath, “Efficient Algorithms Managing the History of TimeEvolving Forests”, Bellcore Tech. Memo., TMARH013880, 1989.
 V.J. Tsotras, B. Gopinath, G. Hart, “A New Bound On Parallel Searching”, IEEE Fourth Annual Symposium on Parallel Processing, April 4–6, 1990, Vol 2, pp 613–622.
 L. Valiant, “Parallelism in Comparison Based Problems”, SIAM J. of Computing, Sept. 1975, Vol. 4, No 3, pp 348–355.
 P. Van Emde Boas, R. Kaas and E. Zijlstra, “Design and Implementation of an Efficient Priority Queue”, Math. Systems Theory 10, 1977, pp 99–127.
 D.E. Willard, “Loglogarithmic Worst case Queries are Possible in Space O(n)”, Information Processing Letters, 1983, Vol 17, pp 81–84.
 A.C. Yao, “Should Tables Be Sorted? ”, JACM, July 1981, Vol.28, No.3, pp 615–628.
 Title
 Efficient algorithms for managing the history of evolving databases
 Book Title
 ICDT '90
 Book Subtitle
 Third International Conference on Database Theory Paris, France, December 12–14, 1990 Proceedings
 Pages
 pp 141174
 Copyright
 1990
 DOI
 10.1007/3540535071_75
 Print ISBN
 9783540535072
 Online ISBN
 9783540466826
 Series Title
 Lecture Notes in Computer Science
 Series Volume
 470
 Series ISSN
 03029743
 Publisher
 Springer Berlin Heidelberg
 Copyright Holder
 SpringerVerlag
 Additional Links
 Topics
 Industry Sectors
 eBook Packages
 Editors
 Authors

 Vassilis J. Tsotras ^{(1)}
 B. Gopinath ^{(2)}
 Author Affiliations

 1. Dept. of Electrical Engineering, Center for Telecommunications Research, Columbia University, 10027, New York, NY
 2. Dept. of Electrical and Computer Engineering and Dept. of Computer Science, Rutgers University, 08903, New Brunswick, NJ
Continue reading...
To view the rest of this content please follow the download PDF link above.