{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,15]],"date-time":"2026-10-15T05:33:51Z","timestamp":1792042431974,"version":"4.4.0"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540755296","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-75530-2_13","type":"book-chapter","created":{"date-parts":[[2007,9,19]],"date-time":"2007-09-19T14:26:50Z","timestamp":1190212010000},"page":"137-148","source":"Crossref","is-referenced-by-count":18,"title":["Compact Set Representation for Information Retrieval"],"prefix":"10.1007","author":[{"given":"J. Shane","family":"Culpepper","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alistair","family":"Moffat","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"13_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1007\/978-3-540-27801-6_30","volume-title":"Combinatorial Pattern Matching","author":"R. Baeza-Yates","year":"2004","unstructured":"Baeza-Yates, R.: A fast set intersection algorithm for sorted sequences. In: Sahinalp, S.C., Muthukrishnan, S.M., Dogrusoz, U. (eds.) CPM 2004. LNCS, vol.\u00a03109, pp. 400\u2013408. Springer, Heidelberg (2004)"},{"key":"13_CR2","unstructured":"Barbay, J., Kenyon, C.: Adaptive intersection and t-threshold problems. In: Eppstein, D. (ed.) SODA 2002, pp. 390\u2013399 (January 2002)"},{"key":"13_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/11764298_13","volume-title":"Experimental Algorithms","author":"J. Barbay","year":"2006","unstructured":"Barbay, J., L\u00f3pez-Ortiz, A., Lu, T.: Faster adaptive set intersections for text searching. In: \u00c0lvarez, C., Serna, M. (eds.) WEA 2006. LNCS, vol.\u00a04007, pp. 146\u2013157. Springer, Heidelberg (2006)"},{"issue":"3","key":"13_CR4","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/0020-0190(76)90071-5","volume":"5","author":"J. Bentley","year":"1976","unstructured":"Bentley, J., Yao, A.C-C.: An almost optimal algorithm for unbounded searching. Information Processing Letters\u00a05(3), 82\u201387 (1976)","journal-title":"Information Processing Letters"},{"key":"13_CR5","first-page":"11","volume-title":"SODA 2004","author":"D.K. Blandford","year":"2004","unstructured":"Blandford, D.K., Blelloch, G.E.: Compact representations of ordered sets. In: Munro, J.I. (ed.) SODA 2004, pp. 11\u201319. ACM Press, New York (2004)"},{"key":"13_CR6","unstructured":"Clark, D.: Compact PAT trees. PhD thesis, University of Waterloo (1996)"},{"key":"13_CR7","unstructured":"Demaine, E.D., L\u00f3pez-Ortiz, A., Munro, J.I.: Adaptive set intersections, unions, and differences. In: SODA 2000, pp. 743\u2013752 (2000)"},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/11764298_14","volume-title":"Experimental Algorithms","author":"A. Gupta","year":"2006","unstructured":"Gupta, A., Hon, W.-K., Shah, R., Vitter, J.S.: Compressed dictionaries: Space measures, data sets, and experiments. In: \u00c0lvarez, C., Serna, M. (eds.) WEA 2006. LNCS, vol.\u00a04007, pp. 158\u2013169. Springer, Heidelberg (2006)"},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1137\/0201004","volume":"1","author":"F.K. Hwang","year":"1973","unstructured":"Hwang, F.K., Lin, S.: A simple algorithm for merging two disjoint linearly ordered list. SIAM Journal on Computing\u00a01, 31\u201339 (1973)","journal-title":"SIAM Journal on Computing"},{"key":"13_CR10","unstructured":"Jacobson, G.: Succinct static data structures. PhD thesis, Carnegie Mellon University (1988)"},{"issue":"1","key":"13_CR11","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1023\/A:1013002601898","volume":"3","author":"A. Moffat","year":"2000","unstructured":"Moffat, A., Stuiver, L.: Binary interpolative coding for effective index compression. Information Retrieval\u00a03(1), 25\u201347 (2000)","journal-title":"Information Retrieval"},{"issue":"4","key":"13_CR12","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1145\/237496.237497","volume":"14","author":"A. Moffat","year":"1996","unstructured":"Moffat, A., Zobel, J.: Self-indexing inverted files for fast text retrieval. ACM Transactions on Information Systems\u00a014(4), 349\u2013379 (1996)","journal-title":"ACM Transactions on Information Systems"},{"key":"13_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/3-540-62034-6_35","volume-title":"STACS","author":"J.I. Munro","year":"1996","unstructured":"Munro, J.I.: Tables. In: Chandru, V., Vinay, V. (eds.) STACS. LNCS, vol.\u00a01180, pp. 37\u201342. Springer, Heidelberg (1996)"},{"issue":"2","key":"13_CR14","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1137\/S0097539700369909","volume":"31","author":"R. Pagh","year":"2001","unstructured":"Pagh, R.: Low redundancy in static dictionaries with constant time query. SIAM Journal on Computing\u00a031(2), 353\u2013363 (2001), \n                  \n                    http:\/\/www.brics.dk\/~pagh\/papers\/dict-jour.pdf","journal-title":"SIAM Journal on Computing"},{"key":"13_CR15","unstructured":"Raman, R., Raman, V., Rao, S.S.: Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. In: Munro, J.I. (ed.) SODA 2002. Society for Industrial and Applied Mathematics, pp. 233\u2013242 (January 2002)"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Sanders, P., Transier, F.: Intersection in integer inverted indices. In: ALENEX 2007, pp. 71\u201383 (January 2007)","DOI":"10.1137\/1.9781611972870.7"},{"issue":"3","key":"13_CR17","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1002\/1097-4571(2000)9999:9999<::AID-ASI1591>3.0.CO;2-R","volume":"52","author":"A. Spink","year":"2001","unstructured":"Spink, A., Wolfram, D., Jansen, B.J., Saracevic, T.: Searching the web: The public and their queries. Journal of the American Society for Information Science\u00a052(3), 226\u2013234 (2001)","journal-title":"Journal of the American Society for Information Science"},{"key":"13_CR18","volume-title":"Managing Gigabytes: Compressing and Indexing Documents and Images","author":"I.H. Witten","year":"1999","unstructured":"Witten, I.H., Moffat, A., Bell, T.A.: Managing Gigabytes: Compressing and Indexing Documents and Images, 2nd edn. Morgan Kaufmann, San Francisco (1999)","edition":"2"},{"issue":"2","key":"13_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1132956.1132959","volume":"38","author":"J. Zobel","year":"2006","unstructured":"Zobel, J., Moffat, A.: Inverted files for text search engines. ACM Computing Surveys\u00a038(2), 1\u201356 (2006)","journal-title":"ACM Computing Surveys"}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75530-2_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:23:16Z","timestamp":1619518996000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75530-2_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540755296"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75530-2_13","relation":{},"subject":[]}}