scientific article; zbMATH DE number 176244

zbMATH Open0766.68026MaRDI QIDQ4035348FDOQ4035348

Authors: Serge Abiteboul, Victor Vianu 

Publication date: 18 May 1993

Title of this publication is not available (Why is that?)

Recommendations

• Comparison of expressive power of some query languages for databases
• Expressive power of SQL.
• scientific article; zbMATH DE number 2080461
• scientific article; zbMATH DE number 1515857
• Algebraic and calculus query languages for recursively typed complex objects

zbMATH Keywords

fixpoint queriescomplexity classes of queriesgeneric machinerecursive extensions of the first-order querieswhile queries

Mathematics Subject Classification ID

Theory of programming languages (68N15) Database theory (68P15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cited In (17)

• Querying disjunctive databases through nonmonotonic logics
• Expressive power of SQL.
• Role of determinism in query languages for data bases
• Bounded arity Datalog \((\neq)\) queries on graphs
• Circumscribing DATALOG: expressive power and complexity
• The expressive power of the temporal query language \(L_{\mathcal H}\)
• Comparison of expressive power of some query languages for databases
• Abstract interpretation of database query languages
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The dichotomous intensional expressive power of the nested relational calculus with powerset
• Polynomial-time computable stable models
• Expressiveness of structured document query languages based on attribute grammars
• Bounded fixpoints for complex objects
• The expressiveness of a family of finite set languages
• A framework for comparing query languages in their ability to express Boolean queries

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4035348)