A Comparative Evaluation of Indexing Schemes
Guru Prasad, Comarapalyam K.
Roach, John W.
MetadataShow full item record
An empirical experment is reported that compares three indexing techniques used to help answer queries for a medium-sized database. The experiment compares memory and time utilization for B+ trees, superimposed codeword and perfect hashing indexing techniques. Costs for creating and querying the database are compared over a range at different page and buffer sizes for the database. We compare and contract the advantages and disadvantages of the indexing techniques.