1) Indirect Inter-Relevant Successive Tress with Dual Arties
二元间接互关联后继树
2) Inter-relevant successive trees
互关联后继树
1.
Text compression based on inter-relevant successive trees;
基于互关联后继树的文本压缩
4) IRST
互关联后继树
1.
An IRST-Based Algorithm for Construction of Concept Lattices;
基于互关联后继树的概念格构造算法
2.
First, on the base of existing studies, introduced a new full-text information retrieval model, Inter-Relevant Successive Tree(IRST), which is still in the initial stage and then make comparison between the model of the IRST and its major improved models and several mainstream models of full-text information retrieval, such as Bitmap、Inverted Files、Pat Array in terms of performance.
首先在已有研究结果的基础上介绍了目前尚处在起步阶段的新型全文检索模型——互关联后继树(简称IRST)模型,就互关联后继树及其主要改进模型同几种主流的全文检索模型如位图模型、倒排表模型、Pat数组模型等性能方面的差异进行了比较。
3.
To speed up queries over graph-structured XML documents,on the basis of Inter-Relevant Successive Trees(IRST),we introduce the idea of similarity merging from structural index,and propose an efficient IRST-based structural index for branching path queries,IRST(k,l)-index.
为快速准确地查询图结构XML文档,本文在互关联后继树(IRST)的基础上,引入结构索引的相似性归并思想,提出一种基于互关联后继树且支持分支路径查询的高效XML结构索引—IRST(k,l)-index,并给出该索引的快速创建和查询算法。
补充资料：后继
后面继续跟上来；后来接续前头（的）：～有人丨前赴～。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条