Guru Prasad, Comarapalyam K.Roach, John W.2013-06-192013-06-191990http://hdl.handle.net/10919/19583An 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.application/pdfenIn CopyrightTechnical reportTR-90-08http://eprints.cs.vt.edu/archive/00000190/01/TR-90-08.pdf