Part Seq access Hashed vs sorted
来源:互联网 发布:淘宝如何提高销量 编辑:程序博客网 时间:2024/05/16 06:00
Partial sequential access on a sorted table
* Entries: 10000, Line width: 100
* key width: 60, Subkey width: 20
* HTAB is a hashed table, 2000 entries are read
* Key fields: K, DATA
LOOP AT HTAB INTO WA WHERE K = SUBKEY.
" ...
ENDLOOP.
Partial sequential access on a sorted table
* Entries: 10000, Line width: 100
* key width: 60, Subkey width: 20
* STAB is a sorted table, 2000 entries are read
* Key fields: K, DATA
LOOP AT STAB INTO WA WHERE K = SUBKEY.
" ...
ENDLOOP.
Documentation
Hashed tables are optimized for single entry access. The entries have
no specific order. Therefore, a partial sequential access cannot be
optimized. Every entry must be checked to match the condition
(full table scan).
Sorted tables are ordered ascendingly by their key components. If
a partial key of the form "k1 = v1 AND ... AND kn = vn" where k1 .. kn
matches a left part of the table key, the access is optimized by the
kernel. In that case, only the matching entries are visited.
- Part Seq access Hashed vs sorted
- Single Read Sorted vs hashed tables
- Building unique sorted hashed tables.
- ABAP Internal Table Performance for STANDARD, SORTED and HASHED Table
- seq
- seq
- fopen vs access vs stat
- malloc vs new part 1
- Discretionary Access Control vs Mandatory Access Control
- 转:Excel Web Access Web Part
- 转:Excel Web Access Web Part summary
- Memory access ordering Part 1 - an introduction
- part 2:(Generics,Access Control,Advanced Operators)
- VS.Net2005连接Access数据库
- VS.Net2005连接Access数据库
- VS连接Access数据库详解
- Agile VS PMP -- Part 1, About Stakeholder
- Agile VS PMP -- Part 3 About Quality
- 位运算在排序与搜索中的应用(转)
- Joining internal tables.
- ExtJS中的get函数:get,getCmp,getDom,getBody,getDoc
- oracle 表空间的创建
- Building unique sorted hashed tables.
- Part Seq access Hashed vs sorted
- Building unique standard hashed tables
- Proxy模式——结构性模式
- Single Read Sorted vs hashed tables
- RedHat5下安装oracle10g
- mysql编译安装AB复制
- IK中文分词包导入项目步骤
- Boost库安装
- c# 导出EXCEL