文摘
Most of studies on relaxing Semantic Web Database ( \(\mathcal{S}\mathcal{W}\mathcal{D}\mathcal{B}\) ) queries focus on developing new relaxation techniques or on optimizing the top-k query processing. However, only few works have been conducted to provide a fine and declarative control of query relaxation using an \(\mathcal{S}\mathcal{W}\mathcal{D}\mathcal{B}\) query language. In this paper we first define a set of requirements for an \(\mathcal{S}\mathcal{W}\mathcal{D}\mathcal{B}\) cooperative query language( \(\mathcal{C}\mathcal{Q}\mathcal{L}\) ). Then, based on these requirements, we propose an extension of query language with a new clause to use and combine the relaxation operators we introduce. A similarity function is associated with these operators to rank the alternative answers retrieved.