摘要
本文针对一类特殊的多关系查询——偶查询,提出了一种建立在图论偶图和匹配理论基础上的查询优化方法,这种方法具有多项式复杂性。
An optimization approach for multi-relational joins based on
the matching concept in graph theory is introduced. The basic idea lies in constructing a join graph from an expression of N-relation query, and seeking for a maximun matching with minimun total weight. The algorithm for bipartition(X, Y) is proposed in this paper.
出处
《重庆大学学报（自然科学版）》
EI
CAS
CSCD
1989年第2期43-49,共7页
Journal of Chongqing University
关键词
查询
优化
图论
偶图
数据库
database
algorithm
graph theory
bipartite graph
matching
query processing
query optimization
