Scalable succinct indexing for large text collections

作者: M Petri

DOI:

关键词:

摘要: Self-indexes save space by emulating operations of traditional data structures using basic on bitvectors. Succinct text indexes provide full-text search functionality which is traditionally provided suffix trees and arrays for a given

参考文章(171)
Markus J. Bauer, Anthony J. Cox, Giovanna Rosone, Lightweight BWT construction for very large string collections combinatorial pattern matching. ,vol. 6661, pp. 219- 231 ,(2011) , 10.1007/978-3-642-21458-5_20
Sebastiano Vigna, Broadword implementation of rank/select queries WEA'08 Proceedings of the 7th international conference on Experimental algorithms. pp. 154- 168 ,(2008) , 10.1007/978-3-540-68552-4_12
M Yasukawa, F Scholer, J Culpepper, Language Independent Ranked Retrieval with NeWT australasian document computing symposium. pp. 1- 8 ,(2011)
Justin Zobel, Phil Anderson, Hugh E. Williams, What's Next? Index Structures for Efficient Phrase Querying. australasian database conference. pp. 141- 152 ,(1999)
Yakov Nekrich, Gonzalo Navarro, Top-k document retrieval in optimal time and linear space symposium on discrete algorithms. pp. 1066- 1077 ,(2012) , 10.5555/2095116.2095200
Guy Joseph Jacobson, Succinct static data structures Carnegie Mellon University. ,(1988)
Djamal Belazzougui, Gonzalo Navarro, Improved Compressed Indexes for Full-Text Document Retrieval String Processing and Information Retrieval. pp. 386- 397 ,(2011) , 10.1007/978-3-642-24583-1_38
Berthier A. Ribeiro-Neto, Ricardo A. Baeza-Yates, Modern Information Retrieval - the concepts and technology behind search, Second edition Pearson Education Ltd., Harlow, England. ,(2011)
Gonzalo Navarro, Simon J. Puglisi, Daniel Valenzuela, Practical compressed document retrieval symposium on experimental and efficient algorithms. pp. 193- 205 ,(2011) , 10.1007/978-3-642-20662-7_17