{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:52:56Z","timestamp":1750308776469,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":35,"publisher":"ACM","license":[{"start":{"date-parts":[[2006,4,13]],"date-time":"2006-04-13T00:00:00Z","timestamp":1144886400000},"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":[[2006,4,13]]},"DOI":"10.1145\/1125170.1125194","type":"proceedings-article","created":{"date-parts":[[2006,5,8]],"date-time":"2006-05-08T21:40:43Z","timestamp":1147124443000},"page":"68-76","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Genetic database optimization"],"prefix":"10.1145","author":[{"given":"Givon","family":"Zirkind","sequence":"first","affiliation":[{"name":"Touro College, Fairleigh Dickinson University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2006,4,13]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Black Paul E. ed. \"B tree\" Dictionary of Algorithms and Data Structures NIST http:\/\/www.nist.gov\/dads\/HTML\/btree.html  Black Paul E. ed. \"B tree\" Dictionary of Algorithms and Data Structures NIST http:\/\/www.nist.gov\/dads\/HTML\/btree.html"},{"key":"e_1_3_2_1_2_1","unstructured":"Black Paul E. ed. \"B* tree\" Dictionary of Algorithms and Data Structures NIST http:\/\/www.nist.gov\/dads\/HTML\/bstartree.html  Black Paul E. ed. \"B* tree\" Dictionary of Algorithms and Data Structures NIST http:\/\/www.nist.gov\/dads\/HTML\/bstartree.html"},{"key":"e_1_3_2_1_3_1","unstructured":"Black Paul E. ed. \"B+ tree\" Dictionary of Algorithms and Data Structures NIST http:\/\/www.nist.gov\/dads\/HTML\/bplustree.html  Black Paul E. ed. \"B+ tree\" Dictionary of Algorithms and Data Structures NIST http:\/\/www.nist.gov\/dads\/HTML\/bplustree.html"},{"key":"e_1_3_2_1_4_1","unstructured":"Black Paul E. ed. \"Complete binary tree\" Dictionary of Algorithms and Data Structures NIST http:\/\/www.nist.gov\/dads\/HTML\/completeBinaryTree.html  Black Paul E. ed. \"Complete binary tree\" Dictionary of Algorithms and Data Structures NIST http:\/\/www.nist.gov\/dads\/HTML\/completeBinaryTree.html"},{"volume-title":"John Wiley & Sons","year":"2002","author":"Massiglia Richard","key":"e_1_3_2_1_5_1"},{"key":"e_1_3_2_1_6_1","unstructured":"Campbell A. Malcolm & Heyer Laurie J. Genomics Proteomics & Bioinformatics Benjamin Cummings (Publisher) 2003 Glossary.  Campbell A. Malcolm & Heyer Laurie J. Genomics Proteomics & Bioinformatics Benjamin Cummings (Publisher) 2003 Glossary."},{"volume-title":"Clements, Alan; The Principles of Computer Hardware","year":"2000","key":"e_1_3_2_1_7_1"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/356770.356776"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/602259.602261"},{"key":"e_1_3_2_1_10_1","unstructured":"Fang Mark; \"http:\/\/www.hc.uic.edu\/mike\/IR_report.pdf\"  Fang Mark; \"http:\/\/www.hc.uic.edu\/mike\/IR_report.pdf\""},{"key":"e_1_3_2_1_11_1","unstructured":"Francom Marty; B+TREE SOURCE CODE FOR VB 4.0+.  Francom Marty; B+TREE SOURCE CODE FOR VB 4.0+."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/274946.274948"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/274946.274948"},{"volume-title":"No Starch Press","year":"2005","author":"Code Write Portable","key":"e_1_3_2_1_14_1"},{"volume-title":"No Starch Press","year":"2005","author":"Code Write Portable","key":"e_1_3_2_1_15_1"},{"volume-title":"No Starch Press","year":"2005","author":"Code Write Portable","key":"e_1_3_2_1_16_1"},{"volume-title":"Angela Burgess (Publisher)","year":"2004","author":"The Institute of Electrical and Electronics Engineers, Inc., Software Engineering Body of Knowledge","key":"e_1_3_2_1_17_1"},{"key":"e_1_3_2_1_18_1","unstructured":"Kernighan Brian W. & Ritichie Dennis; The C Programming Language.   Kernighan Brian W. & Ritichie Dennis; The C Programming Language."},{"volume-title":"Oxford University Press","year":"2002","author":"Arthur","key":"e_1_3_2_1_19_1"},{"key":"e_1_3_2_1_20_1","unstructured":"ibid. pg. 15.  ibid. pg. 15."},{"key":"e_1_3_2_1_21_1","unstructured":"ibid. pgs 8--11.  ibid. pgs 8--11."},{"key":"e_1_3_2_1_22_1","unstructured":"ibid. pgs 15--19  ibid. pgs 15--19"},{"key":"e_1_3_2_1_23_1","unstructured":"ibid. pgs 10 119.  ibid. pgs 10 119."},{"key":"e_1_3_2_1_24_1","unstructured":"ibid. pg 2.  ibid. pg 2."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/603867.603878"},{"volume-title":"Microsoft Press","year":"1999","author":"Gold Rush After","key":"e_1_3_2_1_26_1"},{"volume-title":"SIGGRAPH Series","year":"1999","author":"File Formats Compressed Image","key":"e_1_3_2_1_27_1"},{"key":"e_1_3_2_1_28_1","unstructured":"Mitchel Frank; http:\/\/c.snippets.org\/snip_lister.php?fname=bushv055.txt  Mitchel Frank; http:\/\/c.snippets.org\/snip_lister.php?fname=bushv055.txt"},{"key":"e_1_3_2_1_29_1","unstructured":"Mix Software Inc. Power C ANSI Standard High Performance C Compiler 1993 Introduction.  Mix Software Inc. Power C ANSI Standard High Performance C Compiler 1993 Introduction."},{"key":"e_1_3_2_1_30_1","unstructured":"Online Computing Dictionary http:\/\/www.instantweb.com Entry for 'Linked List'  Online Computing Dictionary http:\/\/www.instantweb.com Entry for 'Linked List'"},{"key":"e_1_3_2_1_31_1","unstructured":"Online Computing Dictionary http:\/\/www.instantweb.com Entry for 'Bloatware'  Online Computing Dictionary http:\/\/www.instantweb.com Entry for 'Bloatware'"},{"volume-title":"John Wiley & Sons","year":"2002","author":"Dilip","key":"e_1_3_2_1_32_1"},{"key":"e_1_3_2_1_33_1","first-page":"3","author":"Rudometov Victor","year":"2002","journal-title":"A-LIST Publishing"},{"key":"e_1_3_2_1_34_1","unstructured":"Stephens Rod; Visual Basic Algorithms John Wiley & Sons Inc. 1995 \"B_PLUS.BAS\" public domain source code for B+Tree example progra.  Stephens Rod; Visual Basic Algorithms John Wiley & Sons Inc. 1995 \"B_PLUS.BAS\" public domain source code for B+Tree example progra."},{"key":"e_1_3_2_1_35_1","unstructured":"Watters Aaron; http:\/\/starship.python.net\/crew\/aaron_watters\/bplustree\/bplustree.py.txt  Watters Aaron; http:\/\/starship.python.net\/crew\/aaron_watters\/bplustree\/bplustree.py.txt"}],"event":{"name":"SIGMIS-CPR06: Forty Four Years of Computer Personnel Research: Achievements, Challenges and the Future","sponsor":["SIGMIS ACM Special Interest Group on Management Information Systems","ACM Association for Computing Machinery"],"location":"Claremont California USA","acronym":"SIGMIS-CPR06"},"container-title":["Proceedings of the 2006 ACM SIGMIS CPR conference on computer personnel research: Forty four years of computer personnel research: achievements, challenges &amp; the future"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1125170.1125194","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1125170.1125194","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:22:39Z","timestamp":1750278159000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1125170.1125194"}},"subtitle":["how data inspection and consideration, provides for index compression and record access optimization of genetic databases"],"short-title":[],"issued":{"date-parts":[[2006,4,13]]},"references-count":35,"alternative-id":["10.1145\/1125170.1125194","10.1145\/1125170"],"URL":"https:\/\/doi.org\/10.1145\/1125170.1125194","relation":{},"subject":[],"published":{"date-parts":[[2006,4,13]]},"assertion":[{"value":"2006-04-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}