Rate the Article: Analysis on Four Basic Types of Data Structure in Searching on External Storage, IJSR, Call for Papers, Online Journal
International Journal of Science and Research (IJSR)

International Journal of Science and Research (IJSR)
Call for Papers | Fully Refereed | Open Access | Double Blind Peer Reviewed

ISSN: 2319-7064

Downloads: 124 | Views: 255 | Weekly Hits: ⮙1 | Monthly Hits: ⮙1

Comparative Studies | Computer Science & Engineering | Burma | Volume 8 Issue 8, August 2019 | Rating: 6.8 / 10


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


Edition: Volume 8 Issue 8, August 2019,


Pages: 611 - 614



Rate this Article


Select Rating (Lowest: 1, Highest: 10)

5

Your Comments (Only high quality comments will be accepted.)

Characters: 0

Your Full Name:


Your Valid Email Address:


Verification Code will appear in 2 Seconds ... Wait

Top