Efficient index for retrieving top-k most frequent documents

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

Volumn 5721 LNCS, Issue , 2009, Pages 182-193

  Hon, Wing Kai ^a   Shah, Rahul ^b   Wu, Shih Bin ^a  

^a NATIONAL TSING HUA UNIVERSITY   (Taiwan)

^b Louisiana State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ANSWERING QUERIES; BUILDING BLOCKES; COLLECTION OF DOCUMENTS; DOCUMENT RETRIEVAL; FREQUENCY THRESHOLD; INPUT PATTERNS; NATURAL EXTENSION; SUFFIX-TREES; TOTAL LENGTH;

INFORMATION SERVICES; SEARCH ENGINES; TOWERS;

INFORMATION RETRIEVAL;

EID: 70350637480     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-03784-9_18     Document Type: Conference Paper

References (14)

1. Bialynicka-Birula, I., Grossi, R.: Rank-Sensitive Data Structures. In: Consens, M.P., Navarro, G. (eds.) SPIRE 2005. LNCS, vol. 3772, pp. 79-90. Springer, Heidelberg (2005)
2. Boyer, R.S., Moore, J.S.: A Fast String Searching Algorithm. Communications of the ACM 20(10), 762-772 (1977)
3. Hon, W.K., Shah, R., Vitter, J.S.: Ordered Pattern Matching: Towards Full-Text Retrieval. Technical Report TR-06-008, Department of CS, Purdue University (2006)
4. Karp, R.M., Rabin, M.O.: Efficient Randomized Pattern-Matching Algorithms. Technical Report TR-31-81, Aiken Computational Laboratory, Harvard University (1981)
5. Knuth, D.E., Morris, J.H., Pratt, V.B.: Fast Pattern Matching in Strings. SIAM Journal on Computing 6(2), 323-350 (1977)
6. Mäkinen, V., Navarro, G.: Position-Restricted Substring Searching. In: Correa, J.R., Hevia, A., Kiwi, M. (eds.) LATIN 2006. LNCS, vol. 3887, pp. 703-714. Springer, Heidelberg (2006)
7. 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)
8. McCreight, E.M.: A Space-economical Suffix Tree Construction Algorithm. Journal of the ACM 23(2), 262-272 (1976)
9. Muthukrishnan, S.: Efficient Algorithms for Document Retrieval Problems. In: Proceedings of Symposium on Discrete Algorithms, pp. 657-666 (2002)
10. Sadakane, K.: Succinct representations of lcp information and improvements in the compressed suffix arrays. In: Proceedings of Symposium on Discrete Algorithms, pp. 225-232 (2002)
11. 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)
12. Weiner, P.: Linear Pattern Matching Algorithms. In: Proceedings of Symposium on Switching and Automata Theory, pp. 1-11 (1973)
13. Willard, D.E.: Log-Logarithmic Worst-Case Range Queries are Possible in Space θ(N). Information Processing Letters 17(2), 81-84 (1983)
14. Witten, I., Moffat, A., Bell, T.: Managing Gigabytes: Compressing and Indexing Documents and Images. Morgan Kaufmann Publishers, Los Altos (1999)