Joined
Last Seen
0 Reputation Points
Unknown Quality Score
No one has voted on any posts yet. Votes from other community members are used to determine a member's reputation amongst their peers.
0 Endorsements
Ranked #72.7K
~196 People Reached
Favorite Forums
Computer Science
x
1
Databases
x
1
|
Consider the relation R(A,B,C,D), consisting of 100,000 tuples. Each page contains 10 tuple entries. R is saved as a heap with dense secondary indexes on B. Data is distributed randomly. The attribute B lies densely in [1, 100,000] i.e., each value in [0, 100,000] occurs in B. Consider these three …
|
|
|
Consider the relation R(A,B,C,D), consisting of 100,000 tuples. Each page contains 10 tuple entries. R is saved as a heap with dense secondary indexes on B. Data is distributed randomly. The attribute B lies densely in [1, 100,000] i.e., each value in [0, 100,000] occurs in B. Consider these three …
|