Related papers: Ideal Databases
We introduce the notion of relation type of an affine algebra and prove that it is well defined by using the Jacobi-Zariski exact sequence of Andr\'e-Quillen homology. In particular, the relation type is an invariant of an affine algebraic…
Network theory has proven to be a powerful tool in describing and analyzing systems by modelling the relations between their constituent objects. In recent years great progress has been made by augmenting `traditional' network theory.…
In this paper, for a given finitely generated algebra (an algebraic structure with arbitrary operations and no predicates) A we study finitely generated limit algebras of A, approaching them via model theory and algebraic geometry. Along…
We consider a core language of graph queries. These queries are seen as formulas to be solved with respect to graph-oriented databases. For this purpose, we first define a graph query algebra where some operations over graphs and sets of…
There is developed a differential-algebraic approach to studying the representations of commuting differentiations in functional differential rings under nonlinear differential constraints. An example of the differential ideal with the only…
Modern knowledge base systems frequently need to combine a collection of databases in different formats: e.g., relational databases, XML databases, rule bases, ontologies, etc. In the deductive database system DDBASE, we can manage these…
We list defining relations for the four of the five exceptional simple Lie superalgebras some of which, as David Broadhurst conjectured and Kac demonstrated, may pertain to The Standard Model or Grand unified theories of elementary…
We study the degree of non-homogeneous lattice ideals over arbitrary fields, and give formulae to compute the degree in terms of the torsion of certain factor groups of Z^s and in terms of relative volumes of lattice polytopes. We also…
Algebraic specifications of data types provide a natural basis for testing data types implementations. In this framework, the conformance relation is based on the satisfaction of axioms. This makes it possible to formally state the…
A relation algebra is called measurable when its identity is the sum of measurable atoms, and an atom is called measurable if its square is the sum of functional elements. In this paper we show that atomic measurable relation algebras have…
The lattice formulation provides a way to regularize, define and compute the Path Integral in a Quantum Field Theory. In this paper we review the theoretical foundations and the most basic algorithms required to implement a typical lattice…
We present a complete finite axiomatization of the unrestricted implication problem for inclusion and conditional independence atoms in the context of dependence logic. For databases, our result implies a finite axiomatization of the…
The rational, real and complex numbers with their standard operations, including division, are partial algebras specified by the axiomatic concept of a field. Since the class of fields cannot be defined by equations, the theory of…
Conditional lower bounds based on $P\neq NP$, the Exponential-Time Hypothesis (ETH), or similar complexity assumptions can provide very useful information about what type of algorithms are likely to be possible. Ideally, such lower bounds…
This paper discusses a method for implementing a probabilistic inference system based on an extended relational data model. This model provides a unified approach for a variety of applications such as dynamic programming, solving sparse…
This paper is about Kripke structures that are inside a relational database and queried with a modal language. At first the modal language that is used is introduced, followed by a definition of the database and relational algebra. Based on…
We describe arbitrary multiplicative differential forms on Lie groupoids infinitesimally, i.e., in terms of Lie algebroid data. This description is based on the study of linear differential forms on Lie algebroids and encompasses many known…
Querying and exploring massive collections of data sources, such as data lakes, has been an essential research topic in the database community. Although many efforts have been paid in the field of data discovery and data integration in data…
This tutorial overviews the state of the art in learning models over relational databases and makes the case for a first-principles approach that exploits recent developments in database research. The input to learning classification and…
Any algebra herein is intended over a field of characteristic 0. Let $E$ denote the infinite dimensional Grassman algebra. Given a power associative finite dimensional {$\mathbb{Z}_2$-graded-central-simple} $A$ and a supertrace algebra $B$,…