登入選單
返回Google圖書搜尋
On the Multiple-query Optimization Problem
註釋Abstract: "Some recently proposed extensions ot [sic] relational database systems as well as deductive database systems require support for multiple-query processing. In this paper we examine the complexity of the multiple-query optimization problem in database management systems. We show that the problem is NP-hard. Then we examine the performance of a heuristic algorithm to solve the multiple-query optimization problem and suggest some heuristics for query ordering which improves the efficiency of the algorithm considerably. The paper also presents some experimental results on the performance of various heuristics."