Sciweavers

10 search results - page 1 / 2
» Query Rewriting under Non-Guarded Rules
Sort
View
AMW
2010
13 years 6 months ago
Query Rewriting under Non-Guarded Rules
We address the problem of answering conjunctive queries over knowledge bases, specified by sets of first-order sentences called tuple-generating dependencies (TGDs). This problem i...
Andrea Calì, Georg Gottlob, Andreas Pieris
CIKM
2004
Springer
13 years 10 months ago
QFilter: fine-grained run-time XML access control via NFA-based query rewriting
At present, most of the state-of-the-art solutions for XML access controls are either (1) document-level access control techniques that are too limited to support fine-grained sec...
Bo Luo, Dongwon Lee, Wang-Chien Lee, Peng Liu
EDBTW
2010
Springer
13 years 11 months ago
SPARQL query rewriting for implementing data integration over linked data
There has been lately an increased activity of publishing structured data in RDF due to the activity of the Linked Data community1 . The presence on the Web of such a huge informa...
Gianluca Correndo, Manuel Salvadores, Ian Millard,...
IDEAS
2005
IEEE
93views Database» more  IDEAS 2005»
13 years 10 months ago
Semantic Query Transformation Using Ontologies
Traditional approaches to query processing aim at rewriting a given query into another more efficient one that uses less time and/or resources during the execution. There by, the...
Chokri Ben Necib, Johann Christoph Freytag
VLDB
2001
ACM
151views Database» more  VLDB 2001»
14 years 4 months ago
Approximate query mapping: Accounting for translation closeness
Abstract In this paper we present a mechanism for approximately translating Boolean query constraints across heterogeneous information sources. Achieving the best translation is ch...
Kevin Chen-Chuan Chang, Hector Garcia-Molina