menu
search
Log In
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

Subjects

Network Sites

 GO Mechanical
 GO Electrical
 GO Electronics
 GO Civil
 CSE Doubts

GATE1989-4-xiv

4 votes
2.7k views

Provide short answers to the following questions:

For secondary key processing which of the following file organizations is preferred? Give a one line justification:

  1. Indexed sequential file organization.
  2. Two-way linked list.
  3. Inverted file organization.
  4. Sequential file organization.
in Databases 2.7k views
0
Is inverted file organization topic out of syllabus?
0
no , it is in syllabus
ago

2 Answers

3 votes
Inverted File organization

Because of the following reasons

An index for each secondary key.

· An index entry for each distinct value of the secondary key.

It exhibits better inquiry performance
1
I think the answer is incomplete:

With respect to given 4 options, in terms of efficiency,

Indexed sequential file organization > Inverted file organization > Two way linked list > Sequential file organization (due to sorting).

Now, we may use Indexed or inverted but we'll prefer inverted so that we can save some space(as Indexed will surely take some space to store the index.
0 votes
A Indexe
← Prev. Next →
← Prev. Qn. in Sub. Next Qn. in Sub. →

Related questions

26 votes
4 answers
1
2.5k views
GATE1989-4-i
Provide short answers to the following questions: How many substrings (of all lengths inclusive) can be formed from a character string of length $n$? Assume all characters to be distinct, prove your answer.
Provide short answers to the following questions: How many substrings (of all lengths inclusive) can be formed from a character string of length $n$? Assume all characters to be distinct, prove your answer.
asked Nov 30, 2016 in Combinatory makhdoom ghaya 2.5k views
0 votes
0 answers
2
233 views
GATE1989-12b
Consider a database with the following three relations: CREDITS (STUDENT; COURSE) OFFERS (TEACHER; COURSE) BELONGS (TEACHER; DEPARTMENT) Given below is a code in query language QUEL. Describe in one English sentence the query posed by the given QUEL program. range of s is CREDITS ... LIST1 range of e2 is LIST2 range of e3 is LIST3 retrieve(E1.I) where e1.I=e2.I and where e1.I=e3.I
Consider a database with the following three relations: CREDITS (STUDENT; COURSE) OFFERS (TEACHER; COURSE) BELONGS (TEACHER; DEPARTMENT) Given below is a code in query language QUEL. Describe in one English sentence the query posed by the given QUEL program. range of s is CREDITS range of t ... is LIST1 range of e2 is LIST2 range of e3 is LIST3 retrieve(E1.I) where e1.I=e2.I and where e1.I=e3.I
asked Dec 15, 2016 in Databases makhdoom ghaya 233 views
27 votes
3 answers
3
3.8k views
GATE1989-12a
Fig.7 shows a $B+$ tree where only key values are indicated in the records. Each block can hold upto three records. A record with a key value $34$ is inserted into the $B+$ tree. Obtain the modified $B+$ tree after insertion.
Fig.7 shows a $B+$ tree where only key values are indicated in the records. Each block can hold upto three records. A record with a key value $34$ is inserted into the $B+$ tree. Obtain the modified $B+$ tree after insertion.
asked Dec 9, 2016 in Databases makhdoom ghaya 3.8k views
10 votes
2 answers
4
2k views
GATE1989-3-ixa
Answer the following: Which one of the following statements (s) is/are FALSE? Overlaying is used to run a program, which is longer than the address space of the computer. Optimal binary search tree construction can be performed efficiently by using dynamic ... components of a graph. Given the prefix and postfix walls over a binary tree, the binary tree can be uniquely constructed.
Answer the following: Which one of the following statements (s) is/are FALSE? Overlaying is used to run a program, which is longer than the address space of the computer. Optimal binary search tree construction can be performed efficiently by using dynamic programming ... components of a graph. Given the prefix and postfix walls over a binary tree, the binary tree can be uniquely constructed.
asked Nov 27, 2016 in DS makhdoom ghaya 2k views
Dark theme
Muffin by Hélio Chun
Thanks to Q2A
...