{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T06:11:09Z","timestamp":1775283069465,"version":"3.50.1"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2006,10,5]],"date-time":"2006-10-05T00:00:00Z","timestamp":1160006400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2006,10,5]],"date-time":"2006-10-05T00:00:00Z","timestamp":1160006400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Inf Retrieval"],"published-print":{"date-parts":[[2007,6]]},"DOI":"10.1007\/s10791-006-9014-4","type":"journal-article","created":{"date-parts":[[2006,10,4]],"date-time":"2006-10-04T17:57:14Z","timestamp":1159984634000},"page":"205-231","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":74,"title":["A pipelined architecture for distributed text query evaluation"],"prefix":"10.1007","volume":"10","author":[{"given":"Alistair","family":"Moffat","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"William","family":"Webber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Justin","family":"Zobel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ricardo","family":"Baeza-Yates","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,10,5]]},"reference":[{"key":"9014_CR1","doi-asserted-by":"crossref","unstructured":"Anh, V. N., de Kretser, O., & Moffat, A. (2001). Vector-space ranking with effective early termination. In W. B. Croft, D. J. Harper, D. H. Kraft, and J. Zobel (Eds.), Proc. 24th Annual International ACM SIGIR Conf. on Research and Development in Information Retrieval (pp. 35\u201342), New Orleans, LA. New York: ACM Press.","DOI":"10.1145\/383952.383957"},{"key":"9014_CR2","doi-asserted-by":"crossref","unstructured":"Anh, V. N., & Moffat, A. (2006). Pruned query evaluation using pre-computed impacts. In S. Dumais, E. N. Efthimiadis, D. Hawking and K. J\u00e4rvelin (Eds.), Proc. 29th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (pp. 372\u2013379). Seattle, Washington. New York: ACM Press. URL http:\/\/doi.acm.org\/10.1145\/1148170.1148235.","DOI":"10.1145\/1148170.1148235"},{"key":"9014_CR3","doi-asserted-by":"crossref","unstructured":"Badue, C., Baeza-Yates, R., Ribeiro-Neto, B., & Ziviani, N. (2001). Distributed query processing using partitioned inverted files. In G. Navarro (Ed.), Proc. Symp. String Processing and Information Retrieval (pp. 10\u201320). Laguna de San Rafael, Chile.","DOI":"10.1109\/SPIRE.2001.989733"},{"key":"9014_CR4","unstructured":"Baeza-Yates, R., & Ribeiro-Neto, B. (1999). Modern information retrieval. New York, NY: ACM Press."},{"issue":"6","key":"9014_CR5","doi-asserted-by":"crossref","first-page":"853","DOI":"10.1016\/S0306-4573(02)00084-5","volume":"39","author":"P. Bailey","year":"2003","unstructured":"Bailey, P., Craswell, N., & Hawking, D. (2003). Engineering a multi-purpose test collection for web retrieval experiments. Information Processing & Management, 39(6), 853\u2013871.","journal-title":"Information Processing & Management"},{"issue":"2","key":"9014_CR6","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1109\/MM.2003.1196112","volume":"23","author":"L. A. Barroso","year":"2003","unstructured":"Barroso, L. A., Dean, J., & H\u00f6lzle, U. (2003). Web search for a planet: The Google cluster architecture. IEEE Micro, 23(2), 22\u201328.","journal-title":"IEEE Micro"},{"key":"9014_CR7","doi-asserted-by":"crossref","unstructured":"Cacheda, F., Plachouras, V., & Ounis, I. (2004). Performance analysis of distributed architectures to index one terabyte of text. In S. McDonald and J. Tait (Eds.), Proc. 26th European Conf. on IR Research, volume 2997 of Lecture Notes in Computer Science (pp. 394\u2013408), Sunderland, UK. Springer.","DOI":"10.1007\/978-3-540-24752-4_29"},{"issue":"1","key":"9014_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/333135.333136","volume":"18","author":"B. Cahoon","year":"2000","unstructured":"Cahoon, B., McKinley, K. S., & Lu, Z. (2000). Evaluating the performance of distributed architectures for information retrieval using a variety of workloads. ACM Transactions on Information Systems, 18(1), 1\u201343.","journal-title":"ACM Transactions on Information Systems"},{"key":"9014_CR9","doi-asserted-by":"crossref","unstructured":"Clarke, C. L. A., Tilker, P. L., Tran, A. Q.-L., Harris, K., & Cheng, A. S. (2003). A reliable storage management layer for distributed information retrieval systems. In Proc. 2003 CIKM Int. Conf. Information and Knowledge Management (pp. 207\u2013215), New York, NY, USA. New York: ACM Press.","DOI":"10.1145\/956863.956905"},{"key":"9014_CR10","doi-asserted-by":"crossref","unstructured":"de Kretser, O., Moffat, A., Shimmin, T., & Zobel, J. (1998). Methodologies for distributed information retrieval. In M. P. Papazoglou, M. Takizawa, B. Kr\u00e4mer, and S. Chanson (Eds.), Proc. 18th International Conf. on Distributed Computing Systems (pp. 66\u201373), Amsterdam, The Netherlands, IEEE.","DOI":"10.1109\/ICDCS.1998.679488"},{"issue":"5","key":"9014_CR11","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1016\/0306-4573(91)90062-Q","volume":"27","author":"D. Harman","year":"1991","unstructured":"Harman, D., McCoy, W., Toense, R., & Candela, G. (1991). Prototyping a distributed information retrieval system using statistical ranking. Information Processing & Management, 27(5), 449\u2013460.","journal-title":"Information Processing & Management"},{"issue":"2","key":"9014_CR12","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1145\/305110.305119","volume":"32","author":"D. Hawking","year":"1998","unstructured":"Hawking, D. (1998). Efficiency\/effectiveness trade-offs in query processing. ACM SIGIR Forum, 32(2), 16\u201322.","journal-title":"ACM SIGIR Forum"},{"issue":"2","key":"9014_CR13","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1109\/71.342125","volume":"6","author":"B.-S. Jeong","year":"1995","unstructured":"Jeong, B.-S., & Omiecinski, E. (1995). Inverted file partitioning schemes in multiple disk systems. IEEE Transactions on Parallel and Distributed Systems, 6(2), 142\u2013153.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"9014_CR14","doi-asserted-by":"crossref","unstructured":"Lester, N., Moffat, A., Webber, W., & Zobel, J. (2005a). Space-limited ranked query evaluation using adaptive pruning. In A. H. H. Ngu, M. Kitsuregawa, E. J. Neuhold, J.-Y. Chung, and Q. Z. Sheng (Eds.), Proc. 6th International Conf. on Web Information Systems Engineering (pp. 470\u2013477), New York, LNCS 3806, Springer.","DOI":"10.1007\/11581062_37"},{"key":"9014_CR15","doi-asserted-by":"crossref","unstructured":"Lester, N., Moffat, A., & Zobel, J. (2005b). Fast on-line index construction by geometric partitioning. In A. Chowdhury, N. Fuhr, M. Ronthaler, H.-J. Schek, and W. Teiken (Eds.), Proc. 2005 CIKM Int. Conf. Information and Knowledge Management (pp. 776\u2013783), Bremen, Germany, New York: ACM Press.","DOI":"10.1145\/1099554.1099739"},{"key":"9014_CR16","doi-asserted-by":"crossref","unstructured":"MacFarlane, A., McCann, J. A., & Robertson, S. E. (2000). Parallel search using partitioned inverted files. In P. de la Fuente (Ed.), Proc. Symp. String Processing and Information Retrieval (pp. 209\u2013220) A Coru\u00f1a, Spain.","DOI":"10.1109\/SPIRE.2000.878197"},{"key":"9014_CR17","doi-asserted-by":"crossref","unstructured":"Moffat, A., Webber, W., & Zobel, J. (2006). Load balancing for term-distributed parallel retrieval. In S. Dumais, E. N. Efthimiadis, D. Hawking and K. J\u00e4rvelin (Eds.), Proc. 29th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (pp. 348\u2013355). Seattle, Washington. New York: ACM Press. URL http:\/\/doi.acm.org\/10.1145\/1148170.1148232.","DOI":"10.1145\/1148170.1148232"},{"issue":"4","key":"9014_CR18","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1145\/237496.237497","volume":"14","author":"A. Moffat","year":"1996","unstructured":"Moffat, A., & Zobel, J. (1996). Self-indexing inverted files for fast text retrieval. ACM Transactions on Information Systems, 14(4), 349\u2013379.","journal-title":"ACM Transactions on Information Systems"},{"key":"9014_CR19","doi-asserted-by":"crossref","unstructured":"Moffat, A., & Zobel, J. (2004). What does it mean to \u201cmeasure performance\u201d? In X. Zhou, S. Su, M. P. Papazoglou, M. E. Owlowska, and K. Jeffrey (Eds.), Proc. 5th Int. Conf. on Web Informations Systems (pp. 1\u201312), Brisbane, Australia. LNCS 3306, Springer.","DOI":"10.1007\/978-3-540-30480-7_1"},{"key":"9014_CR20","doi-asserted-by":"crossref","unstructured":"Orlando, S., Perego, R., & Silvestri, F. (2001). Design of a parallel and distributed web search engine. In Proc. 2001 Parallel Computing Conf. (pp. 197\u2013204), Naples, Italy, Imperial College Press.","DOI":"10.1142\/9781860949630_0025"},{"issue":"10","key":"9014_CR21","doi-asserted-by":"crossref","first-page":"749","DOI":"10.1002\/(SICI)1097-4571(199610)47:10<749::AID-ASI3>3.0.CO;2-2","volume":"47","author":"M. Persin","year":"1996","unstructured":"Persin, M., Zobel, J., & Sacks-Davis, R. (1996). Filtered document retrieval with frequency-sorted indexes. Journal of the American Society for Information Science, 47(10), 749\u2013764.","journal-title":"Journal of the American Society for Information Science"},{"key":"9014_CR22","doi-asserted-by":"crossref","unstructured":"Ribeiro-Neto, B., de Moura, E. S., Neubert, M. S., & Ziviani, N. (1999). Efficient distributed algorithms to build inverted files. In M. Hearst, F. Gey, and R. Tong (Eds.), Proc. 22nd Annual International ACM SIGIR Conf. on Research and Development in Information Retrieval (pp. 105\u2013112), San Francisco, CA, New York: ACM Press.","DOI":"10.1145\/312624.312663"},{"key":"9014_CR23","doi-asserted-by":"crossref","unstructured":"Ribeiro-Neto, B. A., & Barbosa, R. R. (1998). Query performance for tightly coupled distributed digital libraries. In Proc. 3rd ACM Conf. on Digital Libraries (pp. 182\u2013190), Pittsburgh, PA, New York: ACM Press.","DOI":"10.1145\/276675.276695"},{"key":"9014_CR24","doi-asserted-by":"crossref","unstructured":"Scholer, F., Williams, H. E., Yiannis, J., & Zobel, J. (2002). Compression of inverted indexes for fast query evaluation. In M. Beaulieu, R. Baeza-Yates, S. H. Myaeng, and K. J\u00e4rvelin (Eds.), Proc. 25th Annual International ACM SIGIR Conf. on Research and Development in Information Retrieval (pp. 222\u2013229), Tampere, Finland, New York: ACM Press.","DOI":"10.1145\/564376.564416"},{"key":"9014_CR25","unstructured":"Sornil, O. (2001). Parallel inverted index for large-scale, dynamic digital libraries. PhD thesis, Virginia Tech., USA."},{"issue":"3","key":"9014_CR26","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1002\/1097-4571(2000)9999:9999<::AID-ASI1591>3.0.CO;2-R","volume":"52","author":"A. Spink","year":"2001","unstructured":"Spink, A., Wolfram, D., Jansen, B. J., & Saracevic, T. (2001). Searching the web: The public and their queries. Journal of the American Society for Information Science, 52(3), 226\u2013234.","journal-title":"Journal of the American Society for Information Science"},{"key":"9014_CR27","doi-asserted-by":"crossref","unstructured":"Tomasic, A., & Garc\u00eda-Molina, H. (1993). Performance of inverted indices in shared-nothing distributed text document information retrieval systems. In M. J. Carey and P. Valduriez (Eds.), Proc. 2nd International Conf. On Parallel and Distributed Information Systems (pp. 8\u201317), Los Alamitos, CA, IEEE Computer Society Press.","DOI":"10.1109\/PDIS.1993.253078"},{"key":"9014_CR28","unstructured":"Webber, W., & Moffat, A. (2005). In search of reliable retrieval experiments. In J. Kay, A. Turpin, and R. Wilkinson (Eds.), Proc. 10th Australasian Document Computing Symposium (pp. 26\u201333), Sydney, Australia, University of Sydney."},{"key":"9014_CR29","unstructured":"Witten, I. H., Moffat, A., & Bell, T. C. (1999). Managing gigabytes: Compressing and indexing documents and images, 2nd ed. San Francisco, Morgan Kaufmann."},{"key":"9014_CR30","doi-asserted-by":"crossref","unstructured":"Xi, W., Sornil, O., Luo, M., & Fox, E. A. (2002). Hybrid partition inverted files: Experimental validation. In M. Agosti and C. Thanos (Eds.), Proc. European Conf. on Digital Libraries (pp. 422\u2013431), Rome. LNCS volume 2458, Springer.","DOI":"10.1007\/3-540-45747-X_31"},{"issue":"2","key":"9014_CR31","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1145\/984321.984322","volume":"22","author":"C. Zhai","year":"2004","unstructured":"Zhai, C., & Lafferty, J. (2004). A study of smoothing methods for language models applied to information retrieval. ACM Transactions on Information Systems, 22(2), 179\u2013214.","journal-title":"ACM Transactions on Information Systems"},{"key":"9014_CR32","doi-asserted-by":"crossref","unstructured":"Zobel, J., & Moffat, A. (2006). Inverted files for text search engines. ACM Computing Surveys, 38(2). URL http:\/\/doi.acm.org\/10.1145\/1132956.1132959.","DOI":"10.1145\/1132956.1132959"}],"container-title":["Information Retrieval"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10791-006-9014-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10791-006-9014-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10791-006-9014-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10791-006-9014-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,2]],"date-time":"2024-01-02T14:25:30Z","timestamp":1704205530000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10791-006-9014-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,10,5]]},"references-count":32,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2007,6]]}},"alternative-id":["9014"],"URL":"https:\/\/doi.org\/10.1007\/s10791-006-9014-4","relation":{},"ISSN":["1386-4564","1573-7659"],"issn-type":[{"value":"1386-4564","type":"print"},{"value":"1573-7659","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,10,5]]},"assertion":[{"value":"28 September 2005","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 August 2006","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 October 2006","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}