助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   manipulation of record 的翻译结果: 查询用时:0.006秒
图标索引 在分类学科中查询
所有学科
更多类别查询

图标索引 历史查询
 

manipulation of record
相关语句
  相似匹配句对
     Manipulation of Translation
     翻译的操控
短句来源
     Faithfulness and Manipulation
     忠实论与摆布论
短句来源
     Invasive manipulation.
     接受侵入性操作。
短句来源
     Analysis of the profit manipulation
     利润操纵分析
短句来源
     From Record to Documentation
     从展示到纪录
短句来源
查询“manipulation of record”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
没有找到相关例句


The effective manipulation methods of massive memory data in large scale e-trading oriented real-time database are studied, using linear pool to organize the memory data for physical storage, based on the update-in-place and append-only characteristics of trade transaction updating memory data. T-tree index is used for the logical manipulation of record-number-fixed data and entangled bidirectional linked-list index is adapted for the logical manipulation of dynamic data. The algorithm of physical...

The effective manipulation methods of massive memory data in large scale e-trading oriented real-time database are studied, using linear pool to organize the memory data for physical storage, based on the update-in-place and append-only characteristics of trade transaction updating memory data. T-tree index is used for the logical manipulation of record-number-fixed data and entangled bidirectional linked-list index is adapted for the logical manipulation of dynamic data. The algorithm of physical memory allocation and buffer adjustment is simplified. The efficiency of data updating and index reconstruction is increased and the time complexity of memory data querying and accessing reduced. The results show that the time complexities of the two query methods, based on T-tree index and linked-list index, are not more than O(lnN) and O(ln(N+1)-1) respectively, and they fit for the need of large scale e-trading.

研究面向大规模电子交易实时数据库中密集内存数据的高效组织方法.采用线性存储池实现内存数据的物理存储组织,并根据交易事务更新内存数据的update-in-place和append-only特点,采用T-树索引实现元组固定数据的逻辑组织,采用缠绕的双向链式索引实现动态数据的逻辑组织.简化了物理空间的分配和调整算法,提高了数据更新和索引重构的效率,降低了内存数据查询访问的时间复杂度.结果表明,基于T-树索引和链式索引的数据查询算法的时间复杂度分别控制在O(lnN)和O(ln(N+1)-1),满足大规模电子交易的需要.

 
图标索引 相关查询

 


 
CNKI小工具
在英文学术搜索中查有关manipulation of record的内容
在知识搜索中查有关manipulation of record的内容
在数字搜索中查有关manipulation of record的内容
在概念知识元中查有关manipulation of record的内容
在学术趋势中查有关manipulation of record的内容
 
 

CNKI主页设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
版权图标  2008 CNKI-中国知网
京ICP证040431号 互联网出版许可证 新出网证(京)字008号
北京市公安局海淀分局 备案号:110 1081725
版权图标 2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社