Database Theory, Yuri, and Me
From MaRDI portal
Publication:3585996
DOI10.1007/978-3-642-15025-8_2zbMath1287.68037OpenAlexW1526746873MaRDI QIDQ3585996
Publication date: 3 September 2010
Published in: Fields of Logic and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-15025-8_2
Database theory (68P15) Biographies, obituaries, personalia, bibliographies (01A70) History of computer science (68-03)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The implication and finite implication problems for typed template dependencies
- Choiceless polynomial time
- Computable queries for relational data bases
- Datalog extensions for database queries and updates
- Datalog vs first-order logic
- Metafinite model theory
- Structure and complexity of relational queries
- Abstract state machines and computationally complete query languages
- Database query processing using finite cursor machines
- Choiceless polynomial time, counting and the Cai-Fürer-Immerman graphs
- The inference problem for template dependencies
- On the Descriptive Complexity of Linear Algebra
- The word problem for cancellation semigroups with zero
- Relational queries computable in polynomial time
- What are logical notions?
- On the completeness of object-creating database transformation languages
- On polynomial time computation over unordered structures
- Evolving Algebras 1993: Lipari Guide
