摘要
QSOI查询算法是逻辑数据库查询算法中的一种,它的特点是自顶向下迭代处理,因而比Naive 及Semi-naive 算法提高了查询速度,但在迭代计算中仍存在较多的冗余。本文提出的改进的OSQI 查询算法在一定程度上减少了这部分冗余计算。文中叙述了改进的OSQI 算法的原理,并用具体例子和原算法进行了比较。
OSQI is one of the query algorithms of logic database It is of the feature of top-down,iteration disposal,so that it has a faster querying speed than Naive and Semi-naive methods.However,much redundancy still exists during the iteration computation The improved QSOI queryalgorithm reduces the redundancy to some extent.This paper gives its principle and compares it withOSOI by an example.
出处
《计算机研究与发展》
EI
CSCD
北大核心
1991年第4期17-20,共4页
Journal of Computer Research and Development
基金
国家自然科学基金