On the expressive power of database queries with intermediate types

DOI10.1016/0022-0000(91)90036-5zbMath0764.68029OpenAlexW2009592055MaRDI QIDQ1176290

Richard Hull, Jianwen Su

Publication date: 25 June 1992

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(91)90036-5

zbMATH Keywords

queriescomplex object calculus

Mathematics Subject Classification ID

Database theory (68P15)

Related Items (17)

Computing queries with higher-order logics ⋮ Domain independence and the relational calculus ⋮ The most nonelementary theory ⋮ Finitely representable databases ⋮ The complexity of the evaluation of complex algebra expressions ⋮ Bounded fixpoints for complex objects ⋮ An analysis of the Core-ML language: Expressive power and type reconstruction ⋮ The expressive power of cardinality-bounded set values in object-based data models ⋮ Comparison of functional and predicative query paradigms ⋮ The powerset algebra as a natural tool to handle nested database relations ⋮ Algebraic and calculus query languages for recursively typed complex objects ⋮ Computable Queries for Object Oriented Databases ⋮ Expressibility of Higher Order Logics ⋮ A sound and complete model-generation procedure for consistent and confidentiality-preserving databases ⋮ The Descriptive Complexity of the Deterministic Exponential Time Hierarchy ⋮ Simulation of the nested relational algebra by the flat relational algebra, with an application to the complexity of evaluating powerset algebra expressions ⋮ Irreversibility problem in NL-class relations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The expressive power of stratified logic programs
• A calculus for complex objects
• Computable queries for relational data bases
• The polynomial-time hierarchy
• Domain independence and the relational calculus
• Structure and complexity of relational queries
• Horn clause queries and generalizations
• Relative Information Capacity of Simple Relational Database Schemata
• Relational queries computable in polynomial time
• The Format Model
• Extended algebra and calculus for nested relational databases
• Equality and Domain Closure in First-Order Databases
• On Database Logic
• Expectations for Inbreeding Depression on Self-Fertilization of Tetraploids

This page was built for publication: On the expressive power of database queries with intermediate types