Results 1  10
of
289
FirstOrder Query Rewriting for Inconsistent Databases
, 2007
"... We consider the problem of retrieving consistent answers over databases that might be inconsistent with respect to a set of integrity constraints. In particular, we concentrate on sets of constraints that consist of key dependencies, and we give an algorithm that computes the consistent answers fo ..."
Abstract

Cited by 76 (2 self)
 Add to MetaCart
(Show Context)
We consider the problem of retrieving consistent answers over databases that might be inconsistent with respect to a set of integrity constraints. In particular, we concentrate on sets of constraints that consist of key dependencies, and we give an algorithm that computes the consistent answers for a large and practical class of conjunctive queries. Given a query q, the algorithm returns a firstorder query Q (called a query rewriting) such that for every (potentially inconsistent) database I, the consistent answers for q can be obtained by evaluating Q directly on I.
Conjunctive Queries over Trees
, 2004
"... We study the complexity and expressive power of conjunctive queries over unranked labeled trees, where the tree structures are represented using âaxis relationsâ such as âchildâ, âdescendantâ, and âfollowingâ (we consider a superset of the XPath axes) as well as unary relations for n ..."
Abstract

Cited by 75 (8 self)
 Add to MetaCart
We study the complexity and expressive power of conjunctive queries over unranked labeled trees, where the tree structures are represented using âaxis relationsâ such as âchildâ, âdescendantâ, and âfollowingâ (we consider a superset of the XPath axes) as well as unary relations for node labels. (Cyclic) conjunctive queries over trees occur in a wide range of data management scenarios related to XML, the Web, and computational linguistics. We establish a framework for characterizing structures representing trees for which conjunctive queries can be evaluated efficiently. Then we completely chart the tractability frontier of the problem for our axis relations, i.e., we find all subsetmaximal sets of axes for which query evaluation is in polynomial time. All polynomialtime results are obtained immediately using the proof techniques from our framework. Finally, we study the expressiveness of conjunctive queries over trees and compare it to the expressive power of fragments of XPath. We show that for each conjunctive query, there is an equivalent acyclic positive query (i.e., a set of acyclic conjunctive queries), but that in general this query is not of polynomial size.
Xpath leashed
 IN ACM COMPUTING SURVEYS
, 2007
"... This survey gives an overview of formal results on the XML query language XPath. We identify several important fragments of XPath, focusing on subsets of XPath 1.0. We then give results on the expressiveness of XPath and its fragments compared to other formalisms for querying trees, algorithms and c ..."
Abstract

Cited by 52 (3 self)
 Add to MetaCart
This survey gives an overview of formal results on the XML query language XPath. We identify several important fragments of XPath, focusing on subsets of XPath 1.0. We then give results on the expressiveness of XPath and its fragments compared to other formalisms for querying trees, algorithms and complexity bounds for evaluation of XPath queries, and static analysis of XPath queries.
A framework for representing and solving NP search problems
 In AAAI
, 2005
"... NP search and decision problems occur widely in AI, and a number of generalpurpose methods for solving them have been developed. The dominant approaches include propositional satisfiability (SAT), constraint satisfaction problems (CSP), and answer set programming (ASP). Here, we propose a declarat ..."
Abstract

Cited by 48 (19 self)
 Add to MetaCart
NP search and decision problems occur widely in AI, and a number of generalpurpose methods for solving them have been developed. The dominant approaches include propositional satisfiability (SAT), constraint satisfaction problems (CSP), and answer set programming (ASP). Here, we propose a declarative constraint programming framework which we believe combines many strengths of these approaches, while addressing weaknesses in each of them. We formalize our approach as a model extension problem, which is based on the classical notion of extension of a structure by new relations. A parameterized version of this problem captures NP. We discuss properties of the formal framework intended to support effective modelling, and prospects for effective solver design.
On the Complexity of Nonrecursive XQuery and Functional Query Languages on Complex Values
 In Proc. PODS’05
"... This article studies the complexity of evaluating functional query languages for complex values such as monad algebra and the recursionfree fragment of XQuery. We show that monad algebra with equality restricted to atomic values is complete for the class TA[2O(n) , O(n)] of problems solvable in lin ..."
Abstract

Cited by 47 (2 self)
 Add to MetaCart
This article studies the complexity of evaluating functional query languages for complex values such as monad algebra and the recursionfree fragment of XQuery. We show that monad algebra with equality restricted to atomic values is complete for the class TA[2O(n) , O(n)] of problems solvable in linear exponential time with a linear number of alternations. The monotone fragment of monad algebra with atomic value equality but without negation is complete for nondeterministic exponential time. For monad algebra with deep equality, we establish TA[2O(n) , O(n)] lower and exponentialspace upper bounds. We also study a fragment of XQuery, Core XQuery, that seems to incorporate all the features of a query language on complex values that are traditionally deemed essential. A close connection between monad algebra on lists and Core XQuery (with “child ” as the only axis) is exhibited, and it is shown that these languages are expressively equivalent up to representation issues. We show that Core XQuery is just as hard as monad algebra w.r.t. query and combined complexity, and that it is in TC0 if the query is assumed fixed. As Core XQuery is NEXPTIMEhard, it is commonly believed that any algorithm for evaluating Core XQuery has to require exponential amounts of working memory and doubly exponential time in the worst case. We present a property of queries – the lack of a certain form of composition – that virtually all realworld XQueries have and that allows for query evaluation in singly exponential time and polynomial space. Still, we are able to show for an important special case – Core XQuery with equality testing restricted to atomic values – that the compositionfree language is just as expressive as the language with composition. Thus, under widelyheld complexitytheoretic assumptions, the compositionfree language is an exponentially less succinct version of the language with composition.
LOGICS FOR UNRANKED TREES: AN OVERVIEW
 CONSIDERED FOR PUBLICATION IN LOGICAL METHODS IN COMPUTER SCIENCE
, 2006
"... Labeled unranked trees are used as a model of XML documents, and logical languages for them have been studied actively over the past several years. Such logics have different purposes: some are better suited for extracting data, some for expressing navigational properties, and some make it easy to ..."
Abstract

Cited by 37 (6 self)
 Add to MetaCart
(Show Context)
Labeled unranked trees are used as a model of XML documents, and logical languages for them have been studied actively over the past several years. Such logics have different purposes: some are better suited for extracting data, some for expressing navigational properties, and some make it easy to relate complex properties of trees to the existence of tree automata for those properties. Furthermore, logics differ significantly in their modelchecking properties, their automata models, and their behavior on ordered and unordered trees. In this paper we present a survey of logics for unranked trees.
Universal algebra and hardness results for constraint satisfaction problems
, 2007
"... Abstract. We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. These criteria also give nonexpressibility results for various restrictions of Datalog. Furthermore, we show tha ..."
Abstract

Cited by 36 (7 self)
 Add to MetaCart
Abstract. We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. These criteria also give nonexpressibility results for various restrictions of Datalog. Furthermore, we show that if CSP(Γ) is not firstorder definable then it is Lhard. Our proofs rely on tame congruence theory and on a finegrain analysis of the complexity of reductions used in the algebraic study of CSP. The results pave the way for a refinement of the dichotomy conjecture stating that each CSP(Γ) lies in P or is NPcomplete and they match the recent classification of [2] for Boolean CSP. We also infer a partial classification theorem for the complexity of CSP(Γ) when the associated algebra of Γ is the full idempotent reduct of a preprimal algebra. Constraint satisfaction problems (CSP) provide a unifying framework to study various computational problems arising naturally in artificial intelligence, combinatorial optimization, graph homomorphisms and database theory. An in
Consistency Checking of Conceptual Models via Model Merging
 In RE
, 2007
"... Requirements elicitation involves the construction of large sets of conceptual models. An important step in the analysis of these models is checking their consistency. Existing research largely focuses on checking consistency of individual models and of relationships between pairs of models. However ..."
Abstract

Cited by 34 (10 self)
 Add to MetaCart
(Show Context)
Requirements elicitation involves the construction of large sets of conceptual models. An important step in the analysis of these models is checking their consistency. Existing research largely focuses on checking consistency of individual models and of relationships between pairs of models. However, such strategy does not guarantee global consistency. In this paper, we propose a consistency checking approach that addresses this problem for homogeneous models. Given a set of models and a set of relationships between them, our approach works by first constructing a merged model and then verifying this model against the consistency constraints of interest. By keeping proper traceability information, consistency diagnostics obtained over the merge are projected back to the original models and their relationships. The paper also presents a set of reusable expressions for defining consistency constraints in conceptual modelling. We demonstrate the use of the developed expressions in the specification of consistency rules for class and ER diagrams, and i ∗ goal models. 1
Homomorphism Preservation Theorems
, 2008
"... The homomorphism preservation theorem (h.p.t.), a result in classical model theory, states that a firstorder formula is preserved under homomorphisms on all structures (finite and infinite) if and only if it is equivalent to an existentialpositive formula. Answering a longstanding question in fin ..."
Abstract

Cited by 27 (0 self)
 Add to MetaCart
The homomorphism preservation theorem (h.p.t.), a result in classical model theory, states that a firstorder formula is preserved under homomorphisms on all structures (finite and infinite) if and only if it is equivalent to an existentialpositive formula. Answering a longstanding question in finite model theory, we prove that the h.p.t. remains valid when restricted to finite structures (unlike many other classical preservation theorems, including the ̷Lo´sTarski theorem and Lyndon’s positivity theorem). Applications of this result extend to constraint satisfaction problems and to database theory via a correspondence between existentialpositive formulas and unions of conjunctive queries. A further result of this article strengthens the classical h.p.t.: we show that a firstorder formula is preserved under homomorphisms on all structures if and only if it is equivalent to an existentialpositive formula of equal quantifierrank.