AAA-077AAA-133AAA-196AAA-295AAA-377AAA-433AAA-459AAA-470AAA-542AAA-637AAA-676AAA-732AAA-754AAA-777AAA-851AAA-869AAA-881AAA-917AAA-988AAA-993AAS-054AAS-123AAS-169AAS-237AAS-312AAS-336AAS-381AAS-460AAS-480AAS-544AAS-629AAS-691AAS-729AAS-792AAS-804AAS-897AAS-936ABQ-009ABQ-102ABQ-139ABQ-167ABQ-223ABQ-279ABQ-289Q-29ABQ-308ABQ-365ABQ-387ABQ-454700 17ORDER A-407-PCORD WATER PIPE 1/2X92REAR AILERON SKIN0.020 AILERON SKINPP AILERON REAR SKINPP AILERON REAR SKINFRONT AILERON SKINPP AILERON NOSE SKINAILERON SPARAILERON SPAR8/8AAILERON SPAR8/8AAILERON NOSE RIBLEFTAILERON NOSE RIB RGTAILERON RIB LEFTAILERON RIB RIGHTAIL BRKT/ NO HOLESAIL.OTBRD. BRKHTAIL.OTBRD. BRKHT.ORDER A-407-PCNO HOLESAIL.INBRD. BRKHT.AIL.INBRD. BRKHTAIL.INBRD. BRKHT.AILERON SKIN0.020 AILERON SKINAILERON SKIN LEFTAILERON SKIN RIGHTAILERON SPARORDER A-404-LORDER A-404-RORDER A-405-LORDER A-405-RORDER A-406-PCORDER A-407ORD WATER PIPE 1/2X92AIL.STIFF.4 PER LNGTHAILERON SKINAILERON SKINAILERON SKINFRONT AILERON SKINAILERON NOSE SKINAILERON NOSE SKINAILERON TOP SKINAILERON BOTTOM SKINSPARAILERON SPARAILERON NOSE RIBAILERON NOSE RIBAILERON RIBTRAN II. Project DescriptionParts CatalogThis 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 intheir ability to store and retrieve data. In this project, you will build a parts catalog system as a single-usersystem 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 accessingthe data. These two parts should be independent, so that changing to another storage system or anotheruser interface is not too difficult.Your project should allow the user to maintain a parts catalog. A flat-file of part data will beprovided. Your program should begin by loading data from the flat-file into a B+-tree. Once loaded, theuser can query for a particular part number, display the next 10 parts, modify the description of a part, addnew parts, and delete parts. The program should end when the user chooses to exit. Upon ending, the usershould be asked if changes should be saved to the flat-file.DetailsA B+-tree will be used for storage. While B-trees normally make use of the disk drive, forsimplicity our tree will be kept in main memory. The B-tree will allow between 2 and 4 keys per indexnode. Each leaf node can store 16 records.The provided flat-file will contain part data in the following format:Columns1-7Part ID16-80 Part DescriptionOutputAt the end, your program should display the total number of splits, parent splits, fusions, and parentfusions. The tree depth should also be printed.

A B+-tree is a self-balancing tree data structure that maintains sorted data and allows for…

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.

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