Search data structures for skewed strings

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

Volumn 2647, Issue , 2003, Pages 81-96

  Crescenzi, Pilu ^a   Grossi, Roberto ^b   Italiano, Giuseppe F ^c  

^a UNIVERSITY OF FLORENCE   (Italy)

^b UNIVERSITY OF PISA   (Italy)

^c UNIVERSITY OF ROME TOR VERGATA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA STRUCTURES;

HIERARCHICAL ORDER; IP ADDRESSS; LINKED DATA STRUCTURES; SKEWED DISTRIBUTION; XML PATH;

DATA HANDLING;

EID: 35248855512     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44867-5_7     Document Type: Article

References (36)

1. A. Acharya, H. Zhu, K. Shen. Adaptive algorithms for cache-efficient trie search. Proc. ALENEX 99. Source code in http://www.cs.rochester.edu/∼kshen, 1999.
2. G. M. Adel'son-Vel'skii and E. M. Landis. An algorithm for the organization of information. Soviet Mathematics Doklady, 3 (1962), 1259-1263.
3. Arianna Search Engine, http://arianna.libero.it.
4. R. Bayer. Symmetric binary B-trees: Data structure and maintenance algorithms. Acta Informatica 1 (1972), 290-306.
5. J. L. Bentley and R. Sedgewick. Fast algorithms for sorting and searching strings. SODA 1997, 360-369 (http://www.cs.princeton.edu/∼rs/strings).
6. S. W. Bent, D. D. Sleator and R. E. Tarjan. Biased search trees. SIAM Journal on Computing 14 (1985), 545-568.
7. F. Bonchi, F. Giannotti, C. Gozzi, G. Manco, M. Nanni, D. Pedreschi, C. Renso and S. Ruggieri, Web log data warehousing and mining for intelligent web caching. Data and Knowledge Engineering, to appear.
8. H. A. Clampett. Randomized binary searching with the tree structures. Communications of the ACM 7 (1964), 163-165.
9. J. Clément, Ph. Flajolet and B. Vallée. The analysis of hybrid trie structures. SODA 1999.
10. J. Feigenbaum and R. E. Tarjan. Two new kinds of biased search trees. Bell Systems Technical Journal 62 (1983), 3139-3158.
11. T. F. Gonzalez. The on-line d-dimensional dictionary problem. SODA 1992, 376-385.
12. R. Grossi, G. F. Italiano. Efficient techniques for maintaining multidimensional keys in linked data structures. ICALP 1999, 372-381.
13. R. H. Gueting and H.-P. Kriegel. Multidimensional B-tree: An efficient dynamic file structure for exact match queries. 10th GI Annual Conference, 375-388.
14. L. J. Guibas and R. Sedgewick. A dichromatic framework for balanced trees. FOCS 1978, 8-21.
15. D. Gusfield, Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology, Cambridge University Press, 1997.
16. S. Huddleston and K. Mehlhorn. A new data structure for representing sorted lists. Acta Informatica 17 (1982), 157-184.
17. D. E. Knuth. The Art of computer programming, Vol. 3 : Sorting and Searching. Second edition, Addison-Wesley, 1973, 1998.
18. R. Jenkins, http://burtleburtle.net/bob/hash/.
19. K. Mehlhorn. Dynamic binary search. SIAM J. on Computing 8 (1979), 175-198.
20. K. Mehlhorn. Data structures and algorithms:Searching and sorting, Springer 1984.
21. D. R. Morrison. PATRICIA - Practical Algorithm To Retrieve Information Coded In Alphanumeric. J. ACM, 15, 514-534,1968.
22. J. Nievergelt and E. M. Reingold. Binary search trees of bounded balance. SIAM Journal on Computing 2 (1973), 33-43.
23. J. M. Ockerbloom. The on-line books page. http://digital.library.upenn.edu/books/
24. W. Pugh. Skip Lists: A probabilistic alternative to balanced trees. Communications of the ACM 33 (1990), 668-676.
25. W. Pugh. Skip Lists ftp directory. ftp://ftp.cs.umd.edu/pub/skipLists/.
26. R. Sedgewick. Algorithms in C, Addison-Wesley, 1998.
27. R. Seidel and C. R. Aragon. Randomized search trees. Algorithmica 16 (1996), 464-497.
28. C. Silverstein. Library call data set. http://theory.stanford.edu/∼csilvers/libdata.
29. C. Silverstein. A practical perfect hash algorithm. Manuscript, 1998.
30. D. D. Sleator and R. E. Tarjan. Self-adjusting binary search trees. Journal of the ACM 32 (1985), 652-686.
31. W. Szpankowski, Average Case Analysis of Algorithms on Sequences, Wiley, 2001.
32. R. E. Tarjan. Data structures and network algorithms, SIAM (1983).
33. V. K. Vaishnavi. Multidimensional height-balanced trees. IEEE Transactions on Computers C-33 (1984), 334-343.
34. V. K. Vaishnavi. Multidimensional balanced binary trees. IEEE Transactions on Computers C-38 (1989), 968-985.
35. V. K. Vaishnavi. On k-dimensional balanced binary trees. Journal of Computer and System Sciences 52 (1996), 328-348.
36. ∼weiss/dsaa_c2e/files.html.