| dc.contributor.advisor | Folk, Michael J. | |
| dc.contributor.author | Patel, Harshad D. | |
| dc.date.accessioned | 2015-08-28T15:49:53Z | |
| dc.date.available | 2015-08-28T15:49:53Z | |
| dc.date.issued | 1987-12-01 | |
| dc.identifier.uri | https://hdl.handle.net/11244/17045 | |
| dc.description.abstract | This thesis Is a discussion and evaluation of both extendible hashing and B+ tree. The study Includes a design and lmplementatlon under the UNIX system. Comparisons and analysis are made using empirical results. | |
| dc.format | application/pdf | |
| dc.language | en_US | |
| dc.publisher | Oklahoma State University | |
| dc.rights | Copyright is held by the author who has granted the Oklahoma State University Library the non-exclusive right to share this material in its institutional repository. Contact Digital Library Services at lib-dls@okstate.edu or 405-744-9161 for the permission policy on the use, reproduction or distribution of this material. | |
| dc.title | Analysis and Comparison of Extendible Hashing and B+ Trees Access Methods | |
| dc.type | text | |
| dc.contributor.committeeMember | Hedrick, G. E. | |
| dc.contributor.committeeMember | George, K. M. | |
| osu.filename | Thesis-1987-P295a.pdf | |
| osu.accesstype | Open Access | |
| dc.description.department | Computing and Information Science | |
| dc.type.genre | Thesis | |
