Space-efficient data structures for top-κ completion

WWW 2013 - Proceedings of the 22nd International Conference on World Wide Web

Volumn , Issue , 2013, Pages 583-593

  Hsu, Bo June ^a   Ottaviano, Giuseppe ^b  

^a MICROSOFT RESEARCH   (United States)

^b UNIVERSITY OF PISA   (Italy)

Author keywords

Compression; Scored string sets; Top k completion; Tries

Indexed keywords

COMPACTION; ECONOMIC AND SOCIAL EFFECTS; LARGE DATASET; SEARCH ENGINES; WORLD WIDE WEB;

AUTO COMPLETION; LARGE-SCALE DATASETS; SCORED STRING SETS; SEARCH APPLICATION; SPACE EFFICIENT; STATIC RANKINGS; TRIE-BASED DATA STRUCTURES; TRIES;

DATA STRUCTURES;

EID: 84884308036     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2488388.2488440     Document Type: Conference Paper

References (38)

1. AOL search data. http://www.gregsadetsky.com/aol-data/, 2006.
2. D. Arroyuelo, R. Cánovas, G. Navarro, and K. Sadakane. Succinct trees in practice. In ALENEX, pages 84-97, 2010.
3. D. Benoit, E. D. Demaine, J. I. Munro, R. Raman, V. Raman, and S. S. Rao. Representing trees of higher degree. Algorithmica, 43(4):275-292, 2005.
4. I. Bialynicka-Birula and R. Grossi. Rank-sensitive data structures. In SPIRE, pages 79-90, 2005.
5. P. Boldi and S. Vigna. Codes for the World Wide Web. Internet Mathematics, 2(4):407-429, 2005.
6. N. R. Brisaboa, R. Cánovas, F. Claude, M. A. Martínez- Prieto, and G. Navarro. Compressed string dictionaries. In SEA, pages 136-147, 2011.
7. K. W. Church, B. Thiesson, and R. Ragno. K-best suffix arrays. In HLT-NAACL (Short Papers), pages 17-20, 2007.
8. D. R. Clark. Compact pat trees. PhD thesis, University of Waterloo, Waterloo, Ont., Canada, Canada, 1998. UMI Order No. GAXNQ-21335.
9. P. Davoodi, R. Raman, and S. R. Satti. Succinct representations of binary trees for range minimum queries. In COCOON, pages 396-407, 2012.
10. H. Duan and B.-J. P. Hsu. Online spelling correction for query completion. In WWW, pages 117-126, 2011.
11. P. Elias. Universal codeword sets and representations of the integers. IEEE Transactions on Information Theory, 21(2):194-203, Mar. 1975.
12. P. Ferragina and G. Manzini. Indexing compressed text. J. ACM, 52(4):552-581, 2005.
13. J. Fischer and V. Heun. Space-efficient preprocessing schemes for range minimum queries on static arrays. SIAM J. Comput., 40(2):465-492, 2011.
14. E. Fredkin. Trie memory. Commun. ACM, 3:490-499, September 1960.
15. J. Goldstein, R. Ramakrishnan, and U. Shaft. Compressing relations and indexes. In ICDE, pages 370-379, 1998.
16. J. Grieves. The secrets of the Windows Phone 8 keyboard. http://blogs.windows.com/windows-phone/b/windowsphone/archive/2012/12/06/ the-secrets-of-the-windows-phone-8-keyboard.aspx, December 2012.
17. R. Grossi and G. Ottaviano. Fast compressed tries through path decompositions. In ALENEX, pages 65-74, 2012.
18. R. Grossi and J. S. Vitter. Compressed suffix arrays and suffix trees with applications to text indexing and string matching. SIAM J. Comput., 35(2):378-407, 2005.
19. W.-K. Hon, R. Shah, and J. S. Vitter. Space-efficient framework for top-k string retrieval problems. In FOCS, pages 713-722, 2009.
20. G. Jacobson. Space-efficient static trees and graphs. In FOCS, pages 549-554, 1989.
21. D. E. Knuth. The Art of Computer Programming, Volume 3: Sorting and Searching. Addison-Wesley, Reading, USA, 2nd edition, 1998.
22. N. J. Larsson and A. Moffat. Offline dictionary-based compression. In Data Compression Conference, pages 296-305, 1999.
23. F. Li. Simpler search. http://blog.twitter.com/2012/07/simpler-search. html, July 2012.
24. G. Li, S. Ji, C. Li, and J. Feng. Efficient type-ahead search on relational data: a TASTIER approach. In SIGMOD, pages 695-706, 2009.
25. G. Li, J. Wang, C. Li, and J. Feng. Supporting efficient top-k queries in type-ahead search. In SIGIR, pages 355-364, 2012.
26. D. Matani. An O(k log n) algorithm for prefix based ranked autocomplete. http://www.dhruvbird.com/autocomplete.pdf, 2011. Preprint.
27. Microsoft Web N-gram Service. http://web-ngram.research.microsoft.com/.
28. J. I. Munro and V. Raman. Succinct representation of balanced parentheses and static trees. SIAM Journal on Computing, 31(3):762-776, June 2001.
29. S. Muthukrishnan. Efficient algorithms for document retrieval problems. In SODA, pages 657-666, 2002.
30. A. Nandi and H. V. Jagadish. Effective phrase prediction. In VLDB, pages 219-230, 2007.
31. D. Okanohara and K. Sadakane. Practical entropy-compressed rank/select dictionary. In ALENEX, 2007.
32. S. Russell and P. Norvig. Artificial Intelligence: A Modern Approach. Prentice Hall, Upper Saddle River, N.J., 3 edition, 2003.
33. K. Sadakane and G. Navarro. Fully-functional succinct trees. In SODA, pages 134-149, 2010.
34. Succinct library. http://github.com/ot/succinct.
35. D. Sullivan. How Google Instant's autocomplete suggestions work. http://searchengineland.com/how-google-instant-autocomplete-suggestions-work- 62592, April 2011.
36. R. Vernica and C. Li. Efficient top-k algorithms for fuzzy search in string collections. In KEYS, 2009.
37. S. Vigna. Broadword implementation of rank/select queries. In WEA, pages 154-168, 2008.
38. H. E. Williams and J. Zobel. Compressing integers for fast file access. Comput. J., 42(3):193-201, 1999.