Finitely representable databases
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1059245
- scientific article; zbMATH DE number 125213
- Algebraic databases
- On the decidability and axiomatization of query finiteness in deductive databases
- Databases over a fixed infinite universe
- Extremal theorems for databases
- scientific article; zbMATH DE number 2080031
- An Algebraic Theory of Relational Databases
- scientific article; zbMATH DE number 4074461
- scientific article; zbMATH DE number 1302667
Cites work
- scientific article; zbMATH DE number 3885853 (Why is no real title available?)
- scientific article; zbMATH DE number 3890770 (Why is no real title available?)
- scientific article; zbMATH DE number 3819693 (Why is no real title available?)
- scientific article; zbMATH DE number 3467028 (Why is no real title available?)
- scientific article; zbMATH DE number 3497890 (Why is no real title available?)
- scientific article; zbMATH DE number 1142296 (Why is no real title available?)
- scientific article; zbMATH DE number 1479611 (Why is no real title available?)
- scientific article; zbMATH DE number 219205 (Why is no real title available?)
- scientific article; zbMATH DE number 219206 (Why is no real title available?)
- scientific article; zbMATH DE number 839556 (Why is no real title available?)
- scientific article; zbMATH DE number 6157246 (Why is no real title available?)
- scientific article; zbMATH DE number 3057871 (Why is no real title available?)
- scientific article; zbMATH DE number 3068536 (Why is no real title available?)
- A relational model of data for large shared data banks
- Algebraic and calculus query languages for recursively typed complex objects
- An application of games to the completeness problem for formalized theories
- Completeness results for recursive data bases
- Computable queries for relational data bases
- Datalog extensions for database queries and updates
- Domain independence and the relational calculus
- Finite-model theory -- A personal perspective
- First-Order Queries on Finite Structures Over the Reals
- Indexing for data models with constraints and classes
- Languages that Capture Complexity Classes
- Metafinite model theory
- Model theory
- On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination
- On the expressive power of database queries with intermediate types
- Parity, circuits, and the polynomial-time hierarchy
- Probabilities on finite models
- Relational queries computable in polynomial time
- Relative Information Capacity of Simple Relational Database Schemata
- Sentences true in all constructive models
- Structure and complexity of relational queries
- The complexity of elementary algebra and geometry
- The elementary theory of restricted analytic fields with exponentiation
- \(\Sigma_ 1^ 1\)-formulae on finite structures
Cited in
(21)- scientific article; zbMATH DE number 1302667 (Why is no real title available?)
- Topological elementary equivalence of regular semi-algebraic sets in three-dimensional space
- Aggregate operators in constraint query languages
- Extended order-generic queries
- Linear constraint query languages expressive power and complexity
- Databases over a fixed infinite universe
- scientific article; zbMATH DE number 1515857 (Why is no real title available?)
- Constraint-generating dependencies
- Queries with arithmetical constraints
- A representation independent language for planar spatial databases with Euclidean distance
- Database query processing using finite cursor machines
- Uniform generation in spatial constraint databases and applications
- scientific article; zbMATH DE number 1555933 (Why is no real title available?)
- On the decidability and axiomatization of query finiteness in deductive databases
- A technique for proving decidability of containment and equivalence of linear constraint queries
- scientific article; zbMATH DE number 1688383 (Why is no real title available?)
- Action theories over generalized databases with equality constraints
- Metafinite model theory
- Metafinite model theory
- Arity bounds in first-order incremental evaluation and definition of polynomial time database queries
- Querying spatial databases via topological invariants
This page was built for publication: Finitely representable databases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1376408)
