{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T05:30:53Z","timestamp":1737437453124,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540755296"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-75530-2_26","type":"book-chapter","created":{"date-parts":[[2007,9,19]],"date-time":"2007-09-19T14:26:50Z","timestamp":1190212010000},"page":"287-299","source":"Crossref","is-referenced-by-count":24,"title":["Efficient Text Proximity Search"],"prefix":"10.1007","author":[{"given":"Ralf","family":"Schenkel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"Broschart","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Seungwon","family":"Hwang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Theobald","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gerhard","family":"Weikum","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"26_CR1","doi-asserted-by":"crossref","unstructured":"Anh, V.N., de Kretser, O., Moffat, A.: Vector-space ranking with effective early termination. In: SIGIR, pp. 35\u201342 (2001)","DOI":"10.1145\/383952.383957"},{"key":"26_CR2","doi-asserted-by":"crossref","unstructured":"Anh, V.N., Moffat, A.: Pruned query evaluation using pre-computed impacts. In: SIGIR, pp. 372\u2013379 (2006)","DOI":"10.1145\/1148170.1148235"},{"key":"26_CR3","unstructured":"Bast, H., et al.: Io-top-k: Index-access optimized top-k query processing. In: VLDB, pp. 475\u2013486 (2006)"},{"key":"26_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/11687238_23","volume-title":"Advances in Database Technology - EDBT 2006","author":"C. Botev","year":"2006","unstructured":"Botev, C., et al.: Expressiveness and performance of full-text search languages. In: Ioannidis, Y., Scholl, M.H., Schmidt, J.W., Matthes, F., Hatzopoulos, M., Boehm, K., Kemper, A., Grust, T., Boehm, C. (eds.) EDBT 2006. LNCS, vol.\u00a03896, pp. 349\u2013367. Springer, Heidelberg (2006)"},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"B\u00fcttcher, S., Clarke, C.L.A.: Efficiency vs. effectiveness in terabyte-scale information retrieval. In: TREC (2005)","DOI":"10.6028\/NIST.SP.500-266.terabyte-uwaterloo.clarke"},{"key":"26_CR6","doi-asserted-by":"crossref","unstructured":"B\u00fcttcher, S., Clarke, C.L.A., Lushman, B.: Term proximity scoring for ad-hoc retrieval on very large text collections. In: SIGIR, pp. 621\u2013622 (2006)","DOI":"10.1145\/1148170.1148285"},{"issue":"3","key":"26_CR7","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1016\/0306-4573(94)00050-D","volume":"31","author":"J.P. Callan","year":"1995","unstructured":"Callan, J.P., Croft, W.B., Broglio, J.: Trec and tipster experiments with inquery. Inf. Process. Manage.\u00a031(3), 327\u2013343 (1995)","journal-title":"Inf. Process. Manage."},{"key":"26_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/11735106_7","volume-title":"ECIR 2006","author":"M. Chang","year":"2006","unstructured":"Chang, M., Poon, C.K.: Efficient phrase querying with common phrase index. In: Lalmas, M., MacFarlane, A., R\u00fcger, S., Tombros, A., Tsikrika, T., Yavlinsky, A. (eds.) ECIR 2006. LNCS, vol.\u00a03936, pp. 61\u201371. Springer, Heidelberg (2006)"},{"issue":"2","key":"26_CR9","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/S0306-4573(99)00017-5","volume":"36","author":"C.L.A. Clarke","year":"2000","unstructured":"Clarke, C.L.A., Cormack, G.V., Tudhope, E.A.: Relevance ranking for one to three term queries. Inf. Process. Manage.\u00a036(2), 291\u2013311 (2000)","journal-title":"Inf. Process. Manage."},{"key":"26_CR10","doi-asserted-by":"crossref","unstructured":"de Kretser, O., Moffat, A.: Effective document presentation with a locality-based similarity heuristic. In: SIGIR, pp. 113\u2013120 (1999)","DOI":"10.1145\/312624.312664"},{"issue":"2","key":"26_CR11","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1145\/348751.348754","volume":"18","author":"E.S. Moura de","year":"2000","unstructured":"de Moura, E.S., et al.: Fast and flexible word searching on compressed text. ACM Trans. Inf. Syst.\u00a018(2), 113\u2013139 (2000)","journal-title":"ACM Trans. Inf. Syst."},{"issue":"4","key":"26_CR12","doi-asserted-by":"publisher","first-page":"614","DOI":"10.1016\/S0022-0000(03)00026-6","volume":"66","author":"R. Fagin","year":"2003","unstructured":"Fagin, R., Lotem, A., Naor, M.: Optimal aggregation algorithms for middleware. J. Comput. Syst. Sci.\u00a066(4), 614\u2013656 (2003)","journal-title":"J. Comput. Syst. Sci."},{"key":"26_CR13","volume-title":"Information Retrieval","author":"D.A. Grossman","year":"2005","unstructured":"Grossman, D.A., Frieder, O.: Information Retrieval. Springer, Heidelberg (2005)"},{"issue":"2","key":"26_CR14","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1145\/305110.305119","volume":"32","author":"D. Hawking","year":"1998","unstructured":"Hawking, D.: Efficiency\/effectiveness trade-offs in query processing. SIGIR Forum\u00a032(2), 16\u201322 (1998)","journal-title":"SIGIR Forum"},{"key":"26_CR15","doi-asserted-by":"crossref","unstructured":"Metzler, D., et al.: Indri at TREC 2004: Terabyte track. In: TREC (2004)","DOI":"10.6028\/NIST.SP.500-261.terabyte-u.mass"},{"key":"26_CR16","unstructured":"Monz, C.: Minimal span weighting retrieval for question answering. In: IR4QA (2004)"},{"key":"26_CR17","unstructured":"Papka, R., Allan, J.: Why bigger windows are better than small ones. Technical report, CIIR (1997)"},{"key":"26_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/3-540-36618-0_15","volume-title":"Advances in Information Retrieval","author":"Y. Rasolofo","year":"2003","unstructured":"Rasolofo, Y., Savoy, J.: Term proximity scoring for keyword-based retrieval systems. In: Sebastiani, F. (ed.) ECIR 2003. LNCS, vol.\u00a02633, pp. 207\u2013218. Springer, Heidelberg (2003)"},{"key":"26_CR19","doi-asserted-by":"crossref","unstructured":"Soffer, A., et al.: Static index pruning for information retrieval systems. In: SIGIR, pp. 43\u201350 (2001)","DOI":"10.1145\/383952.383958"},{"key":"26_CR20","unstructured":"Song, R., et al.: Viewing term proximity from a different perspective. Technical Report MSR-TR-2005-69, Microsoft Research Asia (May 2005)"},{"key":"26_CR21","unstructured":"Theobald, M., Schenkel, R., Weikum, G.: An efficient and versatile query engine for TopX search. In: VLDB, pp. 625\u2013636 (2005)"},{"key":"26_CR22","unstructured":"Williams, H.E., et al.: What\u2019s next? index structures for efficient phrase querying. In: Australasian Database Conference, pp. 141\u2013152 (1999)"},{"issue":"4","key":"26_CR23","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1145\/1028099.1028102","volume":"22","author":"H.E. Williams","year":"2004","unstructured":"Williams, H.E., et al.: Fast phrase querying with combined indexes. ACM Trans. Inf. Syst.\u00a022(4), 573\u2013594 (2004)","journal-title":"ACM Trans. Inf. Syst."},{"key":"26_CR24","volume-title":"Managing Gigabytes","author":"I.H. Witten","year":"1999","unstructured":"Witten, I.H., Moffat, A., Bell, T.: Managing Gigabytes. Morgan Kaufman, San Francisco (1999)"}],"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_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T03:09:44Z","timestamp":1737428984000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75530-2_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540755296"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75530-2_26","relation":{},"subject":[]}}