Latest Activity In Study Groups

Join Your Study Groups

VU Past Papers, MCQs and More

We non-commercial site working hard since 2009 to facilitate learning Read More. We can't keep up without your support. Donate.

GDB of CS403 will be launched on 15th of July 2013 (15-07-2013) and will last for 48 hours only.

GDB_CS403_1 Dated: Jul 09, 13

Dear Students!

Please Note that GDB of CS403 will be launched on 15th of July 2013 (15-07-2013) and will last for 48 hours only.

The topic will be as follows:

A company is developing a database system containing information about cities, towns, and villages in the country. The number of cities, towns, and villages are in thousands and the database program should allow users to search a particular place by name. Users should also be able to search all places that match a particular value or range of values for attributes such as location or population size. This particular feature is known as a range query.

A reasonable database system must answer queries quickly enough to satisfy a typical user. For an exact-match query, a few seconds is satisfactory. If the database is meant to support range queries that can return many cities that match the query specification, the entire operation may be allowed to take longer. To meet this requirement, it will be necessary to support operations that process range queries efficiently by processing all cities in the range as a batch, rather than as a series of operations on individual cities.

Different indexing methods can be used to perform this operation. What will be your choice if:

a) database is created once and has no change over a period of time

b) database is created once and database is changed over a period of time

Justify your answer with appropriate logic.

Note: Try to provide precise, to the point answer and avoid irrelevant details.

Views: 6139

Replies to This Discussion

ni 2no par ni 1 per likhna hy jo ap ko best lgta hy 2no options mein sy us py likhna hy.......

data base bnane k liae sql coding kis main krni hoti ha??? 

server type: transac SQL compact edition


database engine.. 

nz Chuhan(MIT) aap aisai karin assignment ki disscussion s jo adob file r tutorial ki file h wo download kar lain aap bs un visual aids ko follow kar lain phir ssir tariq ki file download kar k app easily assignment bana saktai ho

nai dono sorto m likhna hy k konsa index method use hoga , wo condition di hoi hain na k option 

koi muje btae k kese sql install krn hai bar bar error ata hia plz help me

dear little chef pls visit this site, here in discussion is said that cluster index is good for range queries but not best

 if we use clustered indexing for option a and non clustered indexing for option b, will it be right or wrong , correct me if i am wrong.

i think it is right but not 100% sure


I think for clustered index should be used when the database is created once and not change over time. It is because in clustered index data is sorted physically.sweet candy When ever you insert or delete data from table, the whole data is sorted physically which provide extra overhead and decrease performance.

The non clustered index should be used when the database is created and changed often. This is because in non clustered index data is sorted physically, when ever you insert data or delete data nothing changes in the order of data stored physically. But what happens sorting is done logically, a file is maintained in which the pointer to actual data at physical location is maintained.This saves for overhead to ordering or sorting data physically.

yes..when data is updated, then clustered index should  be used because in case of insertion/updation, the whole data may need to be sorted again as data is in sorted form in clustered index.

Don't consider it final answer.

Everyone  discuss it and Share what you think and what you find about it.


Database Indexing Methods

Indexing based on:-

primary key: single attribute, no duplicates

secondary keys: one or more attributes

                            duplicates are allowed

                           indexing in M-dimensional feature spaces

                           Data and queries are vectors

Retrieval: two step search approach

  • Primary Key Indexing:-

Dynamic indexing: the file grows or shrinks to adapt to the volume of data good space utilization and good performance


B-trees and variants (B+-trees, B*-trees)

Hashing and variants (linear hashing, sweet candy, spiral etc.)

hashing is faster, B-trees preserve order of keys

B-trees, hashing are the industry work-horses

  • Secondary Key Indexing

    Much interest in multimedia

    signals are represented by feature vectors

    feature extraction computes feature vectors from signals

    The index organizes the feature space so that it can answer queries on any attribute


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

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