Show simple item record

dc.contributor.authorGuru Prasad, Comarapalyam K.en_US
dc.contributor.authorRoach, John W.en_US
dc.date.accessioned2013-06-19T14:36:12Z
dc.date.available2013-06-19T14:36:12Z
dc.date.issued1990
dc.identifierhttp://eprints.cs.vt.edu/archive/00000190/en_US
dc.identifier.urihttp://hdl.handle.net/10919/19583
dc.description.abstractAn 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.en_US
dc.format.mimetypeapplication/pdfen_US
dc.publisherDepartment of Computer Science, Virginia Polytechnic Institute & State Universityen_US
dc.relation.ispartofHistorical Collection(Till Dec 2001)en_US
dc.titleA Comparative Evaluation of Indexing Schemesen_US
dc.typeTechnical reporten_US
dc.identifier.trnumberTR-90-08en_US
dc.type.dcmitypeTexten_US
dc.identifier.sourceurlhttp://eprints.cs.vt.edu/archive/00000190/01/TR-90-08.pdf


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record