摘要
研究针对全文检索领域的索引结构模型,基于二元互关联后继树模型,提出并实现了一个后继序列有序的后继树模型,然后利用此索引模型实现查询操作的优化。
The key research work on text databases is full-text index. An inter-relevant successive trees model with sorted successive sequence is presented and implemented. Optimization of the search algorithm is realized based on sorted successive sequence.
出处
《计算机应用与软件》
CSCD
北大核心
2008年第4期1-3,共3页
Computer Applications and Software
基金
国家自然科学基金项目(60473070)
关键词
互关联后继树
后继区间
后继序列
后继序列有序
Inter-relevant successive trees Successive part Successive sequence Sorted successive sequence
