Register

Test by Bikram | Databases | Test 1 | Question: 19

• edited by
420 views
0 votes
0 votes

Which is the best file organization when data is frequently added or deleted from a file?

  1. Sequential
  2. Direct
  3. Index sequential
  4. None of the above
• edited by
User Avatar

1 Answer

1 votes
1 votes
bikram sir ,

A) Sequential Access slower as has to start from the begining every time.

B) Direct Acces very quick for repeated accesses.

C) What is Index Sequential ? Is it that you read through all the indices sequentially , which will then make it slower than the second one.
User Avatar
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
1 answer
1
Bikram asked Nov 26, 2016
330 views
Test by Bikram | Databases | Test 1 | Question: 30
Consider the join of relation R with a relation S. If R has $m$ tuples and S has $n$ tuples, then the maximum and minimum sizes of the join, respectively, are __________. $m+n$ and $0$ $m+n$ and $|m-n|$ $mn$ and $0$ $mn$ and $m+n$
Consider the join of relation R with a relation S. If R has $m$ tuples and S has $n$ tuples, then the maximum and minimum sizes of the join, respectively, are __________....
User Avatar
0 votes
0 votes
1 answer
2
Bikram asked Nov 26, 2016
240 views
Test by Bikram | Databases | Test 1 | Question: 29
A functional dependency of the form x → y is trivial if y ⊆ x y ⊂ x x ⊆ y x ⊂ y
A functional dependency of the form x → y is trivial ify ⊆ xy ⊂ xx ⊆ yx ⊂ y
User Avatar
0 votes
0 votes
1 answer
3
Bikram asked Nov 26, 2016
313 views
Test by Bikram | Databases | Test 1 | Question: 28
What does the following Tuple Relational Calculus query produce? The expression σθ1 (E1 ⋈θ2 E2) is the same as: E1 ⋈θ1^ θ2 E2 (σθ1 E1) ∧ (σθ2 E2 ) E1 ⋈ θ1∨ θ2 E2 None of the above
What does the following Tuple Relational Calculus query produce?The expression σθ1 (E1 ⋈θ2 E2) is the same as: E1 ⋈θ1^ θ2 E2 (σθ1 E1) ∧ (σθ2 E2 ) E1 ⋈ θ...
User Avatar
Link Copied!