{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,2]],"date-time":"2023-01-02T05:56:19Z","timestamp":1672638979497},"reference-count":15,"publisher":"Association for Computing Machinery (ACM)","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["ACM J. Exp. Algorithmics"],"published-print":{"date-parts":[[2022,12,31]]},"abstract":"\n This article proposes an algorithm,\n sequential search based on linear collisions<\/jats:bold>\n (\n SSLC<\/jats:bold>\n ), based on Poisson probability distribution. SSLC works on large static volumes of data, whose keys are ordered and uniformly distributed. We proved that it takes a constant execution time with high probability. Experimental validation focuses on two metrics\u2014processing time and memory resources. We compared SSLC with perfect hashing over various datasets. The experimentation reveals that our algorithm is three times faster with the use of three times fewer memory resources than perfect hashing. Its main contribution is to demonstrate that simple routines can have more powerful computational results.\n <\/jats:p>","DOI":"10.1145\/3497876","type":"journal-article","created":{"date-parts":[[2022,3,17]],"date-time":"2022-03-17T11:10:50Z","timestamp":1647515450000},"page":"1-15","source":"Crossref","is-referenced-by-count":0,"title":["SSLC: A Search Algorithm\u00a0Based on Linear Collisions and Poisson Probability Distribution"],"prefix":"10.1145","volume":"27","author":[{"given":"Marcelo Vaz","family":"Netto","sequence":"first","affiliation":[{"name":"The National Telecommunications Agency (ANATEL), S\u00e3o Paulo, Brazil"}]},{"ORCID":"http:\/\/orcid.org\/0000-0001-9239-9239","authenticated-orcid":false,"given":"Sahudy Montenegro","family":"Gonz\u00e1lez","sequence":"additional","affiliation":[{"name":"Department of Computer Science (DComp-So), Federal University of S\u00e3o Carlos (UFSCar), Sorocaba, S\u00e3o Paulo, Brazil"}]}],"member":"320","published-online":{"date-parts":[[2022,3,17]]},"reference":[{"key":"e_1_3_1_2_2","doi-asserted-by":"crossref","first-page":"682","DOI":"10.1007\/978-3-642-04128-0_61","volume-title":"Algorithms\u2014ESA (European Symposium on Algorithms) 2009","author":"Belazzougui Djamal","year":"2009","unstructured":"Djamal Belazzougui, Fabiano C. Botelho, and Martin Dietzfelbinger. 2009. Hash, Displace, and Compress. In Algorithms\u2014ESA (European Symposium on Algorithms) 2009, Amos Fiat and Peter Sanders (Eds.). Springer, Berlin, 682\u2013693."},{"key":"e_1_3_1_3_2","doi-asserted-by":"publisher","DOI":"10.1140\/epjds\/s13688-015-0046-0"},{"key":"e_1_3_1_4_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2019.102544"},{"key":"e_1_3_1_5_2","volume-title":"Introduction to Algorithms (3rd ed.)","author":"Cormen Thomas H.","year":"2009","unstructured":"Thomas H. Cormen, Charles Eric Leiserson, Ronald L. Rivest, and Clifford Stein. 2009. Introduction to Algorithms (3rd ed.). MIT Press, Cambridge."},{"key":"e_1_3_1_6_2","doi-asserted-by":"publisher","DOI":"10.3390\/a12060114"},{"key":"e_1_3_1_7_2","volume-title":"Handbook of the Poisson Distribution","author":"Haight Frank A.","year":"1967","unstructured":"Frank A. Haight. 1967. Handbook of the Poisson Distribution. John Wiley & Sons."},{"key":"e_1_3_1_8_2","volume-title":"Introduction to Operations Research (7th ed.)","author":"Hillier Frederick S.","year":"2001","unstructured":"Frederick S. Hillier and Gerald J. Lieberman. 2001. Introduction to Operations Research (7th ed.). McGraw-Hill, New York, NY."},{"key":"e_1_3_1_9_2","doi-asserted-by":"publisher","DOI":"10.5555\/1296199"},{"key":"e_1_3_1_10_2","doi-asserted-by":"publisher","DOI":"10.15866\/irecos.v13i1.16861"},{"key":"e_1_3_1_11_2","doi-asserted-by":"publisher","DOI":"10.1080\/00949659008811246"},{"key":"e_1_3_1_12_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.envsoft.2015.02.018"},{"key":"e_1_3_1_13_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.softx.2016.12.001"},{"key":"e_1_3_1_14_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ress.2018.12.010"},{"key":"e_1_3_1_15_2","article-title":"Modified binary search algorithm for duplicate elements","volume":"2","author":"Thwe Phyu","year":"2014","unstructured":"Phyu Thwe, Lai Wi, and Win Kyi. 2014. Modified binary search algorithm for duplicate elements. International Journal of Computer & Communication Engineering Research (IJCCER) 2 (Mar. 2014).","journal-title":"International Journal of Computer & Communication Engineering Research (IJCCER)"},{"key":"e_1_3_1_16_2","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2011.2165336"}],"container-title":["ACM Journal of Experimental Algorithmics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3497876","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,2]],"date-time":"2023-01-02T01:11:31Z","timestamp":1672621891000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3497876"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,17]]},"references-count":15,"alternative-id":["10.1145\/3497876"],"URL":"http:\/\/dx.doi.org\/10.1145\/3497876","relation":{},"ISSN":["1084-6654","1084-6654"],"issn-type":[{"value":"1084-6654","type":"print"},{"value":"1084-6654","type":"electronic"}],"subject":["Theoretical Computer Science"],"published":{"date-parts":[[2022,3,17]]}}}