A Comparative Evaluation of Indexing Schemes

Simple item page
dc.contributor.authorGuru Prasad, Comarapalyam K.en
dc.contributor.authorRoach, John W.en
dc.contributor.departmentComputer Scienceen
dc.date.accessioned2013-06-19T14:36:12Zen
dc.date.available2013-06-19T14:36:12Zen
dc.date.issued1990en
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
dc.format.mimetypeapplication/pdfen
dc.identifierhttp://eprints.cs.vt.edu/archive/00000190/en
dc.identifier.sourceurlhttp://eprints.cs.vt.edu/archive/00000190/01/TR-90-08.pdfen
dc.identifier.trnumberTR-90-08en
dc.identifier.urihttp://hdl.handle.net/10919/19583en
dc.language.isoenen
dc.publisherDepartment of Computer Science, Virginia Polytechnic Institute & State Universityen
dc.relation.ispartofHistorical Collection(Till Dec 2001)en
dc.rightsIn Copyrighten
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en
dc.titleA Comparative Evaluation of Indexing Schemesen
dc.typeTechnical reporten
dc.type.dcmitypeTexten

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR-90-08.pdf
Size:
1.35 MB
Format:
Adobe Portable Document Format
Download

Collections

Computer Science Technical Reports