Constraint databases
The articles of this volume will be reviewed individually. Indexed articles: \textit{Van den Bussche, Jan}, Constraint databases, queries and query languages, 21-54 [Zbl 0962.68046] \textit{Benedikt, Michael; Lipkin, Leonid}, Expressive power: The finit case, 55-87 [Zbl 0989.68043] \textit{Grumbach, Stéphane; Kuper, Gabriel; Su, Jianwen}, Expressive power: The infinite case, 89-107 [Zbl 0989.68044] \textit{Benedikt, Michael; Libkin, Leonid}, Query safety with constraints, 109-129 [Zbl 0989.68045] \textit{Chomicki, Jan; Libkin, Leonid}, Aggregate languages for constraint databases, 131-154 [Zbl 1005.68052] \textit{Revesz, Peter Z.}, DATALOG and constraints, 155-174 [Zbl 0962.68047] \textit{Kuper, Gabriel; Scholl, Michel}, Geographic information systems, 175-198 [Zbl 0969.68541] \textit{Gyssens, Marc; Vandeurzen, Luc; Van Gucht, Dirk}, Linear-constraint databases, 199-229 [Zbl 1002.68045] \textit{Kuijpers, Bart; Vianu, Victor}, Topological queries, 231-273 [Zbl 1002.68046] \textit{Kuijpers, Bart; Kuper, Gabriel; Paredaens, Jan}, Euclidean query languages, 275-291 [Zbl 0964.68058] \textit{Kuijpers, Bart; Van Gucht, Dirk}, Genericity in spatial databases, 293-303 [Zbl 0962.68048] \textit{Wolper, Pierre}, Linear repeating points, 305-314 [Zbl 0989.68036] \textit{Grumbach, Stéphane; Lacroix, Zoé; Rigaux, Philippe; Segoufin, Luc}, Optimization techniques, 319-334 [Zbl 0962.68049] \textit{Goldin, Dina}, Constraint algebras, 335-342 [Zbl 0962.68050] \textit{Ramaswamy, Sridhar}, I/O-efficient algorithms for CDBs, 343-360 [Zbl 0962.68051] \textit{Grumbach, Stéphane; Rigaux, Philippe; Scholl, Michel; Segoufin, Luc}, The DEDALE prototype, 365-382 [Zbl 0969.68692] \textit{Revesz, Peter}, The DISCO system, 383-389 [Zbl 0969.68693] \textit{Toman, David}, SQL/TP: A temporal extension of SQL, 391-399 [Zbl 0962.68052]
- A collapse result for constraint queries over structures of small degree
- Reachability and connectivity queries in constraint databases
- Quantifier rank for parity of embedded finite models.
- On the orthographic dimension of definable sets
- An expressive language for linear spatial database queries
- First-order expressibility of languages with neutral letters or: The Crane Beach conjecture
- Efficient evaluation of specific queries in constraint databases
- Deciding the point-to-fixed-point problem for skew tent maps on an interval
- Database querying under changing preferences
- An extended constraint deductive database: theory and implementation
- Counting complexity classes for numeric computations. II: Algebraic and semialgebraic sets
- \(N\)-dimensional versus \((N-1)\)-dimensional connectivity testing of first-order queries to semi-algebraic sets
- A representation independent language for planar spatial databases with Euclidean distance
- A safe relational calculus for functional logic deductive databases
- Quantifier elimination for elementary geometry and elementary affine geometry
- On the expressive power of query languages for matrices
- Database Theory, Yuri, and Me
- Definability with a predicate for a semi-linear set
- scientific article; zbMATH DE number 7566047 (Why is no real title available?)
- Topological elementary equivalence of regular semi-algebraic sets in three-dimensional space
- On the decidability of termination of query evaluation in transitive-closure logics for polynomial constraint databases
- Database queries and constraints via lifting problems
- First-Order Rewritability and Complexity of Two-Dimensional Temporal Ontology-Mediated Queries
- Inputs, Outputs, and Composition in the Logic of Information Flows
- An efficient quantifier elimination procedure for Presburger arithmetic
- Evaluating geometric queries using few arithmetic operations
- The descriptive complexity of graph neural networks
- Cardinal directions between spatial objects: the pairwise-consistency problem
- Algorithms to decide the generalised alibi query for space-time prisms with stationary activity time
- Queries with external predicates
- Logic programming with infinite sets
- Database query languages and functional logic programming
- An Ehrenfeucht-Fraïssé game approach to collapse results in database theory
- Trajectory databases: data models, uncertainty and complete query languages
This page was built for publication: Constraint databases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4935250)