OCP-043 Sorted Hash Cluster
来源:互联网 发布:淘宝店铺星级规则 编辑:程序博客网 时间:2024/06/04 22:51
52. You are designing an application for a telecom company and you have been asked to design a
database table to facilitate monthly bill generation. The bill would include details of customer calls, listed in
chronological order.
Which method would you follow to achieve this objective without increasing the overhead of sorting the
rows?
A.create a hash cluster to store the data
B.create an index cluster to store the data
C.create a partitioned table to store the data
D.create a sorted hash cluster to store the data
E.create a heap table with rowid to store the data
Answer: D
Creating a Sorted Hash Cluster
In a sorted hash cluster, the rows corresponding to each value of the hash function are sorted on a specified set of columns in ascending order, which can improve response time during subsequent operations on the clustered data.
For example, a telecommunications company needs to store detailed call records for a fixed number of originating telephone numbers through a telecommunications switch. From each originating telephone number there can be an unlimited number of telephone calls.
Calls are stored as they are made and processed later in first-in, first-out order (FIFO) when bills are generated for each originating telephone number. Each call has a detailed call record that is identified by a timestamp. The data that is gathered is similar to the following:
In the following SQL statements, the telephone_number
column is the hash key. The hash cluster is sorted on the call_timestamp
and call_duration
columns. The number of hash keys is based on 10-digit telephone numbers.
CREATE CLUSTER call_detail_cluster ( telephone_number NUMBER, call_timestamp NUMBER SORT, call_duration NUMBER SORT ) HASHKEYS 10000 HASH IS telephone_number SIZE 256; CREATE TABLE call_detail ( telephone_number NUMBER, call_timestamp NUMBER SORT, call_duration NUMBER SORT, other_info VARCHAR2(30) ) CLUSTER call_detail_cluster ( telephone_number, call_timestamp, call_duration );
Given the sort order of the data, the following query would return the call records for a specified hash key by oldest record first.
SELECT * WHERE telephone_number = 6505551212;
- OCP-043 Sorted Hash Cluster
- 哈希聚簇读取(Hash Cluster Access)[摘]
- 用hash cluster表提高查询性能
- 哈希聚簇读取(Hash Cluster Access)[摘]
- Oracle study之--HASH Cluster特点
- ocp-043
- cluster
- Cluster
- cluster
- Cluster
- Cluster
- redis类型[string 、list 、 set 、sorted set 、hash]
- redis类型[string 、list 、 set 、sorted set 、hash]
- redis类型[string 、list 、 set 、sorted set 、hash]
- redis类型讲解[string, list, set, sorted set, hash]
- redis类型[string 、list 、 set 、sorted set 、hash]
- redis类型[string 、list 、 set 、sorted set 、hash]
- redis hash和 sorted set 使用(用户信息和排行榜)
- Android基础教程之五大布局对象------FrameLayout,LinearLayout,AbsoluteLayout,RelativeLayout,TableLayout
- 浏览器兼容性问题的解决方案
- 如何在jsp页面中引入css样式表文件和javascript文件
- C#读取数据库返回泛型集合 把DataSet类型转换为List<T>泛型集合
- 两个整数交换程序,不得定义新变量
- OCP-043 Sorted Hash Cluster
- 详解 Qt phonon多媒体框架 基于播放器
- mysql 数据导入与导出
- 什么是 WPS(Wi-Fi Protected Setup)
- 算法学习之数据结构之二叉查找树
- Objective-C与JavaScript的交互
- 织梦dedecms网站六大SEO优化技巧分享
- How To Setup Password Security? (Doc ID 564125.1)
- 复习小记----第9章 标准容器