Based on branch and bound technique and proposed pruning, updating and visiting heuristics, recursive depth-first and heap-based best-first query processing algorithms are developed for both cases.

• 采用分支界定技术和给出的启发式规则，设计了迭代的深度优先和基于堆的最好优先的查询处理算法。