Domain independence and the relational calculus

DOI10.1007/BF01213204zbMath0818.68067OpenAlexW1990748731MaRDI QIDQ1338897

Richard Hull, Jianwen Su

Publication date: 23 November 1994

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01213204

zbMATH Keywords

countable inventiondomain independental querieslimited interpretationrelational calculus query

Mathematics Subject Classification ID

Database theory (68P15)

Related Items (14)

Query languages for bags and aggregate functions ⋮ Finitely representable databases ⋮ Efficient Evaluation of Arbitrary Relational Calculus Queries ⋮ Expressiveness of SHACL Features and Extensions for Full Equality and Disjointness Tests ⋮ The past and future of embedded finite model theory ⋮ SHACL: a description logic in disguise ⋮ On the expressive power of database queries with intermediate types ⋮ A closed-form evaluation for Datalog queries with integer (gap)-order constraints ⋮ A sound and complete model-generation procedure for consistent and confidentiality-preserving databases ⋮ Reasoning about strings in databases ⋮ Combining Consistency and Confidentiality Requirements in First-Order Databases ⋮ Safety, domain independence and translation of complex value database queries ⋮ The expressive power of stratified logic programs with value invention ⋮ Stability theory, permutations of indiscernibles, and embedded finite models

Cites Work

• Unnamed Item
• Computable queries for relational data bases
• On the expressive power of database queries with intermediate types
• Relative Information Capacity of Simple Relational Database Schemata
• Horn clauses and database dependencies
• A relational model of data for large shared data banks

This page was built for publication: Domain independence and the relational calculus