CORE
🇺🇦Â
 make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
Analysis and Comparison of Extendible Hashing and B+ Trees Access Methods
Authors
Harshad D. Patel
Publication date
1 December 1987
Publisher
'Oklahoma State University Library'
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.Computing and Information Scienc
Similar works
Full text
Open in the Core reader
Download PDF
Available Versions
SHAREOK repository
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:shareok.org:11244/17045
Last time updated on 09/07/2019