Score-safe term dependency processing with hybrid indexes

SIGIR 2014 - Proceedings of the 37th International ACM SIGIR Conference on Research and Development in Information Retrieval

Volumn , Issue , 2014, Pages 899-902

  Petri, Matthias ^a,b   Moffat, Alistair ^b   Culpepper, J Shane ^a  

^a RMIT UNIVERSITY   (Australia)

^b UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

Experimentation; Performance; Text compression; Text indexing

Indexed keywords

INDEXING (OF INFORMATION); INFORMATION RETRIEVAL;

DOCUMENT RETRIEVAL; EXPERIMENTATION; HYBRID APPROACH; PERFORMANCE; SEQUENTIAL DEPENDENCIES; TERM DEPENDENCY; TEXT COMPRESSIONS; TEXT-INDEXING;

INDEXING (MATERIALS WORKING);

EID: 84904536083     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2600428.2609469     Document Type: Conference Paper

References (20)

1. A. Z. Broder, D. Carmel, H. Herscovici, A. Soffer, and J. Zien. Efficient query evaluation using a two-level retrieval process. In Proc. CIKM, pages 426-434, 2003.
2. J. S. Culpepper, G. Navarro, S. J. Puglisi, and A. Turpin. Top-k ranked document search in general text databases. In Proc. ESA, pages 194- 205, 2010.
3. J. S. Culpepper, M. Petri, and F. Scholer. Efficient in-memory top-k document retrieval. In Proc. SIGIR, pages 225-234, 2012.
4. C. Dimopoulos, S. Nepomnyachiy, and T. Suel. Optimizing top-k document retrieval strategies for block-max indexes. In Proc. WSDM, pages 113-122, 2013.
5. S. Ding and T. Suel. Faster top-k retrieval using block-max indexes. In Proc. SIGIR, pages 993-1002, 2011.
6. P. Ferragina and G. Manzini. Indexing compressed text. J. ACM, 52 (4):552-581, 2005.
7. S. Gog, T. Beller, A. Moffat, and M. Petri. From theory to practice: Plug and play with succinct data structures. In Proc. SEA, 2014.
8. W.-K. Hon, R. Shah, and J. S. Vitter. Space-efficient framework for top-k string retrieval problems. In Proc. FOCS, pages 713-722, 2009.
9. S. Huston, J. S Culpepper, and W. B. Croft. Sketch-based indexing of n-words. In Proc. CIKM, pages 1864-1868, 2012.
10. R. Konow and G. Navarro. Faster compact top-k document retrieval. In Proc. DCC, pages 5-17, 2013.
11. D. Lemire and L. Boytsov. Decoding billions of integers per second through vectorization. Soft. Prac. & Exp., 2014. To appear.
12. D. Metzler and W. B. Croft. A Markov random field model for term dependencies. In Proc. SIGIR, pages 472-479, 2005.
13. S. Muthukrishnan. Efficient algorithms for document retrieval problems. In Proc. SODA, pages 657-666, 2002.
14. R. Ozcan, I. S. Altingovde, B. B. Cambazoglu, F. P. Junqueira, and O. Ulusoy. A five-level static cache architecture for web search engines. Inf. Proc. & Man., 48(5):828-840, 2011.
15. K. Sadakane. Succinct data structures for flexible text retrieval systems. J. Discr. Alg., 5(1):12-22, 2007.
16. A. Trotman, X.-F. Jia, and M. Crane. Towards an efficient and effective search engine. In Wkshp. Open Source IR, pages 40-47, 2012.
17. H. Turtle and J. Flood. Query evaluation: strategies and optimizations. Inf. Proc. & Man., 31(6):831-850, 1995.
18. S. Vigna. Quasi-succinct indices. In Proc. WSDM, pages 83-92, 2013.
19. H. E. Williams, J. Zobel, and P. Anderson. Fast phrase querying with combined indexes. ACM TOIS, 22(4):573-594, 2004.
20. J. Zobel and A. Moffat. Inverted files for text search engines. ACM Comp. Surv., 38(2):6-1 - 6-56, 2006.