{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:21:45Z","timestamp":1740122505149,"version":"3.37.3"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2024,5,23]],"date-time":"2024-05-23T00:00:00Z","timestamp":1716422400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,5,23]],"date-time":"2024-05-23T00:00:00Z","timestamp":1716422400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["DP220102212"],"award-info":[{"award-number":["DP220102212"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["RGPIN-03882"],"award-info":[{"award-number":["RGPIN-03882"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2024,10]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In situations where every item in a data set must be compared with every other item in the set, it may be desirable to store the data across a number of machines in such a way that any two data items are stored together on at least one machine. One way to evaluate the efficiency of such a distribution is by the largest fraction of the data it requires to be allocated to any one machine. The <jats:italic>all-to-all comparison (ATAC) data limit for<\/jats:italic><jats:italic>m<\/jats:italic><jats:italic>machines<\/jats:italic> is a measure of the minimum of this value across all possible such distributions. In this paper we further the study of ATAC data limits. We begin by investigating the data limits achievable using various classes of combinatorial designs. In particular, we examine the cases of transversal designs and projective Hjelmslev planes. We then observe relationships between data limits and the previously studied combinatorial parameters of <jats:italic>fractional matching numbers<\/jats:italic> and <jats:italic>covering numbers<\/jats:italic>. Finally, we prove a lower bound on the ATAC data limit that improves on one of Hall, Kelly and Tian, and examine the special cases where equality in this bound is possible.<\/jats:p>","DOI":"10.1007\/s10623-024-01418-6","type":"journal-article","created":{"date-parts":[[2024,5,23]],"date-time":"2024-05-23T02:01:33Z","timestamp":1716429693000},"page":"2863-2879","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Bounds on data limits for all-to-all comparison from combinatorial designs"],"prefix":"10.1007","volume":"92","author":[{"given":"Joanne","family":"Hall","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9971-7148","authenticated-orcid":false,"given":"Daniel","family":"Horsley","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Douglas R.","family":"Stinson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,5,23]]},"reference":[{"key":"1418_CR1","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1112\/plms\/83.3.532","volume":"83","author":"RC Baker","year":"2001","unstructured":"Baker R.C., Harman G., Pintz J.: The difference between consecutive primes. II. Proc. Lond. Math. Soc. 83, 532\u2013562 (2001).","journal-title":"Proc. Lond. Math. Soc."},{"key":"1418_CR2","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1023\/A:1024140122167","volume":"29","author":"J Bierbrauer","year":"2003","unstructured":"Bierbrauer J., Marcugini S., Pambianco F.: Projective planes, coverings and a network problem. Des. Codes Cryptogr. 29, 71\u201389 (2003).","journal-title":"Des. Codes Cryptogr."},{"key":"1418_CR3","doi-asserted-by":"crossref","unstructured":"Blokhuis A., Jungnickel D., Schmidt B.: On a class of symmetric divisible designs which are almost projective planes. In: Finite Geometries. Developments in Mathematics, vol. 3, pp. 27\u201334. Springer, Boston (2001).","DOI":"10.1007\/978-1-4613-0283-4_2"},{"key":"1418_CR4","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1214\/aoms\/1177729382","volume":"23","author":"RC Bose","year":"1952","unstructured":"Bose R.C., Connor W.S.: Combinatorial properties of group divisible incomplete block designs. Ann. Math. Stat. 23, 367\u2013383 (1952).","journal-title":"Ann. Math. Stat."},{"key":"1418_CR5","doi-asserted-by":"publisher","first-page":"88","DOI":"10.4153\/CJM-1949-009-2","volume":"1","author":"RH Bruck","year":"1949","unstructured":"Bruck R.H., Ryser H.J.: The nonexistence of certain finite projective planes. Can. J. Math. 1, 88\u201393 (1949).","journal-title":"Can. J. Math."},{"key":"1418_CR6","first-page":"1277","volume":"51","author":"NG De Bruijn","year":"1948","unstructured":"De Bruijn N.G., Erd\u0151s P.: On a combinatorial problem. Nederl. Akad. Wetensch. Proc. 51, 1277\u20131279 (1948).","journal-title":"Nederl. Akad. Wetensch. Proc."},{"key":"1418_CR7","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/S0021-9800(70)80066-7","volume":"9","author":"DA Drake","year":"1970","unstructured":"Drake D.A.: On $$n$$-uniform Hjelmslev planes. J. Comb. Theory 9, 267\u2013288 (1970).","journal-title":"J. Comb. Theory"},{"key":"1418_CR8","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/BF02579271","volume":"1","author":"Z F\u00fcredi","year":"1981","unstructured":"F\u00fcredi Z.: Maximum degree and fractional matchings in uniform hypergraphs. Combinatorica 1, 155\u2013162 (1981).","journal-title":"Combinatorica"},{"key":"1418_CR9","first-page":"365","volume-title":"The CRC Handbook of Combinatorial Designs","author":"DM Gordon","year":"2007","unstructured":"Gordon D.M., Stinson D.R.: Coverings. In: Colbourn C.J., Dinitz J.H. (eds.) The CRC Handbook of Combinatorial Designs, 2nd edn, pp. 365\u2013373. CRC Press, Boca Raton (2007).","edition":"2"},{"key":"1418_CR10","unstructured":"Hall J.L., Kelly W.A., Tian Y.-C.: Optimal data distribution for big-data all-to-all comparison using finite projective and affine planes. arXiv:2308.15000."},{"key":"1418_CR11","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/978-3-319-17729-8_11","volume-title":"Algebraic Design Theory and Hadamard Matrices","author":"JL Hall","year":"2015","unstructured":"Hall J.L., Rao A.: An algorithm for constructing Hjelmslev planes. In: Colbourn C.J. (ed.) Algebraic Design Theory and Hadamard Matrices, pp. 137\u2013147. Springer, Berlin (2015)."},{"key":"1418_CR12","first-page":"285","volume":"71","author":"G Hanssens","year":"1989","unstructured":"Hanssens G., Van Maldeghem H.: A universal construction for projective Hjelmslev planes of level $$n$$. Compositio Math. 71, 285\u2013294 (1989).","journal-title":"Compositio Math."},{"key":"1418_CR13","doi-asserted-by":"publisher","first-page":"1117","DOI":"10.4153\/CJM-1989-049-4","volume":"41","author":"CWH Lam","year":"1989","unstructured":"Lam C.W.H., Thiel L., Swiercz S.: The non-existence of finite projective planes of order 10. Can. J. Math. 41, 1117\u20131123 (1989).","journal-title":"Can. J. Math."},{"key":"1418_CR14","first-page":"199","volume":"8","author":"WH Mills","year":"1979","unstructured":"Mills W.H.: Covering designs. I. Coverings by a small number of subsets. Ars Comb. 8, 199\u2013315 (1979).","journal-title":"Ars Comb."},{"key":"1418_CR15","volume-title":"Combinatorial Designs: Constructions and Analysis","author":"DR Stinson","year":"2004","unstructured":"Stinson D.R.: Combinatorial Designs: Constructions and Analysis. Springer, Berlin (2004)."},{"key":"1418_CR16","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.jpdc.2016.04.008","volume":"93","author":"Y-F Zhang","year":"2016","unstructured":"Zhang Y.-F., Tian Y.-C., Fidge C., Kelly W.: Data-aware task scheduling for all-to-all comparison problems in heterogeneous distributed systems. J. Parallel Distrib. Comput. 93, 87\u2013101 (2016).","journal-title":"J. Parallel Distrib. Comput."},{"key":"1418_CR17","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1016\/j.future.2016.08.020","volume":"67","author":"Y-F Zhang","year":"2017","unstructured":"Zhang Y.-F., Tian Y.-C., Kelly W., Fidge C.: Scalable and efficient data distribution for distributed computing of all-to-all comparison problems. Future Gener. Comput. Syst. 67, 152\u2013162 (2017).","journal-title":"Future Gener. Comput. Syst."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-024-01418-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-024-01418-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-024-01418-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,18]],"date-time":"2024-09-18T20:18:25Z","timestamp":1726690705000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-024-01418-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,23]]},"references-count":17,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2024,10]]}},"alternative-id":["1418"],"URL":"https:\/\/doi.org\/10.1007\/s10623-024-01418-6","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2024,5,23]]},"assertion":[{"value":"16 September 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 February 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 April 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 May 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"We have no conflicts of interest or competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interest"}}]}}