SQL/DATABASE help!!
-
hi i need help with couple of questions. please help.
Search Consider a database system that uses a variant of B+ Trees for indexing, where leaf nodes contain actual data
records, as opposed to pointers to data records (Oracle: index organized table). The index in question is on a unique
attribute, which contains no duplicate entries. The database system is to have the following properties:
Blocks are 4096 bytes in size. Header size is 96 bytes. Usable memory of the nodes is filled up to 85%. Each record is 400 bytes in size. A pointer requires 12 bytes. A record pointer (rowid) requires 12 bytes. The search key is 8 bytes in size.
The data file to be indexed has 10,000,000 entries (records).
(a) How large will the index be maximal? Give your answer in terms of number of blocks, as well as number of bytes. Show each step in your calculations.
(b) How large will the index be maximal, provided that leaf nodes store record pointers instead of actual data
records? Give your answer in terms of number of blocks, as well as number of bytes. Show each step in your calculations.
please help. ihave done other parts of this assignments.
-
This sounds like homework...LOL, do I get an A or you if I give you the correct answers?
Jules
Jules Bui
IT Operations DBA
Backup and Restore Administrator -
yes you do. lol. it doesnt matter any mor cause i just handed in my assignemtn. i figured it out. thanks for a delayed reply (you posted after 2 hrs later when i handed in my assgn.)
-
kwaan, just a tip for the future. Folks around here a pretty adept at detecting homework assigments and generally leave them alone. Giving you the answer would sort of circumvent the learning process
However, if you'd posted what you thought to be the solution and explained that you didn't understand a certain aspect of the solution or why you get incorrect results, etc... then I'm sure you would have got a much quicker response
--------------------
Colt 45 - the original point and click interface
Viewing 4 posts - 1 through 4 (of 4 total)
You must be logged in to reply to this topic. Login to reply