Skip trees, an alternative data structure to skip lists in a concurrent approach

Theoretical Informatics and Applications

Volumn 31, Issue 3, 1997, Pages 251-269

  Messeguer, Xavier ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 6044261535     PISSN: 09883754     EISSN: 28047346     Source Type: Journal    
DOI: 10.1051/ita/1997310302511     Document Type: Article

References (28)

1. L. BOUGÉ, J. GABARRÓ and X. MESSEGUER, Concurrent AVL revisited: self-balancing distributed search trees, Technical Report LSI-95-54, LSI-UPC, 1995. Also appeared as Tech. Rep. RR95-45, LIP, ENS Lyon.
2. L. BOUGÉ, J. GABARRÓ and X. MESSEGUER, Concurrent AVL revisited: self-balancing distributed search trees, Technical Report LSI-95-54, LSI-UPC, 1995. Also appeared as Tech. Rep. RR95-45, LIP, ENS Lyon.
3. H. CHERNOFF, A measure of asymptotic efficiency for tests of hypothesis based on the sum of observations, Ann. Math. Statist., 1952, 23, pp. 493-507.
4. L. DEVROYE, A limit theory for random skip lists. The Annals of Applied Probability, 1992, 2(3), pp. 597-609.
5. G. DIEHR and B. FAALAND, Optimal pagination of B trees with variable-length items, Communications of the ACM, 1984, 27(3), pp. 241-247.
6. E. W. DIJKSTRA, L. LAMPORT, A. J. MARTIN, C. S. SCHOLTEN and E. F. M. STEFFENS, On-the fly garbage collection: an exercise in cooperation, Communications of the ACM, 1978, 21, pp. 966-965.
7. C. DOUGLAS, The ubiquitous B-tree, Computing Surveys, 1979, 11(2), pp. 121-137.
8. J. GABARRÓ, C. MARTÍNEZ and X. MESSEGUER, A design of a parallel dictionary using skip lists, Theoretical Computer Science, 1996, 158, pp. 1-33.
9. L. GUIBAS and R. SEDGEWICK, A dichromatic framework for balanced trees. In IEEE, editor, Proc. of 19th Symposium on Foundations of Computer Science, 1978, pp. 8-21.
10. L. HIGHAM and E. SCHENKS, Maintaining B-trees on a EREW PRAM, J. of Parallel and Dist. Comp., 1994, 22, pp. 329-335.
11. J. L. W. KESSELS, On-the-fly optimization of data structures, Comm. ACM, 1983, 26(11), pp. 895-901.
12. P. KIRSCHENHOFER and H. PRODINGER, The path length of random skip lists, Acta Informatica, 1994, to appear.
13. E. MCCREIGHT, Pagination of B* trees with variable length records, Communications of the ACM, 1977, 20, pp. 670-674.
14. O. NURMI and E. SOISALON-SOININEN, Chromatic binary search trees: A structure for concurrent rebalancing, Acta Informatica, 1995, 33(6), pp. 547-557. Also appeared in 10th ACM PODS, 1991.
15. O. NURMI and E. SOISALON-SOININEN, Chromatic binary search trees: A structure for concurrent rebalancing, Acta Informatica, 1995, 33(6), pp. 547-557. Also appeared in 10th ACM PODS, 1991.
16. O. NURMI, E. SOISALON-SOININEM and D. WOOD, Concurrency control in database structures with relaxed balance, In 6th ACM PODS, 1987, pp. 170-176.
17. O. NURMI, E. SOISALON-SOININEN and D. WOOD, Concurrent balancing and updating of avl trees, In 6th ACM PODS, 1987.
18. T. OTTMANN, H. Six and D. WOOD, On the correspondende between AVL trees and brother trees, Computing, 1979, 23(I), pp. 43-54.
19. T. PAPADAKIS, Skip Lists and Probabilistic Analysis of Algorithms, Ph.D. thesis, University of Waterloo, Available as Technical Report CS-93-28, 1993.
20. T. PAPADAKIS, J. I. MUNRO and P. V. POBLETE, Average search and update costs in skip lists. BIT, 1992, 32, pp. 316-332.
21. W. PAUL, VISHKIN and H. WAGENER, Parallel dictionaries on 2-3 trees. In J. DIAZ Ed., Proc. 10th International Colloquium on Automata, Programming and Languages, LNCS 154, Springer-Verlag, 1983, pp. 597-609. Also appeared as "Parallel computation on 2-3 trees", in RAIRO Informatique Théorique, 1983, pp. 397-404.
22. W. PAUL, VISHKIN and H. WAGENER, Parallel dictionaries on 2-3 trees. In J. DIAZ Ed., Proc. 10th International Colloquium on Automata, Programming and Languages, LNCS 154, Springer-Verlag, 1983, pp. 597-609. Also appeared as "Parallel computation on 2-3 trees", in RAIRO Informatique Théorique, 1983, pp. 397-404.
23. P. E. PFEIFFER, Probability for applications, Springer-Verlag, 1992.
24. W. PUGH, Concurrent maintenance of skip lists, Technique Report CS-TR-2222. 1, Institute for Advanced Computer Studies, Department of Computer Science. University of Maryland, College Park, MD, Apr 1989. Also published as UMIACS-TR-90-80.
25. W. PUGH, Skip lists: a probabilistic alternative to balanced trees, Communications of the ACM, 1990, 33(6), pp. 668-676.
26. R. SEIDEL and R. ARAGON, Randomized search trees, Algorithmica, 1996, 16(4/5), pp. 464-497. Appeared in Proc. of 30th Symposium on Foundations of Computer Science, 1989.
27. R. SEIDEL and R. ARAGON, Randomized search trees, Algorithmica, 1996, 16(4/5), pp. 464-497. Appeared in Proc. of 30th Symposium on Foundations of Computer Science, 1989.
28. S. SEN, Some observations on skip-lists, Information Processing Letters, 1991, 39(3), pp. 173-176.