首页> 外文期刊>IEEE Transactions on Software Engineering >Expressions for completely and partly unsuccessful batched search of sequential and tree-structured files
【24h】

Expressions for completely and partly unsuccessful batched search of sequential and tree-structured files

机译:顺序和树型文件的批量搜索的完全和部分失败的表达式

获取原文
获取原文并翻译 | 示例

摘要

A number of previous studies derived expressions for batched searching of sequential and tree-structured files on the assumption that all the keys in the batch exist in the file, i.e., all the searches are successful. Formulas for batched searching of sequential and tree-structured files are derived, but the assumption made is that either all or part of the keys in the batch do not exist in the file, i.e., the batched search is completely or partly unsuccessful.
机译:先前的许多研究都假定批量中的所有键都存在于文件中,即所有搜索均成功,从而推导了用于顺序搜索和树状文件的批量搜索的表达式。导出了用于顺序搜索和树结构文件的批量搜索的公式,但是做出的假设是该文件中不存在该批量中的全部或部分关键字,即,批量搜索完全或部分失败。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号