Genetic database optimization: how data inspection and consideration, provides for index compression and record access optimization of genetic databases

• Authors: Givon Zirkind
• Venue: Proceedings of the 2006 ACM SIGMIS CPR conference on computer personnel research: Forty four years of computer personnel research: achievements, challenges & the future
• Year: 2006

With the many advances in computer hardware, the constant and historical challenges of optimization in processing and data storage appeared to have diminished if not disappeared almost entirely. However, even as hard drives grow larger and larger, while prices keep dropping; and the same occurring to memory; computer programs have turned more and more into bloatware - bringing computer usage back to its starting point and original engineering issues of efficiency. [12] Likewise, (CPU) processing speed appeared to have made efficiency and streamlining of program code, virtually a non-issue. Again, however, the relatively new field of genetic research has provided the perfect regeneration of the classical challenges to computer engineers - efficient programming, streamlined code, optimization for processing speed and maximum use of data storage. Genetic research requires maximum optimization of programming and data storage access because, genetic research uses extremely large databases, with extremely large indexes, with complex search criteria, with an extremely large number of inquiries and searches are commonly initiated remotely. Often, search requests are initiated over long geographic distances. [The most commonly used, popular and information rich genetic databases are The National Center for Biotechnology (USA); the EMBL Data Library, European Bioinformatics Institute, UK and; DNA Data Bank of Japan. [19] To improve database performance, indexing access speed, and reduce index size, the author developed a new, genetic database, herein discussed.