Abstract
We propose path-merging as a refinement of techniques used to make linked data structures partially persistent. Path-merging supports bursts of operations between any two adjacent versions in contrast to only one operation in the original variant. The superiority of the method is shown both theoretically and experimentally. Details of the technique are explained for the case of binary search trees. Path-merging is particularly useful for the implementation of scan-line algorithms where many update operations on the sweep status structure have to be performed at the same event points. Examples are algorithms for planar point location, for answering intersection queries for sets of horizontal line segments, and for detecting conflicts in sets of 1-dim IP packet filters.
Subject Classifications: E.1 [Data]: Data Structures – trees; E.2 [Data]: Data Storage Representations – linked representations; F.2.2 [Analysis of Algorithms and Problem Complexity] Nonnumerical Algorithms and Problems – Geometrical problems and computations.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
References
Sarnak, N., Tarjan, R.E.: Planar point location using persistent search trees. Communications of the ACM 29(7), 669–679 (1986)
Driscoll, J.R., Sarnak, N., Sleator, D.D., Tarjan, R.E.: Making data structures persistent. In: STOC 1986: Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing, pp. 109–121. ACM Press, New York (1986)
de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry: Algorithms and Applications, 2nd edn. Springer, Heidelberg (2000)
Cole, R.: Searching and storing similar lists. Journal of Algorithms 7(2), 202–220 (1986)
Langner, T.: Using partial persistence to support bursts of operations in IP-lookup. Bachelor Thesis, Albert-Ludwigs-Universität Freiburg (March 2007)
Maindorfer, C., Mohamed, K.A., Ottmann, T., Datta, A.: A new output-sensitive algorithm to detect and resolve conflicts in internet router tables. In: INFOCOM 2007: Proceedings of the 26th IEEE International Conference on Computer Communications, May 2007, pp. 2431–2435. IEEE Press, Los Alamitos (2007)
Mohamed, K.A., Kupich, C.: An O(n log n) output-sensitive algorithm to detect and resolve conflicts for 1D range filters in router tables. Technical Report 226, Institut für Informatik, Albert-Ludwigs-Universität Freiburg (August 2006)
Kupich, C., Mohamed, K.A.: Conflict detection in internet router tables. Technical Report 225, Institut für Informatik, Albert-Ludwigs-Universität Freiburg (August 2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mohamed, K.A., Langner, T., Ottmann, T. (2008). Versioning Tree Structures by Path-Merging. In: Preparata, F.P., Wu, X., Yin, J. (eds) Frontiers in Algorithmics. FAW 2008. Lecture Notes in Computer Science, vol 5059. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69311-6_13
Download citation
DOI: https://doi.org/10.1007/978-3-540-69311-6_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69310-9
Online ISBN: 978-3-540-69311-6
eBook Packages: Computer ScienceComputer Science (R0)