search
Log In
0 votes
73 views

in Databases
edited by
73 views

Please log in or register to answer this question.

Related questions

0 votes
0 answers
1
2 votes
2 answers
2
171 views
suppose that in a file organization record size(R)=150 bytes , block size (B)=512 bytes. there are totally 30000 records. the data field on which indexing is done is 9 bytes and block pointer size is 7 bytes how many block access will be needed to access a data item in case of single level primary indexing?
asked Dec 19, 2018 in CO and Architecture Shivam Kasat 171 views
1 vote
0 answers
3
234 views
Consider the following statement below: $A)$ A clustered index may be either sparse or dense. $B)$ Every $B^{+}$ tree index is dense. Which of the above statement is true? Is clustering Index can be dense. Dense means non-ordering field, but clustering field should be ordering field right??
asked May 13, 2019 in Databases srestha 234 views
2 votes
1 answer
4
355 views
In a database file structure, the search key field is 9 bytes long, the block size is 1024 bytes, a record pointer is 7 bytes and a block pointer is 6 bytes. The largest possible order of a leaf node in a B+ tree implementing this file structure is
asked Jan 26, 2018 in Databases sumit chakraborty 355 views
...