USING C++ In the previous part, your program processes the database (meaning, th

Question

USING C++

In the previous part, your program processes the database (meaning, the list of text files in the current folder) anew each time it is used to perform search. This clearly cannot scale. Can you think of ways where the program doesn't have to process the entire database everytime a search is performed?

So then

will process the database, saving the relevant info, and

will behave as before (except now it won't have to process the database from scratch every time a search is performed). Briefly describe your solution.

Is it any faster?

Explanation / Answer

Answer is as follows :

Yes, You can use indexing mehtod to make search on the databse i.e. list of files in particular folder andsaving the relenant information. Use indexing is much difficult but it is efficcient to make search of files. You can store the previous perfomed search with index seaarch and next time search would be begion from that part only i.e. saved before.

According to me you can't use sequential search purpose i.e. behave as before except would not process database for every search. it is unusefull method and it gets too slow due to processing of large data.

Yes, Indexing method is more fast as compared to previously used search purpose beecause it used linked list and register to store the values so it make searching easy and more fast than sequential.

if there is any query please ask in comments....

Related Questions

Navigate

• Browse (All)
• Browse U
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.