Preview

History of File Structure

Satisfactory Essays
Open Document
Open Document
322 Words
Grammar
Grammar
Plagiarism
Plagiarism
Writing
Writing
Score
Score
History of File Structure
History of File Structures
I. Early Work
• Early Work assumed that files were on tape.
• Access was sequential
– The cost of access grew in direct proportion to the size of the file.

II. The emergence of Disks and Indexes
• As files grew very large, sequential access was not a good solution.
• Disks allowed for direct access.
– Indexes made it possible to keep a list of keys and pointers in a small file that could be searched very quickly.
– With the key and pointer, the user had direct access to the large, primary file.

III. The emergence of Tree Structures
• Indexes also have a sequential flavor
• When they grow too much, they also become difficult to manage.
• The idea of using tree structures to manage the index emerged in the early 60’s.
• However, trees can grow very unevenly as records are added and deleted
• Resulting in long searches requiring many disk accesses to find a record.

IV. Balanced Trees
• In 1963, researchers came up with the idea of AVL trees for data in memory.
• However, AVL trees did not apply to files
• Because they work well when tree nodes are composed of single records rather than dozens or hundreds of them.
• In the 1970’s came the idea of B-Trees which require an O(logkN) access time
• Where N is the number of entries in the file and k is the number of entries indexed in a single block of the B-Tree structure
• B-Trees can guarantee that we can find an entry among millions of others with only 3 or 4 trips to the disk.

V. Hash Tables
• Retrieving entries in 3 or 4 accesses is good
• But it does not reach the goal of accessing data with a single request.
• Hashing was a good way to reach this goal with files that do not change size greatly over time.
• Recently, Extendible Dynamic Hashing guarantees one or at most two disk accesses no matter how big a file becomes.

You May Also Find These Documents Helpful

  • Best Essays

    Nt1310 Unit 4 Exercise 1

    • 1486 Words
    • 6 Pages

    As it is evident from the related work discussed in the section 2, when small files are stored on HDFS, disk utilization is not a bottleneck. In general, small file problem occurs when memory of NameNode is highly consumed by the metadata and BlockMap of huge numbers of files. NameNode stores file system metadata in main memory and the metadata of one file takes about 250 bytes of memory. For each block by default three replicas are created and its metadata takes about 368 bytes [9]. Let the number of memory bytes that NameNode consumed by itself be denoted as α. Let the number of memory bytes that are consumed by the BlockMap be denoted as β. The size of an HDFS block is denoted as S. Further assume that there are N…

    • 1486 Words
    • 6 Pages
    Best Essays
  • Good Essays

    ECET 370 Week 5 Lab 5

    • 650 Words
    • 3 Pages

    Exercise 1: Review of the Lecture Content Create a project using the ArrayList class and the Main class provided in DocSharing. The ArrayList class contains implementations of the first three search methods explained in this week's lecture: sequential, sorted, and binary search. The Main class uses these three methods. These programs test the code discussed in the lecture. Compile the project, run it, and review the code that is given carefully.…

    • 650 Words
    • 3 Pages
    Good Essays
  • Good Essays

    Cse 373 Final Note

    • 955 Words
    • 4 Pages

    An ordered or sorted binary tree, is a node based binary tree data structure that has the following properties:…

    • 955 Words
    • 4 Pages
    Good Essays
  • Powerful Essays

    Pt1420 Unit 1 Assignment 2

    • 1305 Words
    • 6 Pages

    Das, D., Gregersen, E., Hosch, L., Lotha, G., Sampaolo, M., Sinha, S. (2014). C++. In Encyclopedia Britannica.…

    • 1305 Words
    • 6 Pages
    Powerful Essays
  • Powerful Essays

    Searching and Sorting Streams and Files Graphics GUI Components and Events Mouse, Keyboard, Sounds, and Images Big-O Analysis of Algorithms The Java Collections Framework Lists and Iterators Stacks and Queues Recursion Revisited Binary Trees Lookup Tables and Hashing Heaps and Priority Queues Design Patterns…

    • 3908 Words
    • 16 Pages
    Powerful Essays
  • Good Essays

    Comp 220

    • 1463 Words
    • 6 Pages

    Pointers also have the requirement that the pointer type must be of the same data type as the variable, or the data that it points to or holds the address of. The power of pointers also hints at the potential complexity of their use, which is why this lab is focused almost entirely on several different aspects and uses of pointers. The lab also introduces pointer arrays and pointers to pointers.…

    • 1463 Words
    • 6 Pages
    Good Essays
  • Good Essays

    9 Which of the following is a feature provided by Medisoft to assist in maintaining data files stored in a system?…

    • 484 Words
    • 4 Pages
    Good Essays
  • Good Essays

    It surprises me that data structures can look simple but once you start creating them it involves a lot of thinking and planning.…

    • 605 Words
    • 3 Pages
    Good Essays
  • Powerful Essays

    Data Base Management System

    • 13596 Words
    • 55 Pages

    Fie lFile Organization Terms & Conceptscomprises a record; A computer system organizes data in a hierarchy t…

    • 13596 Words
    • 55 Pages
    Powerful Essays
  • Good Essays

    Parallel Arrays

    • 427 Words
    • 2 Pages

    Key in saving wasted memory. The nodes of a linked data structure can also be moved individually to different locations without affecting the logical connections between them, unlike arrays. With due care, a process can add or delete nodes to one part of a data structure even while other processes are working on other parts. On the other hand, access to any particular node in a linked data structure requires following a chain of references that stored in it. If the structure has n nodes, and each node contains at most b links, there will be some nodes that cannot be reached in less than log b n steps. For many structures, some nodes may require worst case up to n -1 steps.…

    • 427 Words
    • 2 Pages
    Good Essays
  • Satisfactory Essays

    Coronel PPT Ch01

    • 1962 Words
    • 13 Pages

    ©2015 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part.…

    • 1962 Words
    • 13 Pages
    Satisfactory Essays
  • Satisfactory Essays

    Ai Viva Questions

    • 2988 Words
    • 1 Page

    It is an uninformed search algorithm where the shallowest node in the search tree is expanded first.…

    • 2988 Words
    • 1 Page
    Satisfactory Essays
  • Good Essays

    computer science record

    • 6312 Words
    • 26 Pages

    M.A.M. SCHOOL OF ENGINEERING, SIRUGANUR, TIRUCHIRAPPALLI – 621 105. M.A.M. SCHOOL OF ENGINEERING, SIRUGANUR, TIRUCHIRAPPALLI – 621 105. Department of Computer Science and Engineering Department of Computer Science and Engineering LABORATORY MANUAL – CS 2208 – DATA STRUCTURES LABORATORY LABORATORY MANUAL – CS 2208 – DATA STRUCTURES LABORATORY EX: NO: 1 (a) SINGLY LINKED LIST AIM: Step 3:Stop PROGRAM : To write a Program to implement a single linked list ALGORITHM: Step 1:…

    • 6312 Words
    • 26 Pages
    Good Essays
  • Good Essays

    Cobol

    • 43832 Words
    • 176 Pages

    Table Handling Indexed Tables & Index Names Search & Start Verbs Programs using OCCURS & Screen Section List of Programs…

    • 43832 Words
    • 176 Pages
    Good Essays
  • Powerful Essays

    Modern Database Management

    • 2683 Words
    • 11 Pages

    A stored representation of objects and events that have meaning and importance in the user’s environment.…

    • 2683 Words
    • 11 Pages
    Powerful Essays

Related Topics