• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International Conference on Database and Expert Systems Applications >On the General Signature Trees
【24h】

On the General Signature Trees

机译：在一般签名树上

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

The signature file method is a popular indexing technique used in information retrieval and databases. It excels in efficient index maintenance and lower space overhead. Different approaches for organizing signature files have been proposed, such as sequential signature files, bit-slice files, S-trees, and its different variants, as well as signature trees. In this paper, we extends the structure of signature trees by introducing multiple-bit checkings. That is, during the searching of a signature tree against a query signature s_q, more than one bit in s_q will be checked each time when a node is encountered. This does not only reduce significantly the size of a signature tree, but also increases the filtering ability of the signature tree. We call such a structure a general signature tree. Experiments have been made, showing that the general signature tree uniformly outperforms the signature tree approach.
机译：签名文件方法是在信息检索和数据库中使用的流行索引技术。它擅长有效的指标维护和较低的空间开销。已经提出了组织签名文件的不同方法，例如顺序签名文件，位切片文件，S树及其不同的变体以及签名树。在本文中，我们通过引入多位检查来扩展签名树的结构。也就是说，在针对查询签名S_Q的签名树期间，每次遇到节点时，将检查S_Q中的多于一位。这不仅可以减少签名树的大小，而且还增加了签名树的过滤能力。我们称之为一般签名树。已经进行了实验，表明一般签名树均匀地优于签名树方法。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号