今天朋友给了我一道澳洲IT硕士专业的考题，让我做一下。
这个题目很有意思，也可以从一个侧面比较一下国外和国内的教育方法。
这个题目很长，内容如下：
Document your solution and every step towards the final solution.
Clearly state your name and the student number on the cover page and on each of your additional pages. Staple your
documents and hand them in using the assignment box for 329A in G block. Hand in by 6th June 13:00am.
1. Task: Physical Design, Access Structures 42 points
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. (13 marks)
(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.(9 marks)
(c) Consider a range query querying 15% of the data. The queried data forms a sequence based on the search key a, e.g. select * from
这个题目很有意思，也可以从一个侧面比较一下国外和国内的教育方法。
这个题目很长，内容如下：
Document your solution and every step towards the final solution.
Clearly state your name and the student number on the cover page and on each of your additional pages. Staple your
documents and hand them in using the assignment box for 329A in G block. Hand in by 6th June 13:00am.
1. Task: Physical Design, Access Structures 42 points
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. (13 marks)
(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.(9 marks)
(c) Consider a range query querying 15% of the data. The queried data forms a sequence based on the search key a, e.g. select * from
来自 “ ITPUB博客 ” ，链接：http://blog.itpub.net/9842/viewspace-341786/，如需转载，请注明出处，否则将追究法律责任。
上一篇：
一次sqlldr导入慢的解决过程
下一篇：
简单了解一下压缩表
请登录后发表评论
登录
全部评论
<%=items[i].createtime%>
<%=items[i].content%>
<%if(items[i].items.items.length) { %>
<%for(var j=0;j
<%}%> <%if(items[i].items.total > 5) { %>
<%}%> <%}%>
<%=items[i].items.items[j].createtime%>
回复
<%=items[i].items.items[j].username%> 回复 <%=items[i].items.items[j].tousername%>： <%=items[i].items.items[j].content%>
还有<%=items[i].items.total-5%>条评论
) data-count=1 data-flag=true>点击查看
<%}%>
北京盛拓优讯信息技术有限公司. 版权所有 京ICP备09055130号-4 北京市公安局海淀分局网监中心备案编号：11010802021510
广播电视节目制作经营许可证(京) 字第1234号 中国互联网协会会员
转载于:http://blog.itpub.net/9842/viewspace-341786/
扫一扫
1万+
到【灌水乐园】发言
