An Extended Algebra for Constraint Databases

@article{Belussi1998AnEA,
  title={An Extended Algebra for Constraint Databases},
  author={Alberto Belussi and Elisa Bertino and Barbara Catania},
  journal={IEEE Trans. Knowl. Data Eng.},
  year={1998},
  volume={10},
  pages={686-705}
}
Constraint relational databases use constraints to both model and query data. A constraint relation contains a finite set of generalized tuples. Each generalized tuple is represented by a conjunction of constraints on a given logical theory and, depending on the logical theory and the specific conjunction of constraints, it may possibly represent an infinite set of relational tuples. For their characteristics, constraint databases are well suited to model multidimensional and structured data… 
Introducing External Functions in Constraint Query Languages
TLDR
This paper proposes an algebra and a calculus for constraint relational databases extended with external functions, formally proving their equivalence, and is the first approach to introduce external functions in constraint query languages.
Manipulating Spatial Data in Constraint Databases
TLDR
This paper extends the model and the algebra to directly deal with the set of points represented by a generalized tuple (a spatial object), retaining at the same time the ability of expressing all computations that can be expressed by other constraint database languages.
A Safe Calculus and Algebra for Querying Functional Logic Deductive Databases ?
TLDR
The extended relational calculus is based on the relational first-order logic, by adding constraints in the form of equalities and disequalities over complex values and interpreted functions, and the notion of safety over calculus formulas is proposed.
An Extended Relational Algebra for Declarative Programming
TLDR
This paper presents a relational algebra based in the use of the operators of projection, selection, renaming, cross product, union and join that can be used for dening predicates and functions for a declarative language, and in general for de ning clauses and rewriting rules.
Finitely Representable Nested Relations
A Relational Algebra for Functional Logic Deductive Databases
TLDR
This paper studies the integration of functional logic programming and databases by presenting a data model, and a query and data definition language based on the use of algebra expressions built from a set of algebra operators over an extended relational algebra.
Modeling spatial and temporal data in an object oriented constraint database framework
TLDR
This thesis presents an object-oriented model to represent constraint databases, able to represent spatial and temporal information and, to exploit existing spatial and spatial tools, like the one of Oracle8, preserving the declarativeness of the first-order languages.
Hierarchical optimization of linear constraint processing
TLDR
The main contribution of the paper is the development of a set of rewriting rules, that allow the transformation of queries into equivalent ones that make use of the approximation, which is important for the range of applications considered.
Spatio-Temporal Data Handling with Constraints
TLDR
This paper presents a data model, based on linear constraints, dedicated to the representation and manipulation of multidimensional data, and restricts the orthographic dimension of an object O, defined as the dimension of the components O1, On such that O=O1×...× On.
Database query languages and functional logic programming
TLDR
This paper proposes a data model involving the main features adopted from functional logic programming, and uses conditional rewriting rules as data definition language and deals with equality and inequality constraints as query language, and proves that three alternative query languages are equivalent.
...
...

References

SHOWING 1-10 OF 64 REFERENCES
Introducing External Functions in Constraint Query Languages
TLDR
This paper proposes an algebra and a calculus for constraint relational databases extended with external functions, formally proving their equivalence, and is the first approach to introduce external functions in constraint query languages.
Manipulating Spatial Data in Constraint Databases
TLDR
This paper extends the model and the algebra to directly deal with the set of points represented by a generalized tuple (a spatial object), retaining at the same time the ability of expressing all computations that can be expressed by other constraint database languages.
Constraint Programming and Database Query Languages
TLDR
This overview of constraint query languages (CQLs) presents an algebra for dense order constraints that is simpler to evaluate than the calculus described in [KKR], and sharpen some of the related data complexity bounds.
Elements of Relational Database Theory
  • P. Kanellakis
  • Computer Science
    Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics
  • 1990
Towards a theory of spatial database queries (extended abstract)
TLDR
A general model for spatial databases is considered, which extends the relational model by allowing as tuple components not only atomic values but also geometrical figures, and the concept of spatial database query is investigated.
Datalog Queries of Set Constraint Databases
TLDR
Datalog⊂P(Z) queries over set constraint databases are shown to be evaluable bottom-up in closed form and to have DEXPTIME-complete data complexity.
Integrating Relational Databases and Constraint Languages
Database theory column
TLDR
The state-of-the art in database complex objects is reviewed, such as language expressive power and complexity, and equivalent rule-based languages with fixpoint semantics are described.
Dense-order constraint databases (extended abstract)
TLDR
This work provides in particular an exact characterization of the class of dense order queries computable in PTIME (data complexity), and proves that region and graph connectivity queries are not definable with linear constraints.
The LyriC language: querying constraint objects
TLDR
The proposed LyriC language is designed to provide a uniform and flexible framework for diverse application realms such as constraint-based design in two-, three-dimensional space, large-scale optimization and analysis, based mostly on linear programming techniques, and spatial and geographic databases.
...
...