Colored range queries and document retrieval

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

Volumn 6393 LNCS, Issue , 2010, Pages 67-81

  Gagie, Travis ^a   Navarro, Gonzalo ^a   Puglisi, Simon J ^b  

^a Univt of Chile ^*  (Chile)

^b RMIT UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

DATABASE RESEARCH; DOCUMENT RETRIEVAL; EFFICIENT DATA STRUCTURES; HIGH-ORDER; LOGARITHMIC TIME; RANGE QUERY; RANGE TOP-K QUERY; TIME AND SPACE; TOP-K QUERY; WAVELET TREE; COMPRESSED DATA STRUCTURES; SPACE BOUNDS;

COMPUTATIONAL GEOMETRY; DATA STRUCTURES; QUERY LANGUAGES; TOWERS; ONE DIMENSIONAL;

INFORMATION RETRIEVAL;

EID: 78449285316     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-16321-0_7     Document Type: Conference Paper

References (39)

1. Apostolico, A.: The myriad virtues of subword trees. In: Combinatorial Algorithms on Words. NATO ISI Series, pp. 85-96. Springer, Heidelberg (1985)
2. Baeza-Yates, R.: Applications of web query mining. In: Losada, D.E., Fernández-Luna, J.M. (eds.) ECIR 2005. LNCS, vol. 3408, pp. 7-22. Springer, Heidelberg (2005)
3. Baeza-Yates, R., Ribeiro, B.: Modern Information Retrieval. AW (1999)
4. Barbay, J., Gagie, T., Navarro, G., Nekrich, Y.: Alphabet partitioning for compressed rank/select with applications. Technical Report 0911.4981, arXiv (2010)
5. Bille, P., Landau, G.M., Weimann, O.: Random access to grammar compressed strings. Technical Report 1001.1565, arXiv (2010)
6. Bozanis, P., Kitsios, N., Makris, C., Tsakalidis, A.K.: New upper bounds for generalized intersection searching problems. In: Fülöp, Z., Gecseg, F. (eds.) ICALP 1995. LNCS, vol. 944, pp. 464-474. Springer, Heidelberg (1995)
7. Brodal, G.S., Gfeller, B., Jørgensen, A.G., Sanders, P.: Towards optimal range medians. Theoretical Computer Science (to appear)
8. Carlsson, S., Munro, J.I., Poblete, P.V.: An implicit binomial queue with constant insertion time. In: Karlsson, R., Lingas, A. (eds.) SWAT 1988. LNCS, vol. 318, pp. 1-13. Springer, Heidelberg (1988)
9. Culpepper, J.S., Navarro, G., Puglisi, S.J., Turpin, A.: Top-k ranked document search in general text databases. In: Proc. ESA (2010) (to appear)
10. Ferragina, P., Manzini, G., Mäkinen, V., Navarro, G.: Compressed representations of sequences and full-text indexes. ACM Transactions on Algorithms (TALG), 3(2), article 20 (2007)
11. Ferragina, P., Venturini, R.: A simple storage scheme for strings achieving entropy bounds. Theoretical Computer Science 371(1), 115-121 (2007)
12. Fischer, J.: Optimal succinctness for range minimum queries. In: Proc. LATIN, pp. 158-169 (2010)
13. Fischer, J., Heun, V.: A new succinct representation of RMQ-information and improvements in the enhanced suffix array. In: Chen, B., Paterson, M., Zhang, G. (eds.) ESCAPE 2007. LNCS, vol. 4614, pp. 459-470. Springer, Heidelberg (2007)
14. Gabow, H.N., Bentely, J.L., Tarjan, R.E.: Scaling and related techniques for geometry problems. In: Proc. STOC, pp. 135-143 (1984)
15. Gagie, T., Puglisi, S.J., Turpin, A.: Range quantile queries: Another virtue of wavelet trees. In: Karlgren, J., Tarhio, J., Hyyrö, H. (eds.) SPIRE 2009. LNCS, vol. 5721, pp. 1-6. Springer, Heidelberg (2009)
16. González, R., Navarro, G.: Compressed text indexes with fast locate. In: Ma, B., Zhang, K. (eds.) CPM 2007. LNCS, vol. 4580, pp. 216-227. Springer, Heidelberg (2007)
17. Greve, M., Jørgensen, A.G., Larsen, K.D., Truelsen, J.: Cell probe lower bounds and approximations for range mode. In: Gavoille, C. (ed.) ICALP 2010, Part I. LNCS, vol. 6198, pp. 605-616. Springer, Heidelberg (2010)
18. Grossi, R., Gupta, A., Vitter, J.S.: High-order entropy-compressed text indexes. In: Proc. SODA, pp. 636-645 (2003)
19. Grossi, R., Orlandi, A., Raman, R.: Optimal trade-offs for succinct string indexes. In: Proc. ICALP, pp. 678-689 (2010)
20. Hon, W.-K., Shah, R., Vitter, J.: Space-efficient framework for top-k string retrieval problems. In: Proc. FOCS, pp. 713-722 (2009)
21. Hon, W.-K., Shah, R., Wu, S.-B.: Efficient index for retrieving top-k most frequent documents. In: Karlgren, J., Tarhio, J., Hyyrö, H. (eds.) SPIRE 2009. LNCS, vol. 5721, pp. 182-193. Springer, Heidelberg (2009)
22. Ilyas, I.F., Beskales, G., Soliman, M.A.: A survey of top-K query processing techniques in relational database systems. ACM Computing Surveys 40(4) (2008)
23. Janardan, R., Lopez, M.A.: Generalized intersection searching problems. International Journal of Computational Geometry and Applications 3(1), 39-69 (1993)
24. Karpinski, M., Nekrich, Y.: Top-K color queries for document retrieval. Technical Report 1007.1361, arXiv (2010)
25. Mäkinen, V., Navarro, G.: Succinct suffix arrays based on run-length encoding. Nordic Journal of Computing 12(1), 40-66 (2005)
26. Mäkinen, V., Navarro, G.: Rank and select revisited and extended. Theoretical Computer Science 387(3), 332-347 (2007)
27. Manber, U., Myers, G.: Suffix arrays: a new method for on-line string searches. SIAM Journal on Computing 22(5), 935-948 (1993)
28. Manzini, G.: An analysis of the Burrows-Wheeler transform. Journal of the ACM 48(3), 407-430 (2001)
29. Matias, Y., Muthukrishnan, S., Sahinalp, S.C., Ziv, J.: Augmenting suffix trees, with applications. In: Bilardi, G., Pietracaprina, A., Italiano, G.F., Pucci, G. (eds.) ESA 1998. LNCS, vol. 1461, pp. 67-78. Springer, Heidelberg (1998)
30. Milidiú, R.L., Laber, E.S.: Bounding the inefficiency of length-restricted prefix codes. Algorithmica 31(4), 513-529 (2001)
31. Muthukrishnan, S.: Efficient algorithms for document retrieval problems. In: Proc. SODA, pp. 657-666 (2002)
32. Navarro, G., Mäkinen, V.: Compressed full-text indexes. ACM Computing Surveys, 39(1), article 2 (2007)
33. Raman, R., Raman, V., Rao, S.: Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. In: Proc. SODA, pp. 233-242 (2002)
34. Sadakane, K.: New text indexing functionalities of the compressed suffix arrays. Journal of Algorithms 48(2), 294-313 (2003)
35. Sadakane, K.: Succinct data structures for flexible text retrieval systems. Journal of Discrete Algorithms 5(1), 12-22 (2007)
36. Silvestri, F.: Sorting out the document identifier assignment problem. In: Amati, G., Carpineto, C., Romano, G. (eds.) ECiR 2007. LNCS, vol. 4425, pp. 101-112. Springer, Heidelberg (2007)
37. Välimäki, N., Mäkinen, V.: Space-efficient algorithms for document retrieval. In: Ma, B., Zhang, K. (eds.) CPM 2007. LNCS, vol. 4580, pp. 205-215. Springer, Heidelberg (2007)
38. Weiner, P.: Linear pattern matching algorithm. In: Proc. IEEE Symp. on Switching and Automata Theory, pp. 1-11 (1973)
39. Yan, H., Ding, S., Suel, T.: Inverted index compression and query processing with optimized document ordering. In: Proc. WWW, pp. 401-410 (2009)