Sciweavers

298 search results - page 48 / 60
» Query Rewriting in DL-Lite_^(HN)_horn
Sort
View
VLDB
1987
ACM
104views Database» more  VLDB 1987»
15 years 2 months ago
Magic Functions: A Technique to Optimize Extended Datalog Recursive Programs
Severalmethodshavebeenproposedto compile recursive Datalog programs. The most well-known perform a rewriting of rules using MAGIC or PROBLEM predicates in order to push selections...
Georges Gardarin
PVLDB
2010
105views more  PVLDB 2010»
14 years 9 months ago
Destabilizers and Independence of XML Updates
Independence analysis is the problem of determining whether an update affects the result of a query, e.g. a constraint or materialized view. We develop a new, modular framework fo...
Michael Benedikt, James Cheney
EDBT
2009
ACM
208views Database» more  EDBT 2009»
15 years 5 months ago
Flexible and efficient querying and ranking on hyperlinked data sources
There has been an explosion of hyperlinked data in many domains, e.g., the biological Web. Expressive query languages and effective ranking techniques are required to convert this...
Ramakrishna Varadarajan, Vagelis Hristidis, Louiqa...
ICDE
2006
IEEE
152views Database» more  ICDE 2006»
16 years 11 days ago
A Complete and Efficient Algebraic Compiler for XQuery
As XQuery nears standardization, more sophisticated XQuery applications are emerging, which often exploit the entire language and are applied to non-trivial XML sources. We propos...
Christopher Re, Jérôme Siméon,...
AMW
2011
14 years 2 months ago
Subqueries in SPARQL
Subqueries are a poweful feature which allows to enforce reuse, composition, rewriting and optimization in a query language. In this paper we perform a comprehensive study of the i...
Renzo Angles, Claudio Gutierrez