Publication:4935250
From MaRDI portal
zbMath0935.00022MaRDI QIDQ4935250
No author found.
Publication date: 31 January 2000
00B15: Collections of articles of miscellaneous specific interest
68-06: Proceedings, conferences, collections, etc. pertaining to computer science
Related Items
Definability with a predicate for a semi-linear set, On the decidability of termination of query evaluation in transitive-closure logics for polynomial constraint databases, Evaluating geometric queries using few arithmetic operations, Cardinal directions between spatial objects: the pairwise-consistency problem, 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, 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, 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, Unnamed Item, Quantifier elimination for elementary geometry and elementary affine geometry, Database Theory, Yuri, and Me
