Analysis on Four Basic Types of Data Structure in Searching on External Storage

Nang Noon Kham

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.

Keywords: Sequential Ordering, B-tree, Indexing, Hashing, Hash function

How to Cite?: Nang Noon Kham, "Analysis on Four Basic Types of Data Structure in Searching on External Storage", Volume 8 Issue 8, August 2019, International Journal of Science and Research (IJSR), Pages: 611-614, https://www.ijsr.net/getabstract.php?paperid=3081904, DOI: https://dx.doi.org/10.21275/3081904