Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
Describe the storage structure of indexed sequential files and their access method.
Ans: Storage structure of Indexed Sequential files and their access: To achieve fast random access to records in a file, we can utilize an index structure. An index record contains a search key value and pointers to data records that is related with a specific search key. An ordered index stores the values of the search keys in sorted order. A file may have various indices on different search keys. If the files consisting of the records are sequentially ordered, a primary index is an index whose search key also describes the sequential order of the file. Such types of files are termed as index sequential files. There are two sorts of ordered indices: dense and sparse. In dense index, and index record appears only for a few of the search-key in the files as displayed below.
To access a specific record with search key value, K, by using dense index we search index record along with search key value, K, by which reach the first entry of data record along with search key value K. After that the data records are searched linearly to acquire the required record. If either the index record is not there or the linear search arrive the data record with different search key value, then the record is not there. Here now for sparse index, we search index record along with search key value, K or the index record with highest search key value less as compared to K, from which arrives the first entry of data record with search key value K or highest value less than K. After that the data records are searched linearly to acquire the required record. If the linear searches the data record with search key value greater as compared to K, then the record is not there.
Why, generally does an object-oriented system use the relational DBMS? The reasons for using relational DBMS for OO systems could be any combination of following: a. Many or
Define Hash files organization a. Hashing includes computing the address of a data item by calculating a function on the search key value. b. A hash function h is a functi
Describe an data dictionary? A data dictionary is a data structure which keeps meta data about the structure of the database ie. the schema of the database.
Define the concept of generalization A generalization is relationship between specific kind of thing and general thing. It is also known as "is-a-kind-of" relationship. Inher
Define the notation for classes and atrributes The notation for class, attribute, and operations are shown below: Figure: Class with attributes and operations A
Use of partial data by applications : In common, applications work with views rather than whole relations. Thus, it may be more appropriate to work with subsets of relations rather
What is a view? How it is related to data independence? A view might be thought of as a virtual table, that is, a table that does not really exist in its own right but is inste
Two Phase Locking (2PL) The two-phase locking protocol having of two phases: Phase 1 : The lock acquisition phase : If a transaction T needs to read an object, it wants to
What is RDBMS terminology for a row? A tuple is a RDBMS terminology for a row
What are the three fundamental operations that are regular to MySQL Programs? a) Establishing a connection to the MySQL server b) Choosing a database. c) Disconnecting fr
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +1-415-670-9521
Phone: +1-415-670-9521
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd