Abstract
We design a variation of skip lists that performs well for generally biased access sequences. Given n items, each with a positive weight w i, 1≤ i ≤ n, the time to access item i is O (1 + log W/w i), where W = Σi=1n w i; the data structure is dynamic. We present deterministic and randomized variations, which are nearly identical; the deterministic one simply ensures the balance condition that the randomized one achieves probabilistically. We use the same method to analyze both.
Supported by DARPA Grant F30602-00-2-0509 and NSF Grant CCR-0098068.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
N. Abramson. Information Theory and Coding. McGraw-Hill, New York, 1963.
G. M. Adel’son-Vel’skii and Y. M. Landis. An algorithm for the organisation of information. Dokl. Akad. Nauk SSSR, 146:263–266, 1962. English translation in Soviet Math. Dokl. 3:1259-62, 1962.
J. Bell and G. Gupta. Evaluation of self-adjusting binary search tree techniques. Soft. Prac. Exp., 23(4):369–382, 1993.
S. W. Bent, D. D. Sleator, and R. E. Tarjan. Biased search trees. SIAM J. Comp., 14(3):545–568, 1985.
Y.-J. Chiang and R. Tamassia. Dynamization of the trapezoid method for planar point location in monotone subdivisions. Int’l. J. Comp. Geom. Appl., 2(3):311–333, 1992.
E. Cohen and H. Kaplan. Proactive caching of DNS records: Addressing a performance bottleneck. In Proc. SAINT’ 01, pages 85–92. IEEE, 2001.
F. Ergun, S. C. Sahinalp, J. Sharp, and R. K. Sinha. Biased dictionaries with fast inserts/deletes. In Proc. 33rd ACM STOC, pages 483–491, 2001.
F. Ergun, S. C. Sahinalp, J. Sharp, and R. K. Sinha. Biased skip lists for highly skewed access patterns. In Proc. 3rd ALENEX, volume 2153 of LNCS, pages 216–229. Springer, 2001.
J. Feigenbaum and R. E. Tarjan. Two new kinds of biased search trees. BSTJ, 62(10):3139–3158, 1983.
M. T. Goodrich and R. Tamassia. Dynamic ray shooting and shortest paths in planar subdivisions via balanced geodesic triangulations. J. Alg., 23:51–73, 1997.
S. D. Gribble and E. A. Brewer. System design issues for internet middleware services: Deductions from a large client trace. In Proc. 1st USENIX Symp. on Internet Tech. and Syst., 1997.
L. J. Guibas and R. Sedgewick. A dichromatic framework for balanced trees. In Proc. 19th IEEE FOCS, pages 8–21, 1978.
S. Huddleston and K. Mehlhorn. A new data structure for representing sorted lists. Acta Inf., 17:157–184, 1982.
D. E. Knuth. Optimum binary search trees. Acta Inf., 1:14–25, 1971.
D. E. Knuth. The Art of Computer Programming, volume 3: Sorting and Searching. Addison-Wesley, 1973.
K. Mehlhorn and S. Näher. Algorithm design and software libraries: Recent developments in the LEDA project. In Proc. IFIP’ 92, volume 1, pages 493–505. Elsevier, 1992.
J. I. Munro, T. Papadakis, and R. Sedgewick. Deterministic skip lists. In Proc. 3rd ACM-SIAM SODA, pages 367–375, 1992.
W. Pugh. Skip lists: A probabilistic alternative to balanced trees. C. ACM, 33(6):668–676, June 1990.
R. Seidel and C. R. Aragon. Randomized search trees. Algorithmica, 16(4/5):464–497, 1996.
D. D. Sleator and R. E. Tarjan. A data structure for dynamic trees. JCSS, 26(3):362–391, 1983.
D. D. Sleator and R. E. Tarjan. Self-adjusting binary search trees. J. ACM, 32(3):652–686, 1985.
W. Stallings. Operating Systems: Internals and Design Principles. Prentice-Hall, 4th edition, 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bagchi, A., Buchsbaum, A.L., Goodrich, M.T. (2002). Biased Skip Lists. In: Bose, P., Morin, P. (eds) Algorithms and Computation. ISAAC 2002. Lecture Notes in Computer Science, vol 2518. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36136-7_1
Download citation
DOI: https://doi.org/10.1007/3-540-36136-7_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00142-3
Online ISBN: 978-3-540-36136-7
eBook Packages: Springer Book Archive