Reflective relational machines

DOI10.1006/inco.1998.2701zbMath0918.68017OpenAlexW2002748825MaRDI QIDQ1271557

Serge Abiteboul, Victor Vianu, Christos H. Papadimitriou

Publication date: 23 August 1999

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.1998.2701

zbMATH Keywords

query languagesreflective database programmingrelational machine

Mathematics Subject Classification ID

Database theory (68P15)

Related Items

Computable Queries for Object Oriented Databases ⋮ On the expressibility and the computability of untyped queries ⋮ The Relational Polynomial-Time Hierarchy and Second-Order Logic

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing with infinitary logic
• Descriptive characterizations of computational complexity
• Upper and lower bounds for first order expressibility
• A characterization of the power of vector machines
• Structure and complexity of relational queries
• Computing with first-order logic
• Relational queries computable in polynomial time
• Languages that Capture Complexity Classes
• Alternation
• On Moschovakis closure ordinals
• Expressibility and Parallel Complexity
• Fixpoint logics, relational machines, and computational complexity
• Deux ou trois choses que je sais de L_n