Results 1  10
of
160
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 node labels. (Cyc ..."
Abstract

Cited by 63 (7 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 e# ciently. 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.
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 59 (1 self)
 Add to MetaCart
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.
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 40 (1 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.
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 36 (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.
Logics for unranked trees: an overview
 Logical Methods in Computer Science 2, Issue 3, Paper 2
, 2006
"... Vol. 2 (3:2) 2006, pp. 1–31 www.lmcsonline.org ..."
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 24 (8 self)
 Add to MetaCart
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
Views and Queries: Determinacy and Rewriting
 In PODS
, 2005
"... We investigate the question of whether a query Q can be answered using a set V of views. We first define the problem in informationtheoretic terms: we say that V determines Q if V provides enough information to uniquely determine the answer to Q. Next, we look at the problem of rewriting Q in terms ..."
Abstract

Cited by 17 (1 self)
 Add to MetaCart
We investigate the question of whether a query Q can be answered using a set V of views. We first define the problem in informationtheoretic terms: we say that V determines Q if V provides enough information to uniquely determine the answer to Q. Next, we look at the problem of rewriting Q in terms of V using a specific language. Given a view language V and query language Q, we say that a rewriting language R is complete for VtoQ rewritings if every Q ∈Qcan be rewritten in terms of V ∈ Vusing a query in R, whenever V determines Q. While query rewriting using views has been extensively investigated for some specific languages, the connection to the informationtheoretic notion of determinacy, and the question of completeness of a rewriting language, have received little attention. In this paper we investigate systematically the notion of determinacy and its connection to rewriting. The results concern decidability of determinacy for various view and query languages, as well as the power required of complete rewriting languages. We consider languages ranging from firstorder to conjunctive queries. 1.
Algorithmic MetaTheorems
 In M. Grohe and R. Neidermeier eds, International Workshop on Parameterized and Exact Computation (IWPEC), volume 5018 of LNCS
, 2008
"... Algorithmic metatheorems are algorithmic results that apply to a whole range of problems, instead of addressing just one specific problem. This kind of theorems are often stated relative to a certain class of graphs, so the general form of a meta theorem reads “every problem in a certain class C of ..."
Abstract

Cited by 13 (2 self)
 Add to MetaCart
Algorithmic metatheorems are algorithmic results that apply to a whole range of problems, instead of addressing just one specific problem. This kind of theorems are often stated relative to a certain class of graphs, so the general form of a meta theorem reads “every problem in a certain class C of problems can be solved efficiently on every graph satisfying a certain property P”. A particularly well known example of a metatheorem is Courcelle’s theorem that every decision problem definable in monadic secondorder logic (MSO) can be decided in linear time on any class of graphs of bounded treewidth [1]. The class C of problems can be defined in a number of different ways. One option is to state combinatorial or algorithmic criteria of problems in C. For instance, Demaine, Hajiaghayi and Kawarabayashi [5] showed that every minimisation problem that can be solved efficiently on graph classes of bounded treewidth and for which approximate solutions can be computed efficiently from solutions of certain subinstances, have a PTAS on any class of graphs excluding a fixed minor. While this gives a strong unifying explanation for PTAS of many
The succinctness of firstorder logic on linear orders
 In Proceedings of the 19th IEEE Symposium on Logic in Computer Science (LICS’04
, 2004
"... Abstract. Succinctness is a natural measure for comparing the strength of different logics. Intuitively, a logic L1 is more succinct than another logic L2 if all properties that can be expressed in L2 can be expressed in L1 by formulas of (approximately) the same size, but some properties can be exp ..."
Abstract

Cited by 12 (1 self)
 Add to MetaCart
Abstract. Succinctness is a natural measure for comparing the strength of different logics. Intuitively, a logic L1 is more succinct than another logic L2 if all properties that can be expressed in L2 can be expressed in L1 by formulas of (approximately) the same size, but some properties can be expressed in L1 by (significantly) smaller formulas. We study the succinctness of logics on linear orders. Our first theorem is concerned with the finite variable fragments of firstorder logic. We prove that: (i) Up to a polynomial factor, the 2 and the 3variable fragments of firstorder logic on linear orders have the same succinctness. (ii) The 4variable fragment is exponentially more succinct than the 3variable fragment. Our second main result compares the succinctness of firstorder logic on linear orders with that of monadic secondorder logic. We prove that the fragment of monadic secondorder logic that has the same expressiveness as firstorder logic on linear orders is nonelementarily more succinct than firstorder logic. 1.