On the completeness of query languages for relational data bases

Bancilhon, François

doi:10.1007/3-540-08921-7_60

Cited by 63 publications

(44 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…By the induction hypothesis, p1 ≡ 3 p2. Finally, Lemma 8 yields condition (1). We may thus conclude that m1 ≡ 3 m2.…”

Section: ñmentioning

confidence: 63%

“…Using the same argument used for statement (1) in the proof of Theorem 1, we obtain LEMMA 7. Let D = (V, Ed, r, λ) be a document, and let m1, m2 ∈ V .…”

Section: Lemma 6 Let E Be An Xpath-algebra Expression Let D = (Vmentioning

confidence: 85%

“…(A similar duality exists in the relational database model, where Bancilhon [1] and Paredaens [21] considered and characterized expressiveness at the instance level, which, subsequently, Chandra and Harel [7] contrasted with expressiveness at the query level. )…”

Section: Introductionmentioning

confidence: 80%

See 2 more Smart Citations

Structural characterizations of the semantics of XPath as navigation tool on a document

Gyssens

Paredaens

Gucht

et al. 2006

Proceedings of the Twenty-Fifth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems

View full text Add to dashboard Cite

Given a document D in the form of an unordered labeled tree, we study the expressibility on D of various fragments of XPath, the core navigational language on XML documents. We give characterizations, in terms of the structure of D, for when a binary relation on its nodes is definable by an XPath expression in these fragments. Since each pair of nodes in such a relation represents a unique path in D, our results therefore capture the sets of paths in D definable in XPath. We refer to this perspective on the semantics of XPath as the "global view." In contrast with this global view, there is also a "local view" where one is interested in the nodes to which one can navigate starting from a particular node in the document. In this view, we characterize when a set of nodes in D can be defined as the result of applying an XPath expression to a given node of D. All these definability results, both in the global and the local view, are obtained by using a robust two-step methodology, which consists of first characterizing when two nodes cannot be distinguished by an expression in the respective fragments of XPath, and then bootstrapping these characterizations to the desired results.

show abstract

“…By the induction hypothesis, p1 ≡ 3 p2. Finally, Lemma 8 yields condition (1). We may thus conclude that m1 ≡ 3 m2.…”

Section: ñmentioning

confidence: 63%

“…Using the same argument used for statement (1) in the proof of Theorem 1, we obtain LEMMA 7. Let D = (V, Ed, r, λ) be a document, and let m1, m2 ∈ V .…”

Section: Lemma 6 Let E Be An Xpath-algebra Expression Let D = (Vmentioning

confidence: 85%

See 1 more Smart Citation

Structural characterizations of the semantics of XPath as navigation tool on a document

Gyssens

Paredaens

Gucht

et al. 2006

Proceedings of the Twenty-Fifth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems

View full text Add to dashboard Cite

show abstract

“…Codd's pioneering work [Codd] on the relational calcuhts and algebra, a lot of work has been done on studying and comparing the expressive power of several query languages [AU,Ba,Cttl,CII2.CH3,Chan,Coop,Pa].…”

Section: Introductionmentioning

confidence: 99%

The complexity of relational query languages (Extended Abstract)

Vardi¹

1982

Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing - STOC '82

1,018

660

View full text Add to dashboard Cite

Two complexity measures for query languages are proposed. Data complexity is the complexity of evaluating a query in the language as a function of the size of the database, and expression complexity is the complexity of ewduating a query in the language as a function of the size of the expression defining the query. We study the data and expression complexity of logical langnages -relational calculus and its extensions by transitive closure, fixpoint and second order existential quantification -and algebraic languages -relational algebra and its extensions by bounded and unbounded looping. The pattern which will bc shown is that the expression complexity of the investigated languages is one exponential higher then their data complexity, and for both types of complexity we show completeness in some complexity class.

show abstract

“…W E investigate a generalization of the classic result of Bancilhon and Paredaens on the expressive power of the relational algebra [1], [3], [10] concerning the following decision problem:…”

Section: Introductionmentioning

confidence: 99%