Efficient insertion of approximately sorted sequences of items into a dictionary
In this paper a new data structure is introduced for the efficient on-line insertion of a sequence S of keys into a dictionary. The data structure takes advantage by the presence in S of subsets of adjacent keys which maintain their adjacency in the dictionary too, supporting the insertion of t keys in O(plog s + (t - p)) worst case time and O (s) worst case space, where s is the size of the dictionary and p is the number of such subsets. Some applications, as specified in the paper, specifically require for this property.
KeywordsLevel Node Binary Search Tree Binomial Tree Recursive Decomposition Balance Binary Tree
Unable to display preview. Download preview PDF.
- 1.Adelson-Velskii, G.M., Landis, E.M.: An Algorithm for the Organization of the Information. Dokl. Akad. Nauk SSSR 146 (1962) 263–266Google Scholar
- 2.Brown, M.R., Tarjan, R.E.: A Fast Merging Algorithm. J. ACM 26 (2) (1979) 211–226Google Scholar
- 3.Gargantini, I.: An Effective Way to Represent Quadtrees. Communication of the ACM 25 (12) (1982) 905–910Google Scholar
- 4.Gaibisso, C., Gambosi, G., Talamo, M.: A Partially Persistent Data Structure for the Set-Union Problem. Theoretical Informatics and Applications 24 (2) (1990) 189–202Google Scholar
- 5.Guibas, L.J., Sedgewick, R.: A Dichromatic Framework for Balanced Trees Proc. of the 10th Symp. on Foundations of Computer Science. Washington, DC, (1978) 8–21Google Scholar
- 6.Knuth, D.E.: The Art of Computer Programming, Volume 3: Sorting and Searching. Addison-Wesley, Reading, MA, (1973)Google Scholar
- 7.Samet, H.: The Quadtree and Related Hierarchical Data Structures. Computing Surveys 16 (2) (1984) 187–260Google Scholar
- 8.Tarjan, R.E.: Reference Machines Require Non-Linear Time to Maintain Disjoint Sets. Proc. of the 9th ACM Symp. on Theory of Computing, Boulder, Colorado (1977) 19–29Google Scholar