Building unique standard hashed tables

最新推荐文章于 2021-07-06 10:19:43 发布
最新推荐文章于 2021-07-06 10:19:43 发布
阅读量652 收藏
点赞数
分类专栏： SAP ABAP Optimize 文章标签： duplicates table algorithm insert delete search
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/Gangelwn/article/details/6281557
版权


One-step approach
* Entries: 1000, Duplicates: 250
* Line width: 100, Key width: 20
* ITAB2 takes 750 entries with unique key K

REFRESH ITAB2.
LOOP AT ITAB1 INTO WA.
  READ TABLE ITAB2 WITH KEY K = WA-K
                   BINARY SEARCH
                   TRANSPORTING NO FIELDS.
  IF SY-SUBRC <> 0.
    INSERT WA INTO ITAB2
              INDEX SY-TABIX.
  ENDIF.
ENDLOOP.

 


Three-steps: move, sort, delete dupl.

* Entries: 10000, Duplicates: 2500
* Line width: 100, Key width: 20
* ITAB2 takes 750 entries with unique key K

ITAB2[] = ITAB1[].
SORT ITAB2 BY K.
DELETE ADJACENT DUPLICATES FROM ITAB2
                           COMPARING K.

 


Documentation
If the data amount is small (< 20 entries), or if you need read-
access to the internal table while it is being filled, the one-step
approach using READ/INSERT is the right choice.
If, however, the data amount is larger and you need read-access only
to the completely-filled table, the three-step algorithm is
preferable.
See also the comparable test for SORTED vs. HASHED TABLEs

 

Gangelwn
关注
  • 0
    点赞
  • 踩
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
专栏目录
Boost：双图bimap与mi_hashed indices索引的测试程序
希望我的博客，能帮上你解决学习中工作中所遇到的问题
05-23 213
Boost：双图bimap与mi_hashed indices索引的测试程序实现功能C++实现代码 实现功能 双图bimap与mi_hashed indices索引的测试程序 C++实现代码 #include <boost/config.hpp> #include <iostream> #include <iomanip> #include <boost/tokenizer.hpp> #include <boost/multi_index_contain
Building unique sorted hashed tables.
Gangelwn
03-27 849
<br />INSERT in a sorted table with unique key <br /><br />* Entries: 1000, Duplicates: 250<br />* Line width: 100, Key width: 20<br />* ITAB2 takes 750 entries with unique key K<br />REFRESH ITAB2.<br />LOOP AT ITAB1 INTO WA.<br />  INSERT WA INTO TABLE I
SAP ABAP性能实例七例
Violinlins
01-22 772
一、SQL Interface 1.Select ... Where vs. Select + Check 用Select … Where语句效率比Select + Check语句要高，例如： SELECT * FROM SBOOK INTO SBOOK_WA WHERE CARRID = 'LH' AND CONNID = '0400'. ENDSELECT. SELECT * FROM SBOOK...
ABAP性能实例七例
ChampaignWolf的专栏
07-06 819
一、SQL Interface 1.Select ... Where vs. Select + Check 用Select … Where语句效率比Select + Check语句要高，例如： SELECT * FROM SBOOK INTO SBOOK_WA WHERE CARRID = 'LH' AND CONNID = '0400'. ENDSELECT. SELECT * FROM SBOOK INT...
mysql的TABLE_SCHEMA的sql和information_schema表, MySQL管理一些基础SQL语句, Changes in MySQL 5.7.2...
weixin_34408717的博客
11-20 4503
      3.查看库表的最后mysql修改时间, 如果第一次新建的表可能还没有update_time，所以这里用了ifnull，当update_time为null时用create_time替代 select TABLE_SCHEMA, TABLE_NAME,ifnull(update_time , create_time) from information_schema.TABLES where...
NBIOT Hashed ID Calculaion
07-18
NBIOT Hashed ID Calculation, input the S-TMSI and calculate the UE_ID_H
ol-hashed:在URL哈希中维护地图视图的状态
04-30
npm install ol ol-hashed ol-hashed模块旨在与一起使用（并取决于 。 用法 ol-hashed模块的默认导出是您使用地图调用的函数。 import Map from 'ol/map' ; import View from 'ol/view' ; import TileLayer from '...
mongoose-hashed-field:Mongoose 的散列密码字段插件
07-01
此插件可让您向架构添加hashed字段。 它会自动为您创建一个异步 setter 方法，以及一个 setter 虚拟属性。 每当您为散列字段分配一个值时，它将使用 bcrypt 进行散列。 插件旨在简化在数据库中保存散列密码的过程...
Hashed.io-crx插件
03-09
通过简单地使用#hashtag，Hashed允许任何人创建即时讨论（称为“HashOut”），并邀请其他Twitter用户在较小的组中聊天。所有没有140个字符的限制！ 哈希Chrome浏览器扩展提供浏览器中的所有主题标签选项，以转到相关...
Typed vs untyped Parameters
Gangelwn
03-27 1097
<br />Untyped parameters <br />Runtime: 5 microseconds <br />PERFORM UP1 USING 10 M6-DIMID M6-ZAEHL M6-ISOCODE M6-ANDEC M6-PRIMARY.<br />FORM UP1 USING<br />               REPEAT<br />               DIMID<br />               ZAEHL<br />               ISOCO
Intersection of internal tables
Gangelwn
03-27 1045
<br />Using a sorted table temporarily <br />Runtime: 101 microseconds <br /><br />* Entries: 200 (ITAB1), 100 (ITAB2)<br />* Intersection: 50 (ITAB3)<br />* Line width: 100, Key width: 20<br />STAB1 = ITAB1.<br />REFRESH ITAB3.<br />LOOP AT ITAB2 ASSIGNIN
Modifying a set of lines directly
Gangelwn
03-27 879
<br /><br />Modifying all lines completely <br />* Entries: 100 (outer table), 20 (inner table)<br />* The entries to be modified: 50<br />* Actually, only the component FLAG is updated.<br />* However, the complete lines are moved.<br />LOOP AT ITAB INTO
Single Read Sorted vs hashed tables
Gangelwn
03-27 859
<br />READ on a unique sorted table <br />* Entries: 1000<br />* Line width: 100, key width: 20<br />* STAB is a unique sorted table, 250 entries are read<br />DO 250 TIMES.<br />  N = 4 * SY-INDEX.<br />  READ TABLE STAB INTO WA WITH TABLE KEY K = N.<br /
Supply Demand vs select
Gangelwn
03-27 837
<br />SELECT:<br /> <br />SELECT * FROM SBOOK INTO SBOOK_WA UP TO 10 ROWS.<br />  SELECT SINGLE AIRPFROM AIRPTO INTO (AP1, AP2)<br />         FROM  SPFLI<br />         WHERE CARRID = SBOOK_WA-CARRID<br />         AND   CONNID = SBOOK_WA-CONNID.<br />  SELE
fixed and unfixed length strings
Gangelwn
03-27 797
<br />Character fields (fixed length) <br />Runtime: 1 microseconds <br />*data c1(200) type c.<br />*data c2(200) type c.<br />*data c3(400) type c.<br />c1 = 'mysap'.<br />c2 = '.com'.<br />concatenate c1 c2 into c3.<br /><br />String (unfixed length) <b
Secondary indices
Gangelwn
03-27 791
<br />No secondary index => linear search <br /> <br />* Entries: 1000, Line width: 100<br />*                Key width:   20<br />* The READ locates the 500th entry.<br />READ TABLE ITAB INTO WA<br />     WITH KEY DATE = SY-DATUM.<br />IF SY-SUBRC = 0.<br
Using A Subquery
Gangelwn
03-27 726
Using two selects :SELECT * FROM SPFLI  INTO TABLE T_SPFLI  WHERE CITYFROM = 'FRANKFURT'    AND CITYTO = 'NEW YORK'.SELECT * FROM SFLIGHT AS F    INTO SFLIGHT_WA    FOR ALL ENTRIES IN T_SPFLI    WHERE SEATSOCC       AND CARRID = T_SPFLI-CARRID      AND CON
Case vs Perform i Of
Gangelwn
03-27 705
<br />*  (I = 5 in this test)<br /> CASE I.<br />  WHEN 1. PERFORM PV1.<br />  WHEN 2. PERFORM PV2.<br />  WHEN 3. PERFORM PV3.<br />  WHEN 4. PERFORM PV4.<br />  WHEN 5. PERFORM PV5.<br />  WHEN 6. PERFORM PV6.<br />  WHEN 7. PERFORM PV7.<br />  WHEN 8. P
openlayer ol-hashed
最新发布
06-09
现在我理解了您的问题。"ol-hashed"是OpenLayers中的一个术语，指的是在URL中添加哈希值来记录地图状态的技术。这个哈希值通常用于存储地图的缩放级别、中心点和图层状态等信息，以便在用户刷新页面或者分享链接时可以恢复之前的地图状态。 OpenLayers提供了一个名为ol-hashed的模块，可以轻松地实现地图状态的哈希记录和恢复。使用ol-hashed模块，您只需要将其导入到您的代码中，并在创建地图实例时设置相应的选项即可实现哈希记录和恢复功能。
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值