On database query languages for K-relations

DOI10.1016/j.jal.2009.09.001zbMath1192.68211OpenAlexW2040228039MaRDI QIDQ975870

Floris Geerts, Antonella Poggi

Publication date: 11 June 2010

Published in: Journal of Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jal.2009.09.001

zbMATH Keywords

provenancequery languagerelational modelannotationslanguage completeness

Mathematics Subject Classification ID

Database theory (68P15)

Related Items

Extending relational algebra with similarities ⋮ Towards provenance in heterogeneous knowledge bases ⋮ Provenance analysis for logic and games ⋮ SIMILARITY-BASED RELATIONS IN DATALOG PROGRAMS ⋮ Why-provenance information for RDF, rules, and negation ⋮ Datalog: Bag Semantics via Set Semantics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Query evaluation in probabilistic relational databases
• Equationally complete classes of commutative monoids with monus
• Lattice ordered rings and function rings
• On the expressive power of the relational algebra
• Query languages for bags and aggregate functions
• Equational fragments of systems for arithmetic.
• Incomplete Information in Relational Databases