We are here with you hands in hands to facilitate your learning & don't appreciate the idea of copying or replicating solutions. Read More>>

Looking For Something at vustudents.ning.com? Click Here to Search

Graded Discussion:


Suppose you are a Software Engineer at a reputed Software house and working on a project of developing a Decision Support System for a very large Organization. Which indexing technique you will use in your DSS?

 Justify your answer with very well defined and sound reasoning.

A concise, coherent and to the point comment is preferred over lengthy comment having irrelevant details. Your comment must not be more than 4-5 lines. Comments, posted on regular Lesson's MDB or sent through email will NOT be considered in any case. For any queries please email at CS614@vu.edu.pk


Best of Luck!

+ Click Here To Join also Our facebook study Group.

..How to Join Subject Study Groups & Get Helping Material?..

See Your Saved Posts Timeline

Views: 2585


+ http://bit.ly/vucodes (Link for Assignments, GDBs & Online Quizzes Solution)

+ http://bit.ly/papersvu (Link for Past Papers, Solved MCQs, Short Notes & More)

Replies to This Discussion

Bitmap index


Inverted Index

read handouts page 232.

Bitmap b n ho skti


each bitmap index
becomes enormous and takes a long time to process during indexing and retrievals.

handouts page 235.

to agr long time leti ha ye to ye kaisy best ho skti ha

Bitmap indexes are widely used in data warehousing environments. The environments typically have large amounts of data and ad hoc queries, but a low level of concurrent DML transactions. For such applications, bitmap indexing provides, reduced response time for large classes of ad hoc queries. Reduced storage requirements compared to other indexing techniques. Dramatic performance gains even on hardware with a relatively small number of CPUs or a small amount of memory. Efficient maintenance during parallel DML and loads. Bitmap Indexes play a key role in responsive knowledge warehouse’s queries. picture indexes are wide employed in knowledge applications, that have massive amounts { of knowledge of information} and queries however a coffee level of coinciding transactions as a result of they need a capability to perform operations on index level before retrieving base data. This accelerates question process staggeringly. Variants of Bitmap Indexes have been introduced to reduce storage requirement and speed up performance. 

An Inverted Index will be the best,because an  inverted index is to allow fast full text seatches, at a cost of increased processing when a document is added to the database. The inverted file may be the database file itself, rather than its index. It is the most popular data structure used in document retrieval systems, used on a large scale for example in search engin. An inverted index (also referred to as postings file or inverted file) is an imdex data structure storing a mapping from content, such as words or numbers, to its locations in a database file, or in a document or a set of documents  it is optimized structure built as primarily for retrieval, with update being only secondary consideration.
Inverted index storage structures can exeed the storage demand of the document collection itself., but its documents collection can be compressed to 10%. so DSS developers are happy with
to trade of index construction time and storage increase for efficient retrival.An inverted index is able to do many accesses in O (1) time at the price of significantly.


Dear Students Don’t wait for solution post your problems here and discuss ... after discussion a perfect solution will come in a result. So, Start it now, replies here give your comments according to your knowledge and understandings....


© 2019   Created by + M.Tariq Malik.   Powered by

Promote Us  |  Report an Issue  |  Privacy Policy  |  Terms of Service