Overview: This project consists of two parts: a B+-tree for storing parts data and a user interface for accessing the data. These two parts should be independent, so that changing to another storage system or another user interface is not too difficult. Your project should allow the user to maintain a parts catalog. A flat-file of part data will be provided. Your program should begin by loading data from the flat-file into a B+-tree. Once loaded, the user can query for a particular part number, display the next 10 parts, modify the description of a part, add new parts, and delete parts. The program should end when the user chooses to exit. Upon ending, the user should be asked if changes should be saved to the flat-file. Details A B+-tree will be used for storage. While B-trees normally make use of the disk drive, for simplicity our tree will be kept in main memory. The B-tree will allow between 2 and 4 keys per index node. Each leaf node can store 16 records. The provided flat-file will contain part data in the following format: Columns 1-7 Part ID 16-80 Part Description Output At the end, your program should display the total number of splits, parent splits, fusions, and parent fusions. The tree depth should also be printed.
Overview: This project consists of two parts: a B+-tree for storing parts data and a user interface for accessing the data. These two parts should be independent, so that changing to another storage system or another user interface is not too difficult. Your project should allow the user to maintain a parts catalog. A flat-file of part data will be provided. Your program should begin by loading data from the flat-file into a B+-tree. Once loaded, the user can query for a particular part number, display the next 10 parts, modify the description of a part, add new parts, and delete parts. The program should end when the user chooses to exit. Upon ending, the user should be asked if changes should be saved to the flat-file. Details A B+-tree will be used for storage. While B-trees normally make use of the disk drive, for simplicity our tree will be kept in main memory. The B-tree will allow between 2 and 4 keys per index node. Each leaf node can store 16 records. The provided flat-file will contain part data in the following format: Columns 1-7 Part ID 16-80 Part Description Output At the end, your program should display the total number of splits, parent splits, fusions, and parent fusions. The tree depth should also be printed.
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Concept explainers
Types of Linked List
A sequence of data elements connected through links is called a linked list (LL). The elements of a linked list are nodes containing data and a reference to the next node in the list. In a linked list, the elements are stored in a non-contiguous manner and the linear order in maintained by means of a pointer associated with each node in the list which is used to point to the subsequent node in the list.
Linked List
When a set of items is organized sequentially, it is termed as list. Linked list is a list whose order is given by links from one item to the next. It contains a link to the structure containing the next item so we can say that it is a completely different way to represent a list. In linked list, each structure of the list is known as node and it consists of two fields (one for containing the item and other one is for containing the next item address).
Question
Transcribed Image Text:AAA-077
AAA-133
AAA-196
AAA-295
AAA-377
AAA-433
AAA-459
AAA-470
AAA-542
AAA-637
AAA-676
AAA-732
AAA-754
AAA-777
AAA-851
AAA-869
AAA-881
AAA-917
AAA-988
AAA-993
AAS-054
AAS-123
AAS-169
AAS-237
AAS-312
AAS-336
AAS-381
AAS-460
AAS-480
AAS-544
AAS-629
AAS-691
AAS-729
AAS-792
AAS-804
AAS-897
AAS-936
ABQ-009
ABQ-102
ABQ-139
ABQ-167
ABQ-223
ABQ-279
ABQ-289
Q-29
ABQ-308
ABQ-365
ABQ-387
ABQ-454
700 17
ORDER A-407-PC
ORD WATER PIPE 1/2X92
REAR AILERON SKIN
0.020 AILERON SKIN
PP AILERON REAR SKIN
PP AILERON REAR SKIN
FRONT AILERON SKIN
PP AILERON NOSE SKIN
AILERON SPAR
AILERON SPAR
8/8A
AILERON SPAR
8/8A
AILERON NOSE RIB
LEFT
AILERON NOSE RIB RGT
AILERON RIB LEFT
AILERON RIB RIGHT
AIL BRKT/ NO HOLES
AIL.OTBRD. BRKHT
AIL.OTBRD. BRKHT.
ORDER A-407-PC
NO HOLES
AIL.INBRD. BRKHT.
AIL.INBRD. BRKHT
AIL.INBRD. BRKHT.
AILERON SKIN
0.020 AILERON SKIN
AILERON SKIN LEFT
AILERON SKIN RIGHT
AILERON SPAR
ORDER A-404-L
ORDER A-404-R
ORDER A-405-L
ORDER A-405-R
ORDER A-406-PC
ORDER A-407
ORD WATER PIPE 1/2X92
AIL.STIFF.4 PER LNGTH
AILERON SKIN
AILERON SKIN
AILERON SKIN
FRONT AILERON SKIN
AILERON NOSE SKIN
AILERON NOSE SKIN
AILERON TOP SKIN
AILERON BOTTOM SKIN
SPAR
AILERON SPAR
AILERON NOSE RIB
AILERON NOSE RIB
AILERON RIB
TRAN
Transcribed Image Text:II. Project Description
Parts Catalog
This project builds a parts catalog using a B-tree for storage.
Introduction:
Today a parts catalog would be built using a database for storage. Databases are very versatile in
their ability to store and retrieve data. In this project, you will build a parts catalog system as a single-user
system without the use of a database. Instead, you will create a B+-tree and store the parts data in it.
Overview:
This project consists of two parts: a B+-tree for storing parts data and a user interface for accessing
the data. These two parts should be independent, so that changing to another storage system or another
user interface is not too difficult.
Your project should allow the user to maintain a parts catalog. A flat-file of part data will be
provided. Your program should begin by loading data from the flat-file into a B+-tree. Once loaded, the
user can query for a particular part number, display the next 10 parts, modify the description of a part, add
new parts, and delete parts. The program should end when the user chooses to exit. Upon ending, the user
should be asked if changes should be saved to the flat-file.
Details
A B+-tree will be used for storage. While B-trees normally make use of the disk drive, for
simplicity our tree will be kept in main memory. The B-tree will allow between 2 and 4 keys per index
node. Each leaf node can store 16 records.
The provided flat-file will contain part data in the following format:
Columns
1-7
Part ID
16-80 Part Description
Output
At the end, your program should display the total number of splits, parent splits, fusions, and parent
fusions. The tree depth should also be printed.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 3 steps
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education