Rank-sensitive data structures

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

Volumn 3772 LNCS, Issue , 2005, Pages 79-90

  Bialynicka Birula, Iwona ^a   Grossi, Roberte ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

DATA PROCESSING; ONLINE SYSTEMS; PARAMETER ESTIMATION; PROBLEM SOLVING; QUERY LANGUAGES;

ON-LINE QUERY; RANK-SENSITIVE DATA STRUCTURES; RANK-SENSITIVITY;

DATA STRUCTURES;

EID: 33646745345     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11575832_10     Document Type: Conference Paper

References (31)

1. M. Ajtai, M. Fredman, and J. Komlòs. Hash functions for priority queues. Information and Control, 63(3):217-225, December 1984.
2. Lars Arge and Jeffrey S. Vitter. Optimal external memory interval management. SIAM Journal on Computing, 32:1488-1508, 2003.
3. Ricardo A. Baeza-Yates and Berthier Ribeiro-Neto. Modern Information Retrieval. Addison-Wesley Longman Publishing Co., Inc., 1999.
4. Bernard Chazelle. A functional approach to data structures and its use in multidimensional searching. SIAM Journal on Computing, 17(3):427-462, June 1988.
5. Mark de Berg, Marc van Kreveld, Mark Overmars, and Otfried Schwartzkopf. Computational Geometry: Algorithms and Applications. Springer, 1997.
6. James R. Driscoll, Neil Sarnak, Daniel D. Sleator, and Robert E. Tarjan. Making data structures persistent. J. Computer and System Sciences, 38(1):86-124, 1989.
7. P. Ferragina and R. Grossi. The string B-tree: A new data structure for string search in external memory and its applications. J. ACM, 46:236-280, 1999.
8. Amos Fiat and Haim Kaplan. Making data structures confluently persistent. J. Algorithms, 48(1):16-58, 2003.
9. Faith E. Fich. Class notes CSC 2429F: Dynamic data structures, 2003. Department of Computer Science, University of Toronto, Canada.
10. Greg N. Frederickson. An optimal algorithm for selection in a min-heap. Inf. Comput., 104(2): 197-214, 1993, June.
11. Michael L. Fredman and Dan E. Willard. Trans-dichotomous algorithms for minimum spanning trees and shortest paths. JCSS, 48(3):533-551, 1994.
12. Harold N. Gabow, Jon Louis Bentley, and Robert E. Tar Jan. Scaling and related techniques for geometry problems. In STOC '84, 135-143, Washington, D.C., 1984.
13. Dan Gusfield. Algorithms on strings, trees, and sequences: computer science and computational biology. Cambridge University Press, 1997.
14. D. Hearn and M. Baker. Computer Graphics with OpenGL. Prentice-Hall, 2003.
15. Haim Kaplan, Eyal Molad, and Robert E. Tar Jan. Dynamic rectangular intersection with priorities. In STOC '03, 639-648. ACM Press, 2003.
16. Kitsios, Makris, Sioutas, Tsakalidis, Tsaknakis, and Vassiliadis. 2-D spatial indexing scheme in optimal time. In ADBIS: East European Symposium on Advances in Databases and Information Systems. LNCS, 2000.
17. Jon M. Kleinberg. Authoritative sources in a hyperlinked environment. Journal of the ACM, 46(5):604-632, September 1999.
18. R. Lempel and S. Moran. SALSA: the stochastic approach for link-structure analysis. ACM Transactions on Information Systems, 19(2):131-160, 2001.
19. Edward M. McCreight. Priority search trees. SIAM Journal on Computing, 14(2):257-276, 1985.
20. C. W. Mortensen. Fully-dynamic two dimensional orthogonal range and line segment intersection reporting in logarithmic time. In SODA '03, 618-627, 2003.
21. S. Muthukrishnan. Efficient algorithms for document retrieval problems. In SODA '02: Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms, pages 657-666. Society for Industrial and Applied Mathematics, 2002.
22. Wendy Myrvold and Frank Ruskey. Ranking and unranking permutations in linear time. Information Processing Letters, 79(6):281-284, September 2001.
23. Mark H. Overmars. The Design of Dynamic Data Structures, volume 156 of Lecture Notes in Computer Science. Springer-Verlag, 1983.
24. L. Page, S. Brin, R. Motwani, and T. Winograd. The pagerank citation ranking: Bringing order to the web. Tech. rep, Stanford University, Stanford, CA, 1998.
25. Rajeev Roman. Eliminating amortization: on data structures with guaranteed response time. PhD thesis, Rochester, NY, USA, 1993.
26. o implementations of fusion trees and atomic heaps. In Proceedings of the fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03), pages 699-707, New York, January 12-14 2003. ACM Press.
27. E. Ukkonen. On-line construction of suffix trees. Algorithmica, 14:249-260, 1995.
28. Jeffrey Scott Vitter. External memory algorithms and data structures: dealing with massive data. ACM Computing Surveys, 33(2):209-271, June 2001.
29. Jean Vuillemin. A unifying look at data structures. Communications of the ACM, 23(4):229-239, April 1980.
30. P. Weiner. Linear pattern matching algorithms. In Conference Record, IEEE 14th Annual Symposium on Switching and Automata Theory, pages 1-11, 1973.
31. Ian H. Witten, Alistair Moffat, and Timothy C. Bell. Managing gigabytes: Compressing and indexing documents and images. Morgan Kaufmann Pubs. Inc., 1999.