Analysis on Four Basic Types of Data Structure in Searching on External Storage
Journal: International Journal of Science and Research (IJSR) (Vol.8, No. 8)Publication Date: 2019-08-05
Authors : Nang Noon Kham;
Page : 611-614
Keywords : Sequential Ordering; B-tree; Indexing; Hashing; Hash function;
Abstract
The idea behind this article is to give an overview of a simple approach to organizing data in external storage rather than main memory and their search method with pseudo code. Searching is common fundamental operation and solve to searching problem in a different fields. This paper is presents the basic type of searching pseudo code like sequential ordering, b-tree, indexing, hashing for external storage and focus on how many disk access are necessary than on how many individual records they are.
Other Latest Articles
- Study of Polymorphism of COL1A1 G2046T in Girls with Juvenile Dysmenorrhe Depending on the Presence of Connective Tissue Dysplasia in the Uzbek Population
- Vitamin D Insufficiency and Thyroid Capacity in Postmenopausal Women
- Nature and Energy Resources
- Teach Differently and Learn Differently: Towards an Integration of Techno Pedagogy at the University of Lubumbashi
- Effect of Zinc Levels and Moisture Regimes on Yield and Economics of Direct Seeded Rice
Last modified: 2021-06-28 18:22:28