{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T12:40:03Z","timestamp":1748349603919,"version":"3.41.0"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2000,7,1]],"date-time":"2000-07-01T00:00:00Z","timestamp":962409600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2000,7,1]],"date-time":"2000-07-01T00:00:00Z","timestamp":962409600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Information Retrieval"],"published-print":{"date-parts":[[2000,7]]},"DOI":"10.1023\/a:1009934302807","type":"journal-article","created":{"date-parts":[[2002,12,23]],"date-time":"2002-12-23T00:25:11Z","timestamp":1040603111000},"page":"49-77","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":71,"title":["Adding Compression to Block Addressing Inverted Indexes"],"prefix":"10.1007","volume":"3","author":[{"given":"Gonzalo","family":"Navarro","sequence":"first","affiliation":[]},{"given":"Edleno Silva","family":"de Moura","sequence":"additional","affiliation":[]},{"given":"Marden","family":"Neubert","sequence":"additional","affiliation":[]},{"given":"Nivio","family":"Ziviani","sequence":"additional","affiliation":[]},{"given":"Ricardo","family":"Baeza-Yates","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"264570_CR1","doi-asserted-by":"crossref","unstructured":"Ara\u00fajo MD, Navarro G and Ziviani N (1997) Large text searching allowing errors. In: Baeza-Yates R, Ed., Proc. of the 4th South AmericanWorkshop on String Processing (WSP 197), Carleton University Press, Vol. 8, pp. 2-20.","DOI":"10.1515\/9780773591400-003"},{"key":"264570_CR2","unstructured":"Baeza-Yates R (2000) Another distributed searching architecture for the web. Personal communication."},{"issue":"10","key":"264570_CR3","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1145\/135239.135243","volume":"35","author":"R Baeza-Yates","year":"1992","unstructured":"Baeza-Yates R and Gonnet G (1992) A new approach to text searching. Communications of the ACM, 35(10):74-82.","journal-title":"Communications of the ACM"},{"issue":"1","key":"264570_CR4","first-page":"67","volume":"25","author":"R Baeza-Yates","year":"1996","unstructured":"Baeza-Yates R and Navarro G (1996) Integrating contents and structure in text retrieval. ACM Special Interest Group in Management of Data (SIGMOD) Record, 25(1):67-79.","journal-title":"ACM Special Interest Group in Management of Data (SIGMOD) Record"},{"issue":"1","key":"264570_CR5","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1002\/(SICI)1097-4571(2000)51:1<69::AID-ASI10>3.0.CO;2-C","volume":"51","author":"R Baeza-Yates","year":"2000","unstructured":"Baeza-Yates R and Navarro G (2000) Block-addressing indices for approximate text retrieval. Journal of the American Society for Information Science (JASIS), 51(1):69-82.","journal-title":"Journal of the American Society for Information Science (JASIS)"},{"key":"264570_CR6","doi-asserted-by":"crossref","unstructured":"Baeza-Yates R, Navarro G, Vegas J and de la Fuente P (1998) A model and a visual query language for structured text. In: Proc. of the 5th South American Symposium on String Processing and Information Retrieval (SPIRE'98), IEEE Computer Science Press, pp. 7-13.","DOI":"10.1109\/SPIRE.1998.712977"},{"key":"264570_CR7","doi-asserted-by":"crossref","unstructured":"Baeza-Yates R and R\u00e9gnier M (1990) Fast algorithms for two dimensional and multiple pattern matching. In: Proc. of the 2nd Scandinavian Workshop on Algorithm Theory (SWAT'90), pp. 332-347.","DOI":"10.1007\/3-540-52846-6_102"},{"key":"264570_CR8","unstructured":"Baeza-Yates R and Ribeiro-Neto B (1999) Modern information retrieval. Addison-Wesely."},{"key":"264570_CR9","unstructured":"Bell TC, Cleary JG and Witten IH (1990) Test Compression. Prentice Hall."},{"key":"264570_CR10","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1145\/5684.5688","volume":"29","author":"J Bentley","year":"1986","unstructured":"Bentley J, Sleator D, Tarjan R and Wei V (1986) A locally adaptive data compression scheme. Communications of the ACM 29, pp. 320-330.","journal-title":"Communications of the ACM"},{"key":"264570_CR11","unstructured":"Bowman C, Danzig P, Hardy D, Manber U and Schwartz M (1994) The harvest information discovery and access system. In: Proc. of the 2nd International World Wide Web Conference, pp. 763-771."},{"key":"264570_CR12","unstructured":"Brown EW, Callan JP and Croft WB (1994) Fast incremental indexing for full-text information retrieval. In: Proc. of the 20th Very Large Data Base Conference (VLDB'94), Santiago, Chile, pp. 192-202."},{"key":"264570_CR13","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1109\/TIT.1975.1055349","volume":"IT-21","author":"P Elias","year":"1975","unstructured":"Elias P (1975) Universal codeword sets and representations of the integers. IEEE Transactions on Information Theory, IT-21, pp. 194-203.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"3","key":"264570_CR14","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1109\/TIT.1966.1053907","volume":"IT-12","author":"SW Golomb","year":"1966","unstructured":"Golomb SW (1966) Run-lenght encodings. IEEE Transactions on Information Theory, IT-12(3):399-401.","journal-title":"IEEE Transactions on Information Theory"},{"key":"264570_CR15","doi-asserted-by":"crossref","unstructured":"Harman DK (1995) Overview of the third text retrieval conference. In: Proc. of the 3rd Text Retrieval Conference (TREC-3), Gaithersburg, Maryland, pp. 1-19.","DOI":"10.6028\/NIST.SP.500-225"},{"key":"264570_CR16","unstructured":"Harman D, Fox E, Baeza-Yates R and Lee W (1992) Inverted Files. Prentice-Hall, pp. 28-43."},{"key":"264570_CR17","doi-asserted-by":"crossref","unstructured":"Hawking D (1997) Scalable text retrieval for large digital libraries. In: Peters C and Thanos C, Eds., Proc. of the 1st European Conference on Digital Libraries, Pisa, Italy, pp. 127-146.","DOI":"10.1007\/BFb0026726"},{"key":"264570_CR18","volume-title":"Information retrieval-Computational and Theoretical Aspects","author":"H Heaps","year":"1978","unstructured":"Heaps H (1978) Information retrieval-Computational and Theoretical Aspects. Academic Press, NY."},{"key":"264570_CR19","first-page":"1090","volume":"40","author":"DA Huffman","year":"1952","unstructured":"Huffman DA (1952) A method for the construction of minimum-redundancy codes. In: Proc. of the Institute of Electrical and Radio Engineers, Vol. 40, pp. 1090-1101.","journal-title":"Proc. of the Institute of Electrical and Radio Engineers"},{"key":"264570_CR20","doi-asserted-by":"crossref","unstructured":"Linoff G and Stanfill C (1993) Compression of indexes with full positional information in very large text databases. In: Proc. of the International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR'93), pp. 88-95.","DOI":"10.1145\/160688.160699"},{"key":"264570_CR21","unstructured":"Manber U and Wu S (1994) Glimpse: A tool to search through entire file systems. In: Proc. of the USENIX Technical Conference, pp. 23-32."},{"key":"264570_CR22","unstructured":"Manber U, Smith M and Gopal B (1997) WebGlimpse: Combining browsing and searching. In: Proc. of USENIX Technical Conference."},{"issue":"2","key":"264570_CR23","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1002\/spe.4380190207","volume":"19","author":"A Moffat","year":"1989","unstructured":"Moffat A (1989) Word-based text compression. Software Practice and Experience, 19(2):185-198.","journal-title":"Word-based text compression. Software Practice and Experience"},{"issue":"2","key":"264570_CR24","first-page":"125","volume":"5","author":"A Moffat","year":"1992","unstructured":"Moffat A(1992) Economical inversion of large text files. Computing Systems (USENIX Assoc. Journal), 5(2):125-139.","journal-title":"Computing Systems (USENIX Assoc. Journal)"},{"issue":"7","key":"264570_CR25","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1002\/(SICI)1097-4571(199508)46:7<537::AID-ASI7>3.0.CO;2-P","volume":"46","author":"A Moffat","year":"1995","unstructured":"Moffat A and Bell T (1995) In-situ generation of compressed inverted files. Journal of the American Society for Information Science (JASIS), 46(7):537-550.","journal-title":"Journal of the American Society for Information Science (JASIS)"},{"issue":"2","key":"264570_CR26","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1109\/69.591454","volume":"9","author":"A Moffat","year":"1997","unstructured":"Moffat A, Zobel J and Sharman N (1997) Text compression for dynamic document databases. IEEE Transactions on Knowledge and Data Engineering, 9(2):302-313.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"264570_CR27","doi-asserted-by":"crossref","unstructured":"Moura E, Navarro G and Ziviani N (1999) Linear time sorting of skewed distributions. In: Proc. of the 6th Symposium on String Processing and Information Retrieval (SPIRE'99), IEEE Computer Science Press, pp. 135-140.","DOI":"10.1109\/SPIRE.1999.796588"},{"key":"264570_CR28","unstructured":"Moura E, Navarro G, ZivianiNand Baeza-Yates R (To appear) Fast and flexibleword searching on compressed text. ACM Transactions on Information Systems. Previous versions in 21st International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR'98) and 5th Symposium on String Processing and Information Retrieval (SPIRE'98)."},{"key":"264570_CR29","unstructured":"Turpin A and Moffat A (1997) Fast file search using text compression. In: Proc. of the 20th Australian Computer Science Conference, pp. 1-8."},{"key":"264570_CR30","unstructured":"Williams H, Zobel J and Anderson P (1999) What's next? Efficient structures for phrase querying. In: Roddick J, Ed., Proc. of the 10th Australasian Database Conference, Auckland, NZ, pp. 141-152."},{"key":"264570_CR31","volume-title":"Managing Gigabytes","author":"I Witten","year":"1999","unstructured":"Witten I, Moffat A and Bell T (1999) Managing Gigabytes, 2nd ed. Morgan Kaufmann Publishers, New York.","edition":"2nd ed."},{"issue":"10","key":"264570_CR32","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1145\/135239.135244","volume":"35","author":"S Wu","year":"1992","unstructured":"Wu S and Manber U (1992) Fast text searching allowing errors. Communications of the ACM, 35(10):83-91.","journal-title":"Communications of the ACM"},{"key":"264570_CR33","unstructured":"Zipf G (1949) Human Behaviour and the Principle of Least Effort. Addison-Wesley."}],"container-title":["Information Retrieval"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009934302807.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1009934302807\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009934302807.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T12:14:14Z","timestamp":1748348054000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1009934302807"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,7]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2000,7]]}},"alternative-id":["264570"],"URL":"https:\/\/doi.org\/10.1023\/a:1009934302807","relation":{},"ISSN":["1386-4564","1573-7659"],"issn-type":[{"type":"print","value":"1386-4564"},{"type":"electronic","value":"1573-7659"}],"subject":[],"published":{"date-parts":[[2000,7]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}