{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:35:53Z","timestamp":1750307753296,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2007,11,9]],"date-time":"2007-11-09T00:00:00Z","timestamp":1194566400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2007,11,9]]},"DOI":"10.1145\/1317353.1317368","type":"proceedings-article","created":{"date-parts":[[2007,11,16]],"date-time":"2007-11-16T15:58:50Z","timestamp":1195228730000},"page":"67-72","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Perfect hash functions for large dictionaries"],"prefix":"10.1145","author":[{"given":"Amjad M.","family":"Daoud","sequence":"first","affiliation":[{"name":"Tabuk University, Tabuk, Suadi Arabia"}]}],"member":"320","published-online":{"date-parts":[[2007,11,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/988672.988752"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/0306-4379(90)90001-6"},{"key":"e_1_3_2_1_3_1","unstructured":"Brin S. and Page L. http:\/\/www-db.stanford.edu\/ backrub\/google.html (2002).  Brin S. and Page L. http:\/\/www-db.stanford.edu\/ backrub\/google.html (2002)."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/0898-1221(83)90016-0"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/358027.358051"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/358808.358813"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/28.1.54"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(96)00146-6"},{"key":"e_1_3_2_1_9_1","volume-title":"PH.D. dissertation, Department of Computer Science","author":"Daoud A.M.","year":"1993","unstructured":"Daoud , A.M. Efficient Data Structures for Information Retrieval , PH.D. dissertation, Department of Computer Science , Virginia Polytechnic Institute & State University ( 1993 ). Daoud, A.M. Efficient Data Structures for Information Retrieval, PH.D. dissertation, Department of Computer Science, Virginia Polytechnic Institute & State University (1993)."},{"key":"e_1_3_2_1_11_1","volume-title":"Augmented Order Preserving Perfect Hashing for Information Retrieval, to appear","author":"Daoud A. M.","year":"2004","unstructured":"Daoud , A. M. Augmented Order Preserving Perfect Hashing for Information Retrieval, to appear ( 2004 ). Daoud, A. M. Augmented Order Preserving Perfect Hashing for Information Retrieval, to appear (2004)."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/215206.215335"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/96749.98233"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/129617.129623"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/828.1884"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/358800.358806"},{"key":"e_1_3_2_1_17_1","volume-title":"The Art of Computer Programming","author":"Knuth D. E.","year":"1973","unstructured":"Knuth , D. E. The Art of Computer Programming , Volume 3 , Sorting and Searching, Addison-Wesley Publishing Company , Reading, MA , 1973 . Knuth, D. E. The Art of Computer Programming, Volume 3, Sorting and Searching, Addison-Wesley Publishing Company, Reading, MA, 1973."},{"key":"e_1_3_2_1_18_1","volume-title":"Representing Web Graphs","author":"Raghavan S.","year":"2002","unstructured":"Raghavan S. , and Garcia-Molina , H. Representing Web Graphs , Stanford University ( 2002 ). Raghavan S., and Garcia-Molina, H. Representing Web Graphs, Stanford University (2002)."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(01)00239-3"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3532.3538"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/73007.73041"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/359863.359887"},{"key":"e_1_3_2_1_23_1","unstructured":"http:\/\/www.omlet.org\/phf\/phf2005.html  http:\/\/www.omlet.org\/phf\/phf2005.html"}],"event":{"name":"CIKM07: Conference on Information and Knowledge Management","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","ACM Association for Computing Machinery","SIGIR ACM Special Interest Group on Information Retrieval"],"location":"Lisbon Portugal","acronym":"CIKM07"},"container-title":["Proceedings of the ACM first workshop on CyberInfrastructure: information management in eScience"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1317353.1317368","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1317353.1317368","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:39:17Z","timestamp":1750253957000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1317353.1317368"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,11,9]]},"references-count":22,"alternative-id":["10.1145\/1317353.1317368","10.1145\/1317353"],"URL":"https:\/\/doi.org\/10.1145\/1317353.1317368","relation":{},"subject":[],"published":{"date-parts":[[2007,11,9]]},"assertion":[{"value":"2007-11-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}