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.