{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T03:26:02Z","timestamp":1725852362567},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319321516"},{"type":"electronic","value":"9783319321523"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-32152-3_20","type":"book-chapter","created":{"date-parts":[[2016,3,31]],"date-time":"2016-03-31T22:10:11Z","timestamp":1459462211000},"page":"210-220","source":"Crossref","is-referenced-by-count":1,"title":["Running Time Prediction for Web Search Queries"],"prefix":"10.1007","author":[{"given":"Oscar","family":"Rojas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Veronica","family":"Gil-Costa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mauricio","family":"Marin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,4,2]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Broder, A.Z., Carmel, D., Herscovici, M., Soffer, A., Zien, J.Y.: Efficient query evaluation using a two-level retrieval process. In: CIKM, pp. 426\u2013434 (2003)","key":"20_CR1","DOI":"10.1145\/956943.956944"},{"doi-asserted-by":"crossref","unstructured":"Macdonald, N.T.C., Ounis, I.: Learning to predict response times for online query scheduling. In: SIGIR, pp. 621\u2013630 (2012)","key":"20_CR2","DOI":"10.1145\/2348283.2348367"},{"doi-asserted-by":"crossref","unstructured":"Chakrabarti, K., Chaudhuri, S., Ganti, V.: Interval-based pruning for top-k processing over compressed lists. In: ICDE, pp. 709\u2013720 (2011)","key":"20_CR3","DOI":"10.1109\/ICDE.2011.5767855"},{"doi-asserted-by":"crossref","unstructured":"Cronen-Townsend, S., Zhou, Y., Croft, W.B.: Predicting query performance. In: SIGIR, pp. 299\u2013306 (2002)","key":"20_CR4","DOI":"10.1145\/564426.564429"},{"doi-asserted-by":"crossref","unstructured":"Ding, S., Suel, T.: Faster top-k document retrieval using block-max indexes. In: SIGIR, pp. 993\u20131002 (2011)","key":"20_CR5","DOI":"10.1145\/2009916.2010048"},{"doi-asserted-by":"crossref","unstructured":"Kim, S., He, Y., Hwang, S., Elnikety, S., Choi, S.: Delayed-dynamic-selective (DDS) prediction for reducing extreme tail latency in web search. In: WSDM, pp. 7\u201316 (2015)","key":"20_CR6","DOI":"10.1145\/2684822.2685289"},{"issue":"5","key":"20_CR7","first-page":"529","volume":"16","author":"L Park","year":"2004","unstructured":"Park, L., Ramamohanarao, K., Palaniswami, M.: Fourier domain scoring: a novel document ranking method. TKDE 16(5), 529\u2013539 (2004)","journal-title":"TKDE"},{"key":"20_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1007\/978-3-642-40047-6_41","volume-title":"Euro-Par 2013 Parallel Processing","author":"O Rojas","year":"2013","unstructured":"Rojas, O., Gil-Costa, V., Marin, M.: Efficient parallel block-max wand algorithm. In: Wolf, F., Mohr, B., an Mey, D. (eds.) Euro-Par 2013. LNCS, vol. 8097, pp. 394\u2013405. Springer, Heidelberg (2013)"},{"doi-asserted-by":"crossref","unstructured":"Tonellotto, N., Macdonald, C., Ounis, I.: Efficient and effective retrieval using selective pruning. In: WSDM, pp. 63\u201372 (2013)","key":"20_CR9","DOI":"10.1145\/2433396.2433407"},{"issue":"11","key":"20_CR10","first-page":"1857","volume":"38","author":"T Warren","year":"2005","unstructured":"Warren, T.: Clustering of time series data-a survey. JPR 38(11), 1857\u20131874 (2005)","journal-title":"JPR"}],"container-title":["Lecture Notes in Computer Science","Parallel Processing and Applied Mathematics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-32152-3_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T18:53:36Z","timestamp":1559415216000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-32152-3_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319321516","9783319321523"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-32152-3_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}