ABSTRACT
Databases are designed to maintain data for businesses, governments, and individuals. User requirements continue to increase and database capacity and efficiency must improve constantly to meet such requirements. This chapter discusses applications of B trees, bloomjoins, and the CouchDB structure to resolve search-related database issues. Index compilation becomes easy what a database is fixed. However, if a database changes over time, index management becomes complex. B trees can reduce the frequency of disk access. Search, insert, delete, max, and min require O(h) accesses where h is tree height. The high of a B tree can be reduced by applying the largest key possible to its nodes. B trees utilize only half their interior nodes t minimize time requirements. B trees can also handle any number of insertions and deletions. A bloomjoin is a algorithm used for combining database attributes in distributed environments.
