— Constraints play an important role in the efficient query evaluation in deductive databases. In this paper, constraint-based query evaluation in deductive databases is investi...
Abstract. Bottom-up evaluation is a central part of query evaluation / program execution in deductive databases. It is used after a source code optimization like magic sets or SLDm...
Materialized views offer opportunities for significant performance gain in query evaluation by providing fast access to pre-computed data. The question of when and how to use a ma...
In this paper, a new indexing technique to support the query evaluation in document databases is proposed. The key idea of the method is the combination of the technique of pat-tre...
Semistructured data occur in situations where information lacks a homogeneous structure and is incomplete. Yet, up to now the incompleteness of information has not been re ected b...
We study relations on trees defined by first-order constraints over a vocabulary that includes the tree extension relation Ì Ì ¼, holding if and only if every branch of Ì ex...
Abstract. The focus of this paper is approaches to measuring similarity for application in content-based query evaluation. Rather than only comparing at the level of words, the iss...
Abstract. The focus of this paper is approaches to measuring similarity for application in content-based query evaluation. Rather than only comparing at the level of words, the iss...
We consider the problem of query evaluation in Peer-to-Peer (P2P) systems that support semantic-based retrieval services. We confine ourselves to the case where the peers employ t...
Finding intensional encapsulations of database subsets is the inverse of query evaluation. Whereas query evaluation transforms an intensional expression (the query) to its extensi...