Abstract
The classical set union problem is to manipulate a partition of {1,2,...,n} under the operations find and union. We study two variants of this problem. In the first variant the find operations contain a time parameter. We show that this extended problem can be solved and requires ϑ(nlogn) time for n operations on separable pointer machines. In the second variant find operations are the usual ones, but an arbitrary union operation can be cancelled by the deunion operation. The same result holds for this variant. These problems are motivated by questions arising in the tracing of Prolog executions and in the incremental execution of logic programs.
This work was supported by the Academy of Finland and by TEKES.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
M.R. Brown and R.E. Tarjan: Design and analysis of a data structure for representing sorted lists. SIAM Journal on Computing 9, 3 (August 1980), 594–614.
J.R. Driscoll, N. Sarnak, D.D. Sleator and R.E. Tarjan: Making data structures persistent. Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing, 1986, p. 109–121.
P. van Emde Boas: Preserving order in a forest in less than logarithmic time. Information Processing Letters 6, 3 (1977), 80–82.
H.N. Gabow and R.E. Tarjan: A linear-time algorithm for a special case of disjoint set union. Proceedings of the Fifteenth ACM SIGACT Symposium on Theory of Computing, 1983, p. 246–251.
C.J. Hogger: Introduction to Logic Programming. Academic Press, 1984.
S. Huddleston and K. Mehlhorn: A new data structure for representing sorted lists. Acta Informatica 17 (1982), 157–184.
H. Mannila and E. Ukkonen: On the complexity of unification sequences. Third International Conference on Logic Programming, E. Shapiro (ed.), Lecture Notes in Computer Science 225, Springer-Verlag 1986, p. 122–133.
H. Mannila and E. Ukkonen: The set union problem with backtracking. Automata, Languages, and Programming, Thirteenth International Colloquium, L. Kott (ed.), Springer Verlag LNCS 226, 1986, 236–243.
H. Manniala and E. Ukkonen: Timestamped term representation for implementing Prolog. Third IEEE Conference on Logic Programming, IEEE 1986, p. 159–167.
H. Mannila and E. Ukkonen: Unifications, deunifications, and their complexity. Report C 1987–27, Department of Computer Science, University of Helsinki, 1987.
H. Mannila and E. Ukkonen: Space-time optimal algorithms for the set union problem with backtracking. Report C-1987-80, Department of Computer Science, University of Helsinki, 1987.
K. Mehlhorn, S. Näher, and H. Alt: A lower bound for the complexity of the union-splitfind problem. Automata, Languages, and Programming, Fourteenth International Colloquium, T. Ottmann (ed.), Springer-Verlag LNCS 267, 1987, p. 479–488.
M.H. Overmars: The Design of Dynamic Data Structures. Lecture Notes in Computer Science 156, Springer-Verlag, 1983.
D.D. Sleator and R.E. Tarjan: A data structure for dynamic trees. Journal of Computer and System Sciences 26 (1983), 362–391.
D.D. Sleator and R.E. Tarjan: Self-adjusting binary search trees. Journal of the ACM 32, 3 (1985), 652–686.
R.E. Tarjan: Efficiency of a good but not linear disjoint set union algorithm. Journal of the ACM 22, 2 (April 1975), 215–225.
R.E. Tarjan: A class of algorithms which require nonlinear time to maintain disjoint sets. Journal of Computer and System Sciences 18 (1979), 110–127.
R.E. Tarjan: Amortized computational complexity. SIAM Journal on Algebraic and Discrete Methods 6 (1985), 306–318.
R.E. Tarjan and J. van Leeuwen: Worst-case analysis of set union algorithms. Journal of the ACM 31, 2 (April 1984), 245–281.
J. van Leeuwen and T. van der Weide: Alternative path compression techniques. Technical Report RUU-CS-77-3, Rijksuniversiteit Utrecht, Utrecht, The Netherlands.
D.H.D. Warren and L.M. Pereira: Prolog — the language and its implementation compared with LISP. ACM SIGPLAN Notices 12, 8 (August 1977), 109–115.
J. Westbrook and R.E. Tarjan: Amortized analysis of algorithms for set union with backtracking. Manuscript, 1987.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mannila, H., Ukkonen, E. (1988). Time parameter and arbitrary deunions in the set union problem. In: Karlsson, R., Lingas, A. (eds) SWAT 88. SWAT 1988. Lecture Notes in Computer Science, vol 318. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-19487-8_4
Download citation
DOI: https://doi.org/10.1007/3-540-19487-8_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-19487-3
Online ISBN: 978-3-540-39288-0
eBook Packages: Springer Book Archive