1039 search results - page 38 / 208 » Query reformulation with constraints |
109
click to vote
RR
2010
Springer
14 years 11 months ago
2010
Springer
Based on practical observations on rule-based inference on RDF data, we study the problem of redundancy elimination on RDF graphs in the presence of rules (in the form of Datalog r...
220
Voted
ICDE
2009
IEEE
16 years 2 months ago
2009
IEEE
Abstract-- We consider a novel problem of top-k query processing under budget constraints. We provide both a framework and a set of algorithms to address this problem. Existing alg...
216
click to vote
ICDT
1995
ACM
15 years 4 months ago
1995
ACM
Abstract. Extension of the relational database model to represent complex data has been a focus of much research in recent years. At the same time, an alternative extension of the ...
124
Voted
AICOM
2004
15 years 14 days ago
2004
Abstract. We address the problem of answering queries using expressive symmetric inter-schema constraints which allow to establish mappings between several heterogeneous informatio...
93
Voted
ICDT
2003
ACM
15 years 5 months ago
2003
ACM
We study extensions of first-order logic over the reals with different types of transitive-closure operators as query languages for constraint databases that can be described by...