{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,24]],"date-time":"2025-08-24T01:10:50Z","timestamp":1755997850167,"version":"3.41.0"},"reference-count":37,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2013,9,1]],"date-time":"2013-09-01T00:00:00Z","timestamp":1377993600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100009123","name":"Norwegian University of Science and Technology","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100009123","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100004837","name":"Ministerio de Ciencia e Innovaci\u00f3n","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004837","id-type":"DOI","asserted-by":"publisher"}]},{"name":"iAD Centre"},{"DOI":"10.13039\/501100004895","name":"European Social Fund","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004895","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005416","name":"Norges Forskningsr\u00e5d","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100005416","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Web"],"published-print":{"date-parts":[[2013,9]]},"abstract":"<jats:p>In a shared-nothing, distributed text retrieval system, queries are processed over an inverted index that is partitioned among a number of index servers. In practice, the index is either document-based or term-based partitioned. This choice is made depending on the properties of the underlying hardware infrastructure, query traffic distribution, and some performance and availability constraints. In query processing on retrieval systems that adopt a term-based index partitioning strategy, the high communication overhead due to the transfer of large amounts of data from the index servers forms a major performance bottleneck, deteriorating the scalability of the entire distributed retrieval system. In this work, to alleviate this problem, we propose a novel inverted index partitioning model that relies on hypergraph partitioning. In the proposed model, concurrently accessed index entries are assigned to the same index servers, based on the inverted index access patterns extracted from the past query logs. The model aims to minimize the communication overhead that will be incurred by future queries while maintaining the computational load balance among the index servers. We evaluate the performance of the proposed model through extensive experiments using a real-life text collection and a search query sample. Our results show that considerable performance gains can be achieved relative to the term-based index partitioning strategies previously proposed in literature. In most cases, however, the performance remains inferior to that attained by document-based partitioning.<\/jats:p>","DOI":"10.1145\/2516633.2516637","type":"journal-article","created":{"date-parts":[[2013,10,1]],"date-time":"2013-10-01T18:14:28Z","timestamp":1380651268000},"page":"1-23","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":23,"title":["A term-based inverted index partitioning model for efficient distributed query processing"],"prefix":"10.1145","volume":"7","author":[{"given":"B. Barla","family":"Cambazoglu","sequence":"first","affiliation":[{"name":"Yahoo Labs"}]},{"given":"Enver","family":"Kayaaslan","sequence":"additional","affiliation":[{"name":"Yahoo Labs"}]},{"given":"Simon","family":"Jonassen","sequence":"additional","affiliation":[{"name":"Yahoo Labs"}]},{"given":"Cevdet","family":"Aykanat","sequence":"additional","affiliation":[{"name":"Bilkent University"}]}],"member":"320","published-online":{"date-parts":[[2013,9,30]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-9260(95)00008-4"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2007.09.006"},{"volume-title":"Proceedings of the 8th International Symposium on String Processing and Information Retrieval. 10--20","author":"Badue C.","key":"e_1_2_1_3_1"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2006.09.002"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/MM.2003.1196112"},{"key":"e_1_2_1_6_1","unstructured":"Berge C. 1985. Graphs and Hypergraphs. Elsevier Science Ltd.   Berge C. 1985. Graphs and Hypergraphs. Elsevier Science Ltd."},{"key":"e_1_2_1_7_1","unstructured":"Cambazoglu B. B. 2006. Models and algorithms for parallel text retrieval. Ph.D. dissertation. Department of Computer Engineering Bilkent University.  Cambazoglu B. B. 2006. Models and algorithms for parallel text retrieval. Ph.D. dissertation. Department of Computer Engineering Bilkent University."},{"volume-title":"Proceedings of the IFIP International Conference on Network and Parallel Computing. 104--109","author":"Cambazoglu B. B.","key":"e_1_2_1_8_1"},{"volume-title":"Advanced Topics in Information Retrieval","series-title":"Information Retrieval Series","author":"Cambazoglu B. B.","key":"e_1_2_1_9_1"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/11902140_75"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772710"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.780863"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526768"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.342125"},{"volume-title":"Proceedings of the Norsk Informatikkonferance. 143--154","author":"Jonassen S.","key":"e_1_2_1_15_1"},{"volume-title":"Proceedings of the 11th International Conference on Web Information Systems Engineering. 587--601","author":"Jonassen S.","key":"e_1_2_1_16_1"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-35063-4_1"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28997-2_35"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827595287997"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/bxr133"},{"volume-title":"Proceedings of the 2nd International Workshop on Peer-to-Peer Systems. 207--215","author":"Li J.","key":"e_1_2_1_21_1"},{"volume-title":"Proceedings of the 2nd International Conference on Scalable Information Systems. 43:1--43:9.","author":"Lucchese C.","key":"e_1_2_1_22_1"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0164-1212(01)00119-4"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2011.01.028"},{"volume-title":"Proceedings of the 7th International Symposium on String Processing and Information Retrieval. 209--220","author":"MacFarlane A.","key":"e_1_2_1_25_1"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1148170.1148232"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10791-006-9014-4"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/276675.276695"},{"volume-title":"Proceedings of the 18th International Conference of the Chilean Society of Computer Science. 149--157","author":"Ribeiro-Neto B. A.","key":"e_1_2_1_29_1"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2012.01.004"},{"volume-title":"Proceedings of the International Workshop on the Web and Databases.","author":"Suel T.","key":"e_1_2_1_31_1"},{"volume-title":"Proceedings of the 2nd International Conference on Parallel and Distributed Information Systems. 8--17","author":"Tomasic A.","key":"e_1_2_1_32_1"},{"key":"e_1_2_1_33_1","unstructured":"Webber W. 2007. Design and evaluation of a pipelined distributed information retrieval architecture. Master's thesis. University of Melbourne.  Webber W. 2007. Design and evaluation of a pipelined distributed information retrieval architecture. Master's thesis. University of Melbourne."},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526764"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/P2P.2005.7"},{"volume-title":"Proceedings of the 23rd IEEE International Parallel and Distributed Processing Symposium. 1--10","author":"Zhang J.","key":"e_1_2_1_36_1"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132956.1132959"}],"container-title":["ACM Transactions on the Web"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2516633.2516637","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2516633.2516637","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:10:12Z","timestamp":1750234212000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2516633.2516637"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9]]},"references-count":37,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,9]]}},"alternative-id":["10.1145\/2516633.2516637"],"URL":"https:\/\/doi.org\/10.1145\/2516633.2516637","relation":{},"ISSN":["1559-1131","1559-114X"],"issn-type":[{"type":"print","value":"1559-1131"},{"type":"electronic","value":"1559-114X"}],"subject":[],"published":{"date-parts":[[2013,9]]},"assertion":[{"value":"2012-01-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2013-03-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2013-09-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}