{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T04:40:12Z","timestamp":1773895212523,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642124754","type":"print"},{"value":"9783642124761","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12476-1_3","type":"book-chapter","created":{"date-parts":[[2010,4,8]],"date-time":"2010-04-08T09:46:37Z","timestamp":1270719997000},"page":"45-61","source":"Crossref","is-referenced-by-count":8,"title":["Fast Intersection Algorithms for Sorted Sequences"],"prefix":"10.1007","author":[{"given":"Ricardo","family":"Baeza-Yates","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alejandro","family":"Salinger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"#cr-split#-3_CR1.1","unstructured":"Baeza-Yates, R.A.: Efficient Text Searching. PhD thesis, Dept. of Computer Science. University of Waterloo (May 1989);"},{"key":"#cr-split#-3_CR1.2","unstructured":"Also as Research Report CS-89-17"},{"key":"3_CR2","unstructured":"Baeza-Yates, R.A., Bradford, P.G., Culberson, J.C., Rawlins, G.J.E.: The Complexity of Multiple Searching (1993) (unpublished manuscript)"},{"key":"3_CR3","first-page":"513","volume-title":"Modern Information Retrieval","author":"R.A. Baeza-Yates","year":"1999","unstructured":"Baeza-Yates, R.A., Ribeiro-Neto, B.: Modern Information Retrieval, 513 pages. ACM Press\/Addison-Wesley, England (1999)"},{"key":"3_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1007\/978-3-540-39984-1_5","volume-title":"String Processing and Information Retrieval","author":"R.A. Baeza-Yates","year":"2003","unstructured":"Baeza-Yates, R.A., Saint-Jean, F.: A three level search engine index based in query log distribution. In: Nascimento, M.A., de Moura, E.S., Oliveira, A.L. (eds.) SPIRE 2003. LNCS, vol.\u00a02857, pp. 56\u201365. Springer, Heidelberg (2003)"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Baeza-Yates, R.A.: Query usage mining in search engines. In: Scime, A. (ed.) Web Mining: Applications and Techniques. Idea Group, USA (2004)","DOI":"10.4018\/978-1-59140-414-9.ch014"},{"key":"3_CR6","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.A. Baeza-Yates","year":"2004","unstructured":"Baeza-Yates, R.A.: A fast set intersection algorithm for sorted sequences. In: Sahinalp, S.C., Muthukrishnan, S., Dogrus\u00f6z, U. (eds.) CPM 2004. LNCS, vol.\u00a03109, pp. 400\u2013408. Springer, Heidelberg (2004)"},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/11575832_2","volume-title":"String Processing and Information Retrieval","author":"R.A. Baeza-Yates","year":"2005","unstructured":"Baeza-Yates, R.A., Salinge, A.: Experimental analysis of a fast intersection algorithm for sorted sequences. In: Consens, M.P., Navarro, G. (eds.) SPIRE 2005. LNCS, vol.\u00a03772, pp. 13\u201324. Springer, Heidelberg (2005)"},{"key":"3_CR8","unstructured":"Barbay, J., Kenyon, C.: Adaptive Intersection and t-Threshold Problems. In: Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, January 2002, pp. 390\u2013399 (2002)"},{"issue":"3","key":"3_CR9","first-page":"7","volume":"14","author":"J. Barbay","year":"2009","unstructured":"Barbay, J., L\u00f3pez-Ortiz, A., Lu, T., Salinger, A.: An experimental investigation of set intersection algorithms for text searching. Journal of Experimental Algorithms (JEA)\u00a014(3), 7\u201324 (2009)","journal-title":"Journal of Experimental Algorithms (JEA)"},{"key":"3_CR10","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, 82\u201387 (1976)","journal-title":"Information Processing Letters"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Brin, S., Page, L.: The anatomy of a large-scale hypertextual Web search engine. In: 7th WWW Conference, Brisbane, Australia (April 1998)","DOI":"10.1016\/S0169-7552(98)00110-X"},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/978-3-540-75530-2_13","volume-title":"String Processing and Information Retrieval","author":"J. Culpepper","year":"2007","unstructured":"Culpepper, J., Moffat, A.: Compact set representation for information retrieval. In: Ziviani, N., Baeza-Yates, R. (eds.) SPIRE 2007. LNCS, vol.\u00a04726, pp. 137\u2013148. Springer, Heidelberg (2007)"},{"key":"3_CR13","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, San Francisco, CA, January 2000, pp. 743\u2013752 (2000)"},{"key":"3_CR14","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)"},{"key":"3_CR15","unstructured":"Dietz, P., Mehlhorn, K., Raman, R., Uhrig, C.: Lower Bounds for Set Intersection Queries. In: Proceedings of the 4\n                  th\n                 Annual Symposium on Discrete Algorithms, pp. 194\u2013201 (1993)"},{"key":"3_CR16","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/0022-0000(79)90054-0","volume":"18","author":"D. Dobkin","year":"1979","unstructured":"Dobkin, D., Lipton, R.: On the Complexity of Computations Under Varying Sets of Primitives. Journal of Computer and Systems Sciences\u00a018, 86\u201391 (1979)","journal-title":"Journal of Computer and Systems Sciences"},{"issue":"2","key":"3_CR17","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1137\/0222019","volume":"22","author":"W. Fernandez de la Vega","year":"1993","unstructured":"Fernandez de la Vega, W., Kannan, S., Santha, M.: Two probabilistic results on merging. SIAM J. on Computing\u00a022(2), 261\u2013271 (1993)","journal-title":"SIAM J. on Computing"},{"issue":"4","key":"3_CR18","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/PL00009235","volume":"22","author":"W. Fernandez de la Vega","year":"1998","unstructured":"Fernandez de la Vega, W., Frieze, A.M., Santha, M.: Average case analysis of the merging algorithm of Hwang and Lin. Algorithmica\u00a022(4), 483\u2013489 (1998)","journal-title":"Algorithmica"},{"key":"3_CR19","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 lists. SIAM J. on Computing\u00a01, 31\u201339 (1972)","journal-title":"SIAM J. on Computing"},{"key":"3_CR20","unstructured":"Rawlins, G.J.E.: Compared to What?: An Introduction the the Analysis of Algorithms. Computer Science Press\/W.H. Freeman (1992)"},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"Sanders, P., Transier, F.: Intersection in integer inverted indices. In: ALENEX 2007, pp. 71\u201383 (2007)","DOI":"10.1137\/1.9781611972870.7"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12476-1_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T07:41:53Z","timestamp":1619768513000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12476-1_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642124754","9783642124761"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12476-1_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}