{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:36:59Z","timestamp":1725550619310},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540297406"},{"type":"electronic","value":"9783540322412"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11575832_2","type":"book-chapter","created":{"date-parts":[[2005,10,13]],"date-time":"2005-10-13T14:12:50Z","timestamp":1129212770000},"page":"13-24","source":"Crossref","is-referenced-by-count":27,"title":["Experimental Analysis of a Fast Intersection Algorithm 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":"2_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. 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":"2_CR2","unstructured":"Baeza-Yates, R.A.: Efficient Text Serching. PhD thesis, Dept. of Computer Science, University of Waterloo, Also as Research Report CS-89-17 (May 1989)"},{"key":"2_CR3","unstructured":"Baeza-Yates, R., Bradford, P.G., Culberson, J.C., Rawlins, G.J.E.: The Complexity of Multiple Searching, unpublished manuscript (1993)"},{"key":"2_CR4","unstructured":"Baeza-Yates, R., Ribeiro-Neto, B.: Modern Information Retrieval, p. 513. ACM Press\/Addison-Wesley (1999)"},{"key":"2_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/978-3-540-39984-1_5","volume-title":"String Processing and Information Retrieval","author":"R. Baeza-Yates","year":"2003","unstructured":"Baeza-Yates, R., Sainte-Jean, F.: A Three Level Search Engine Index bases 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":"2_CR6","volume-title":"Web Mining: Applications and Techniques","author":"R. Baeza-Yates","year":"2004","unstructured":"Baeza-Yates, R.: Query Usage Mining in Search Engines. In: Scime, A. (ed.) Web Mining: Applications and Techniques, Idea Group, USA (2004)"},{"key":"2_CR7","volume-title":"Modeling User Search Behavior, LA-WEB 2005","author":"R. Baeza-Yates","year":"2005","unstructured":"Baeza-Yates, R., Hurtado, C., Mendoza, M., Dupret, G.: Modeling User Search Behavior, LA-WEB 2005. IEEE CS Press, Los Alamitos (2005)"},{"key":"2_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, pp. 390\u2013399 (January 2002)"},{"key":"2_CR9","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":"2_CR10","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, California, pp. 743\u2013752 (January 2000)"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Demaine, E.D., L\u00f3pez-Ortiz, A., Munro, J.I.: Experiments on Adaptive Set Intersections for Text Retrieval Systems. In: Proceedings of the 3rd Workshop on Algorithm Engineering and Experiments. LNCS. Springer, Washington, DC (2001)","DOI":"10.1007\/3-540-44808-X_7"},{"key":"2_CR12","unstructured":"Paul, D., Kurt, M., Rajeev, R., Christian, U.: Lower Bounds for Set Intersection Queries. In: Proceedings of the 4th Annual Symposium on Discrete Algorithms, pp. 194\u2013201 (1993)"},{"key":"2_CR13","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/0022-0000(79)90054-0","volume":"18","author":"D. David","year":"1979","unstructured":"David, D., Richard, L.: 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"},{"key":"2_CR14","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":"2_CR15","unstructured":"Rawlins Gregory, J.E.: Compared to What?: An Introduction to the Analysis of Algorithms. Computer Science Press\/W. H. Freeman (1992)"}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11575832_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:42:53Z","timestamp":1619505773000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11575832_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540297406","9783540322412"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11575832_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}