Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

Your client asks you to design a Data Storage scheme for a library data system under the following assumptions: -Data system contains hundreds of thousands

Your client asks you to design a Data Storage scheme for a library data system under the following assumptions: -Data system contains hundreds of thousands of large data records (consider the range of 600,000 as an example) -The initial file is available sorted. -In terms of frequency, you expect many insertions/deletions and queries involving multiple attributes performed each second. -Queries are sent frequently and in real-time using these field attributes of the record: ISBN number, Title, and Author fields. -Queries are sent occasionally using these field attributes of the record: Publisher, and Subject. -The entire system is archived monthly. -There is no requirement for printing the file in order. -You may make reasonable assumptions about hardware availability. Sort types: +Exchange +Selection +Insertion +Merge +Bubble +QuickSort +Heap +Binary Tree +Shell +Address Calculation +Straight 2-way Merge +Natural Merge +Radix Things to consider these points in choosing Sort types: -size of data -order of data -distribution of data -re-use of existing code -programmer time -frequency of searching -how is the data used? -efficiency of sorts available -space requirements Search strategies using Sorted data: +Sequential (native or brute-force) +Binary +Interpolation +Indexed-Sequential +Search Trees +must maintain sorted order when performing Insertions/Deletions. Search strategies using Non-sorted data: +Sequential (brute-force) +Transposition +Move-to-the-Front (cousin to Transposition) +Hashing Things to consider these points in choosing Search strategies: -size of data -distribution of data -re-use of existing code -programmer time -frequency of searching -number of search types -search strategies exploit the file organization to efficiently find items -it is common to search for items NOT in file, in order to prevent duplicates. -Nonsorted items does not necessarily mean unorganized. ? QUESTION: What do you propose as the data storage scheme, and why? Consider which Sort types and Search strategy algorithms you would use considering the given factors, and why?

?

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Machine Learning And Knowledge Discovery In Databases European Conference Ecml Pkdd 2014 Nancy France September 15 19 2014 Proceedings Part 3 Lnai 8726

Authors: Toon Calders ,Floriana Esposito ,Eyke Hullermeier ,Rosa Meo

2014th Edition

3662448440, 978-3662448441

More Books

Students also viewed these Databases questions