Top-K color queries for document retrieval

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2011, Pages 401-411

  Karpinski, Marek ^a   Nekrich, Yakov ^a  

^a UNIVERSITY OF BONN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; INFORMATION RETRIEVAL; STRUCTURAL OPTIMIZATION;

ASYMPTOTICALLY OPTIMAL; DOCUMENT RETRIEVAL; OPTIMAL TIME; QUERY TIME; REVERSE ORDER;

COLOR;

EID: 79955713219     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973082.32     Document Type: Conference Paper

References (20)

1. P. K. Agarwal, S. Govindarajan, S. Muthukrishnan Range Searching in Categorical Data: Colored Range Searching on Grid, Proc. 10th ESA 2002, 17-28.
2. A. Aggarwal, J. S. Vitter, The Input/Output Complexity of Sorting and Related Problems, Communications of the ACM 31(9), 1116-1127 (1988). (Pubitemid 18662481)
3. S. Alstrup, G. S. Brodal, T. Rauhe, New Data Structures for Orthogonal Range Searching, Proc. 41st IEEE FOCS 2000, 198-207. (Pubitemid 32075891)
4. I. Bialynicka-Birula and R. Grossi, Rank-Sensitive Data Structures, Proc. 14th SPIRE 2007, 79-90.
5. G. S. Brodal, R. Fagerberg, M. Greve, A. Lopez-Ortiz, Online Sorted Range Reporting, Proc. 20th ISAAC 2009, 173-182.
6. B. Chazelle, A Functional Approach to Data Structures and its Use in Multidimensional Searching, SI AM J. on Computing 17, 427-462 (1988).
7. M. L. Fredman, D. E. Willard, Trans-Dichotomous Algorithms for Minimum Spanning Trees and Shortest Paths, J. Comput. Syst. Sci. 48(3), 533-551 (1994). (Pubitemid 124013302)
8. T. Gagie, S. J. Puglisi, A. Turpin, Range Quantile Queries: Another Virtue of Wavelet Trees, Proc. 16th SPIRE 2009, 1-6.
9. R. Grossi, A. Gupta, and J. S. Vitter, High-order Entropy-Compressed Text Indexes, Proc. 14th ACM- SIAM SODA 2003, 841-850.
10. P. Gupta, R. Janardan, M. H. M. Smid, Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization, J. Algorithms 19(2), 282-317 (1995).
11. W.-K. Hon, R. Shah, J. S. Vitter, Space-Efficient Framework for Top-k String Retrieval Problems, Proc. 50th IEEE FOCS 2009, 713-722.
12. R. Janardan, M. A. Lopez, Generalized Intersection Searching Problems, Int. J. of Computational Geometry and Applications 3(1), 39-69 (1993).
13. J. Kleinberg, Authoritative Sources in a Hyperlinked Environment, Journal of the ACM, 46(5), 604-632 (1999).
14. Y. Matias, S. Muthukrishnan, S. C. Sahinalp, and J. Ziv, Augmenting Suffix Trees, with Applications, Proc. 6th ESA 1998, 67-78. (Pubitemid 128117044)
15. S. Muthukrishnan, Efficient Algorithms for Document Retrieval Problems, Proc. 13th ACM-SIAM SODA 2002, 657-666.
16. Y. Nekrich, External Memory Range Reporting on a Grid, Proc. 18th ISAAC 2007, 525-535.
17. L. Page, S. Brin, R. Motwani, and T. Winograd, The PageRank Citation Ranking: Bringing Order to the Web, Stanford InfoLab, Technical Report 1999-66, November 1999.
18. K. Sadakane, Succinct Data Structures for Flexible Text Retrieval Systems, Journal of Discrete Algorithms, 5(1), 12-22 (2007). (Pubitemid 46486644)
19. M. Thorup, Undirected Single-Source Shortest Paths with Positive Integer Weights in Linear Time, J. ACM 46(3), 362-394 (1999).
20. N. Välimäki and V. Mäkinen, Space-Efficient Algorithms for Document Retrieval, Proc. 18th CPM 2007, 205-215.