Sciweavers

ICDE
1991
IEEE
175views Database» more  ICDE 1991»
13 years 9 months ago
Constraint-Based Reasoning in Deductive Databases
— 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...
Jiawei Han
ICLP
2010
Springer
13 years 9 months ago
Implementation Alternatives for Bottom-Up Evaluation
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...
Stefan Brass
DEXAW
1998
IEEE
126views Database» more  DEXAW 1998»
13 years 9 months ago
An Extended Query Reformulation Technique Using Materialized Views
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...
Jae-young Chang, Sang-goo Lee
DEXA
1999
Springer
181views Database» more  DEXA 1999»
13 years 9 months ago
Combining Pat-Trees and Signature Files for Query Evaluation in Document Databases
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...
Yangjun Chen, Karl Aberer
PODS
1999
ACM
160views Database» more  PODS 1999»
13 years 9 months ago
Queries with Incomplete Answers over Semistructured Data
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...
Yaron Kanza, Werner Nutt, Yehoshua Sagiv
LICS
2002
IEEE
13 years 10 months ago
Tree Extension Algebras: Logics, Automata, and Query Languages
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...
Michael Benedikt, Leonid Libkin
ISMIS
2003
Springer
13 years 10 months ago
Similarity Graphs
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...
Rasmus Knappe, Henrik Bulskov, Troels Andreasen
ISCIS
2003
Springer
13 years 10 months ago
Similarity for Conceptual Querying
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...
Troels Andreasen, Henrik Bulskov, Rasmus Knappe
COOPIS
2003
IEEE
13 years 10 months ago
Query Evaluation in Peer-to-Peer Networks of Taxonomy-Based Sources
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...
Yannis Tzitzikas, Carlo Meghini
DEXA
2005
Springer
110views Database» more  DEXA 2005»
13 years 11 months ago
Intensional Encapsulations of Database Subsets via Genetic Programming
Finding intensional encapsulations of database subsets is the inverse of query evaluation. Whereas query evaluation transforms an intensional expression (the query) to its extensi...
Aybar C. Acar, Amihai Motro