Complete Geometric Query Languages

@article{Gyssens1999CompleteGQ,
  title={Complete Geometric Query Languages},
  author={M. Gyssens and J. Bussche and D. V. Gucht},
  journal={J. Comput. Syst. Sci.},
  year={1999},
  volume={58},
  pages={483-511}
}
We extend Chandra and Harel's seminal work on computable queries for relational databases to a setting in which also spatial data may be present, using a constraint-based data model. Concretely, we introduce both coordinate-based and point-based query languages that are complete in the sense that they can express precisely all computable queries that are generic with respect to certain classes of transformations of space, corresponding to certain geometric interpretations of spatial data. The… Expand
Constraint Databases, Queries, and Query Languages
  • J. Bussche
  • Computer Science
  • Constraint Databases
  • 2000
TLDR
The constraint database model, the concept of query in this model, and the basic constraint query languages provided by the relational calculus, the relational algebra, and Datalog are formally defined. Expand
On the expressiveness of linear-constraint query languages for spatial databases
TLDR
This paper presents a method to extend FO+linear with operators in a sound way with respect to the linear queries expressible in FO + poly, and argues its validity by comparing it to another paradigm for enriching FO+ linear. Expand
Uniform generation in spatial constraint databases and applications (Extended abstract)
TLDR
The notion of an almost uniform generator for a generalized relation is defined and the classical generator of Dyer, Frieze and Kannan for convex sets is extended to the union and the projection of relations. Expand
Linear Approximation of Semi-algebraic Spatial Databases Using Transitive Closure Logic, in Arbitrary Dimension
TLDR
It is proved that first-order logic with a transitive closure operator extended with stop conditions, can express all Boolean topological queries on semi-algebraic spatial databases of arbitrary dimension. Expand
First-order complete and computationally complete query languages for spatio-temporal databases
TLDR
This work defines spatio-temporal queries to be computable mappings that are also generic, meaning that the result of a query may only depend to a limited extent on the actual internal representation of the spatio/temporal data. Expand
Uniform generation in spatial constraint databases and applications
TLDR
The notion of an almost uniform generator for a generalized relation is defined and the classical generator of Dyer, Frieze and Kannan for convex sets is extended to the union and the projection of relations. Expand
A Theory of Spatio-Temporal Database Queries
TLDR
Different genericity classes relative to the constraint database model for spatio-temporal databases are investigated and sound and complete languages for the first-order, respectively the computable, queries in these genericityclasses are identified. Expand
Applications of Alfred Tarski's Ideas in Database Theory
TLDR
Many ideas of Alfred Tarski - one of the founders of modern logic - find application in database theory, and Topics discussed include the genericity of database queries; the relational algebra, the Tarskian definition of truth for the relational calculus, and cylindric algebras. Expand
Chapter 1 REAL ALGEBRAIC GEOMETRY AND CONSTRAINT DATABASES
The constraint database model can be seen as a generalization of the classical relational database model that was introduced by Codd in the 1970s to deal with the management of alpha-numerical data,Expand
On first-order topological queries
TLDR
This work studies topological queries expressible in the standard query language on spatial databases, first-order logic with various amounts of arithmetic, and results in a combinatorial characterization of the expressive power of topological first- order logic on regular spatial databases. Expand
...
1
2
3
4
...

References

SHOWING 1-10 OF 21 REFERENCES
Computable Queries for Relational Data Bases
TLDR
The main result is the completeness of a simple programming language which can be thought of as consisting of the relational algebra augmented with the power of iteration. Expand
Procedural Languages for Database Queries and Updates
TLDR
A completeness criterion for database languages is introduced, based on their capability to express database transformations, and specific deterministic and non-deterministic transformation languages are defined and shown to be complete. Expand
Constraint Query Languages
TLDR
It is shown that efficient, declarative database programming can be combined with efficient constraint solving and the key intuition is that the generalization of a ground fact is a conjunction of constraints over a small number of variables. Expand
Queries with Arithmetical Constraints
TLDR
It is shown that over all domains, enough arithmetic lead to arithmetical queries, therefore, showing the frontiers of constraints for database purposes, and it is proved that linear queries can be evaluated in AC0 over finite integer databases, and in NC1 over linear constraint databases. Expand
Topological queries in spatial databases
TLDR
It is shown that fixpoint expresses precisely the PTIME queries on topological invariants, which suggests that topolo- gical invariants are particularly well-behaved with respect to descriptive complexity. Expand
Alfred Tarski's Elimination Theory for Real Closed Fields
  • L. Dries
  • Mathematics, Computer Science
  • J. Symb. Log.
  • 1988
TLDR
This survey considers some of the remarkable and totally unforeseen ways in which Tarski's theorem functions nowadays in mathematics, logic and computer science. Expand
On the “piano movers” problem. II. General techniques for computing topological properties of real algebraic manifolds
This paper continues the discussion, begun in J. Schwartz and M. Sharir [Comm. Pure Appl. Math., in press], of the following problem, which arises in robotics: Given a collection of bodies B, whichExpand
Book Review: Topology – an introduction with applications to topological groups
Alot of introductory books on general topology have appeared in recent years and the best buy depends on the aims and background knowledge of the reader. This book puts special emphasis onExpand
A Decision Method For Elementary Algebra And Geometry
By a decision method for a class K of sentence (or other expressions) is meant a method by means of which, given any sentence θ, one can always decide in a finite number of steps whether θ is in K;Expand
Elementary Geometry
YOUR correspondent, “A Father,” has in view a very desirable object—to teach a young child geometry—but I fear that he is likely to miss altogether the path by which it may be reached. His principle,Expand
...
1
2
3
...