{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T06:18:32Z","timestamp":1775283512657,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540345978","type":"print"},{"value":"9783540345985","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11764298_13","type":"book-chapter","created":{"date-parts":[[2006,5,19]],"date-time":"2006-05-19T08:37:56Z","timestamp":1148027876000},"page":"146-157","source":"Crossref","is-referenced-by-count":41,"title":["Faster Adaptive Set Intersections for Text Searching"],"prefix":"10.1007","author":[{"given":"J\u00e9r\u00e9my","family":"Barbay","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alejandro","family":"L\u00f3pez-Ortiz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tyler","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1007\/978-3-540-27801-6_30","volume-title":"Combinatorial Pattern Matching","author":"R.A. Baeza-Yates","year":"2004","unstructured":"Baeza-Yates, R.A.: 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","doi-asserted-by":"crossref","unstructured":"Baeza-Yates, R.A., Salinger, A.: Experimental Analysis of a Fast Intersection Algorithm for Sorted Sequences. In: Proceedings of 12th International Conference on String Processing and Information Retrieval (SPIRE), pp. 13\u201324 (2005)","DOI":"10.1007\/11575832_2"},{"key":"13_CR3","unstructured":"Barbay, J., Kenyon, C.: Adaptive Intersection and t-Threshold Problems. In: Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 390\u2013399 (2002)"},{"issue":"3","key":"13_CR4","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/0020-0190(76)90071-5","volume":"5","author":"J.L. Bentley","year":"1976","unstructured":"Bentley, J.L., 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","unstructured":"Blandford, D.K., Blelloch, G.E.: Compact Representations of Ordered Sets. In: Daniel, K. (ed.) ACM\/SIAM Symposium on Discrete Algorithms (SODA), pp. 11\u201319 (2004)"},{"key":"13_CR6","unstructured":"Erik D. Demaine, Thouis R. Jones, Mihai Patrascu. Interpolation search for non-independent data. In Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 529\u2013530, 2004."},{"key":"13_CR7","unstructured":"Demaine, E.D., L\u00f3pez-Ortiz, A., Munro, J.I.: Adaptive set intersections, unions, and differences. In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 743\u2013752 (2000)"},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/3-540-44808-X_7","volume-title":"Algorithm Engineering and Experimentation","author":"E.D. Demaine","year":"2001","unstructured":"Demaine, E.D., L\u00f3pez-Ortiz, A., Munro, J.I.: Experiments on Adaptive set intersections for text retrieval systems. In: Buchsbaum, A.L., Snoeyink, J. (eds.) ALENEX 2001. LNCS, vol.\u00a02153, pp. 91\u2013104. Springer, Heidelberg (2001)"},{"issue":"4","key":"13_CR9","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1145\/146370.146381","volume":"24","author":"V. Estivill-Castro","year":"1992","unstructured":"Estivill-Castro, V., Wood, D.: A survey of adaptive sorting algorithms. ACM Computing Surveys\u00a024(4), 441\u2013476 (1992)","journal-title":"ACM Computing Surveys"},{"key":"13_CR10","volume-title":"Information Retrieval","author":"W. Frakes","year":"1992","unstructured":"Frakes, W., Baeza-Yates, R.: Information Retrieval. Prentice-Hall, Englewood Cliffs (1992)"},{"issue":"1","key":"13_CR11","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/BF00288534","volume":"13","author":"G. Gonnet","year":"1980","unstructured":"Gonnet, G., Rogers, L., George, G.: An algorithmic and complexity analysis of interpolation search. Acta Informatica\u00a013(1), 39\u201352 (1980)","journal-title":"Acta Informatica"},{"key":"13_CR12","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/BF00289521","volume":"1","author":"F.K. Hwang","year":"1971","unstructured":"Hwang, F.K., Lin, S.: Optimal Merging of 2 Elements with n Elements. Acta Informatica\u00a01, 145\u2013158 (1971)","journal-title":"Acta Informatica"},{"key":"13_CR13","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1137\/0201004","volume":"1","author":"F.K. Hwang","year":"1972","unstructured":"Hwang, F.K., Lin, S.: A Simple Algorithm for Merging Two Disjoint Linearly-Ordered Sets. SIAM Journal of Computing\u00a01, 31\u201339 (1972)","journal-title":"SIAM Journal of Computing"},{"key":"13_CR14","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1137\/0209026","volume":"9","author":"F.K. Hwang","year":"1980","unstructured":"Hwang, F.K.: Optimal Merging of 3 Elements with n Elements. SIAM Journal of Computing\u00a09, 298\u2013320 (1980)","journal-title":"SIAM Journal of Computing"},{"key":"13_CR15","unstructured":"Manber, U., Myers, G.: Suffix arrays: A new method for on-line string searches. In: Proceedings of the 1st Symposium on Discrete Algorithms (SODA), pp. 319\u2013327 (1990)"},{"issue":"7","key":"13_CR16","doi-asserted-by":"crossref","first-page":"550","DOI":"10.1145\/359545.359557","volume":"21","author":"Y. Perl","year":"1978","unstructured":"Perl, Y., Itai, A., Avni, H.: Interpolation search\u2013A loglogn search. CACM\u00a021(7), 550\u2013554 (1978)","journal-title":"CACM"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11764298_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:10:50Z","timestamp":1619507450000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11764298_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540345978","9783540345985"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11764298_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}