Efficient index for retrieving top-k most frequent documents

Journal of Discrete Algorithms

Volumn 8, Issue 4, 2010, Pages 402-417

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

^a NATIONAL TSING HUA UNIVERSITY   (Taiwan)

^b Louisiana State University   (United States)

Author keywords

Document retrieval; Induced generalized suffix tree; Text indexing

Indexed keywords

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

INDEXING (OF INFORMATION); SEARCH ENGINES; TEXT PROCESSING;

INFORMATION RETRIEVAL;

EID: 78049348697     PISSN: 15708667     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jda.2010.08.003     Document Type: Article

References (22)

1. M.A. Bender, M. Farach-Colton, The LCA problem revisited, in: Proceedings of Latin American Symposium on Theoretical Informatics, 2000, pp. 88-94.
2. I. Bialynicka-Birula, R. Grossi, Rank-sensitive data structures, in: Proceedings of International Symposium on String Processing and Information Retrieval, 2005, pp. 79-90.
3. R.S. Boyer, and J.S. Moore A fast string searching algorithm Communications of the ACM 20 10 1977 762 772
4. T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein Introduction to Algorithms 2001 MIT Press
5. Human Mitochondria Genome Database, Department of Genetics and Pathology, Uppsala University, Sweden http://www.genpat.uu.se/mtDB
6. eMule, Wikipedia, the free encyclopedia (based on 28 July 2008 version) http://en.wikipedia.org/wiki/EMule
7. W.K. Hon, R. Shah, J.S. Vitter, Ordered pattern matching: Towards full-text retrieval, Technical Report TR-06-008, Department of CS, Purdue University, 2006.
8. L.C.K. Hui, Color set size problem with applications to string matching, in: Proceedings of Symposium on Combinatorial Pattern Matching, 1992, pp. 230-243.
9. R.M. Karp, M.O. Rabin, Efficient randomized pattern-matching algorithms, Technical Report TR-31-81, Aiken Computational Laboratory, Harvard University, 1981.
10. D.E. Knuth, J.H. Morris, and V.B. Pratt Fast pattern matching in strings SIAM Journal on Computing 6 2 1977 323 350
11. V. Makinen, G. Navarro, Position-restricted substring searching, in: Proceedings of Latin American Symposium on Theoretical Informatics, 2006, pp. 703-714.
12. Y. Matias, S. Muthukrishnan, S.C. Sahinalp, J. Ziv, Augmenting suffix trees, with applications, in: Proceedings of European Symposium on Algorithms, 1998, pp. 67-78.
13. E.M. McCreight A space-economical suffix tree construction algorithm Journal of the ACM 23 2 1976 262 272
14. S. Muthukrishnan, Efficient algorithms for document retrieval problems, in: Proceedings of Symposium on Discrete Algorithms, 2002, pp. 657-666.
15. K. Sadakane, Succinct representations of lcp information and improvements in the compressed suffix arrays, in: Proceedings of Symposium on Discrete Algorithms, 2002, pp. 225-232.
16. K. Sadakane, Compressed suffix trees with full functionality, in: Theory of Computing Systems, 2007, pp. 589-607.
17. SourceForge, SourceForget.net: Open Source Software http://sourceforge. net
18. N. Valimaki, V. Makinen, Space-efficient algorithms for document retrieval, in: Proceedings of Symposium on Combinatorial Pattern Matching, 2007, pp. 205-215.
19. P. Weiner, Linear pattern matching algorithms, in: Proceedings of Symposium on Switching and Automata Theory, 1973, pp. 1-11.
20. E.W. Weisstein Zipf's law http://mathworld.wolfram.com/ZipfsLaw.html
21. D.E. Willard Log-logarithmic worst-case range queries are possible in space Θ (N ) Information Processing Letters 17 2 1983 81 84
22. I. Witten, A. Moffat, and T. Bell Managing Gigabytes: Compressing and Indexing Documents and Images 1999 Morgan Kaufmann Publishers Los Altos, CA, USA