Biased skip lists for highly skewed access patterns

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2153, Issue , 2001, Pages 216-229

  Ergun, Funda ^a   Cenk Sahinalp S ^a,b   Sharp, Jonathan ^a,b   Sinha, Rakesh K ^c  

^a Case Western Reserve University   (United States)

^b UNIVERSITY OF WARWICK   (United Kingdom)

^c LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY TREES;

ACCESS PATTERNS; BALANCED BINARY TREE; DYNAMIC TABLE; EXPECTED TIME; INSERTIONS AND DELETIONS; PACKET FILTERING; SKEWED ACCESS PATTERNS; SYNTHETIC DATA;

TREES (MATHEMATICS);

EID: 84947232876     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44808-x_18     Document Type: Conference Paper

References (21)

1. L. Breslau, P. Cao, L. Fan, G. Phillips, and S. Shenker. Web caching and zipf-like distributions: Evidence and implications. In Proc. IEEE Infocom, 1999.
2. S. Bent, D. Sleator, and R. Tarjan. Biased search trees. SIAM Journal of Computing, 14, 1985.
3. J. L. Bentley, D. S. Sleator, R. E. Tarjan, and V.K. Wei. A locally adaptive data compression scheme. Communication of the ACM, 29:320–330, 1986.
4. M. Burrows and D. Wheeler. A block-sorting lossless data compression algorithm. DEC SRC Research Report, 124, 1994.
5. K.C. Claffy, H.W. Braun, and G.C. Polyzos. A parameterizable methodology for internet traffic flow profiling. In IEEE Journal on Selected Areas in Communications, 1995.
6. G. Cheung and S. McCanne. Optimal routing table design for IP address lookups under memory constraints. In IEEE INFOCOM, 1999.
7. LBL-TCP-3 Trace Data. http://ita.ee.lbl.gov/html/contrib/lbl-tcp-3.html.
8. A. Dan and D. Towsley. An approximate analysis of the LRU and FIFO buffer replacement schemes. In Proc. ACM SIGMETRICS, 1990.
9. Jon Sharp Funda Ergun, Cenk Sahinalp and Rakesh Sinha. Rapid fire and hire at top ranks: Move to front with faster updates. Technical report, Case Western Reserve University, 2000.
10. D. E. Knuth. The Art of Computer Programming, volume 3 – 2nd ed. Addison-Wesley, 1997.
11. S. Lin and N. McKeown. A simulation study of IP switching. In Proc. ACM SIGCOMM, 1997.
12. Suvo Mittra and Anindya Basu. Packet classification: An argument for a working set model. Technical report, Bell Laboratories, 1999.
13. C. Martinez and S. Roura. Optimal and nearly optimal static weighted skip lists. Technical report, Universitat Politecnica de Catalunya, 1995.
14. E. O’Neil, P. O’Neil, and G. Weikum. The LRU-Kpage replacement algorithm for database disk buffering. In Proc. 1993 ACM-SIGMOD Conference on Management of Data, 1993.
15. G. Manzini P. Ferragina. Opportunistic data structures with applications. In Proc. IEEE Symposium on Foundations of Computer Science, 2000.
16. W. Pugh. Skip lists: A probabilistic alternative to balanced trees. In Communications of the ACM, 1990.
17. W. Pugh. Compressing java class files. In Proc. ACM Sigplan Conference on Programming Language Design and Implementation, 1999.
18. R. Seidel and C. Aragon. Randomized search trees. Algorithmica, 16, 1996.
19. D. Sleator and R. Tarjan. Self-adjusting binary search trees. Journal of the ACM, 32, 1985.
20. Andrew Tanenbaum. Operating Systems: Design and Implementation, 2nd edition. Prentice-Hall, 1997.
21. C. Leiserson, T. Cormen, R. Rivest. Introduction to Algorithms. McGraw Hill, 1990.