Static optimality theorem for external memory string access

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2002, Pages 219-227

  Ciriani, Valentina ^a   Ferragina, Paolo ^a   Luccio, Fabrizio ^a   Muthukrishnan, S ^b  

^a UNIVERSITY OF PISA   (Italy)

^b AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA HANDLING; DATA STRUCTURES; DATA WAREHOUSES; MAGNETIC DISK STORAGE; THEOREM PROVING; XML;

EXTERNAL MEMORY STRING ACCESS; STATIC OPTIMALITY THEOREM;

STORAGE ALLOCATION (COMPUTER);

EID: 0036954506     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. A. Aboulnaga, A. R. Alameldeen, and J. F. Naughton. Estimating the selectivity of xml path expressions for internet scale applications. In International Conference on Very Large Data Bases, pages 591-600, 2001.
2. N. Abramson. Information Theory and Coding. McGraw Hill, 1983.
3. A. Ailamaki, D. J. DeWitt, M. D. Hill, and D. A. Wood. DBMSs on a modern processor: Where does time go? The VLDB Journal, pages 266-277, 1999.
4. P. B. Callahan, M. T. Goodrich, and K. Ramaiyer. Topology B-trees and their applications. In Workshop on Algorithms and Data Structures, volume 955 of Lecture Notes in Computer Science, pages 381-392, 1995.
5. B. Chazelle and L. J. Guibas. Fractional cascading: I. A data structuring technique. Algorithmica, 1(2):133-162, 1986.
6. V. Ciriani, P. Ferragina, F. Luccio, and S. Muthukrishnan. Self-adjusting data structures for external-memory string access. Technical Report TR-01-26, Dipartimento di Informatica, University of Pisa, Italy, November 2001.
7. B. Cooper, N. Sample, M. J. Franklin, G. R. Hjaltason, and M. Shadmon. A fast index for semistructured data. The VLDB Journal, pages 341-350, 2001.
8. F. Ergu, S. C. Sahinalp, J. Sharp, and R. K. Sinha. Biased dictionaries with fast insert/deletes. In ACM Symposium on Theory of Computing, pages 483-491, 2001.
9. D. E. Ferguson. Bit-Tree: a data structure for fast file processing. Communications of the ACM, 35(6):114-120, June 1992.
10. P. Ferragina and R. Grossi. The string B-tree: a new data structure for string search in external memory and its applications. Journal of the ACM, 46(2):236-280, Mar. 1999.
11. K. Mehlhorn. Data Structures and Algorithms 1: Searching and Sorting, volume 1 of EATCS Monographs on Theoretical Computer Science. Springer-Verlag, Berlin, Germany, 1984.
12. K. Mehlhorn and S. Naher. Algorithm design and software libraries: Recent developments in the leda project. In IFIP Congress, volume 1, pages 493-505, 1992.
13. K. Mulmuley. Computational Geometry: An Introduction through Randomized Algorithms. Prentice-Hall, Englewood Cliffs, NJ, 1994.
14. W. Pugh. Skip Lists: A Probabilistic Alternative to Balanced Trees. Communications of the ACM, 33(6):668-676, 1990.
15. M. Sherk. Self-adjusting k-ary search trees. Journal of Algorithms, 19(1):25-44, July 1995.
16. D. D. Sleator and R. E. Tarjan. Self-adjusting binary search trees. Journal of the ACM, 32(3):652-686, July 1985.
17. The World Wide Web Consortium. Xml web page. http://www.w3.org/XML/.
18. J. S. Vitter. External memory algorithms and data structures: Dealing with massive data. ACM Computing Surveys, 33(2):209-271, 2001.