arXiv 0807.37952008-07-24cs.DB

Relational Lattice Axioms

Marshall Spight, Vadim Tropashko

备注：: 10 pages, 4 figures

英文摘要：

Relational lattice is a formal mathematical model for Relational algebra. It reduces the set of six classic relational algebra operators to two: natural join and inner union. We continue to investigate Relational lattice properties with emphasis onto axiomatic definition. New results include additional axioms, equational definition for set difference (more generally anti-join), and case study demonstrating application of the relational lattice theory for query transformations.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Relational Algebra as non-Distributive Lattice

We reduce the set of classic relational algebra operators to two binary operations: natural join and generalized union. We further demonstrate that this set of operators is relationally complete and honors lattice axioms.

2005-02-04cs.DB

Relational Lattice Foundation for Algebraic Logic

Relational Lattice is a succinct mathematical model for Relational Algebra. It reduces the set of six classic relational algebra operators to two: natural join and inner union. In this paper we push relational lattice theory in two directions. First, we uncover a pair of complementary lattice operators, and organize the model into a bilattice of four operations and four distinguished constants. We take a notice a peculiar way bilattice symmetry is broken. Then, we give axiomatic introduction of unary negation operation and prove several laws, including double negation and De Morgan. Next we re…

2009-03-23cs.DBcs.LO

First Steps in Relational Lattice

Relational lattice reduces the set of six classic relational algebra operators to two binary lattice operations: natural join and inner union. We give an introduction to this theory with emphasis on formal algebraic laws. New results include Spight distributivity criteria and its applications to query transformations.

2006-03-15cs.DB

Monotonic and Nonmonotonic Preference Revision

We study here preference revision, considering both the monotonic case where the original preferences are preserved and the nonmonotonic case where the new preferences may override the original ones. We use a relational framework in which preferences are represented using binary relations (not necessarily finite). We identify several classes of revisions that preserve order axioms, for example the axioms of strict partial or weak orders. We consider applications of our results to preference querying in relational databases.

2005-03-31cs.AIcs.DB

The quasiequational theory of relational lattices, in the pure lattice signature (embeddability into relational lattices is undecidable)

The natural join and the inner union operations combine relations of a database. Tropashko and Spight realized that these two operations are themeet and join operations in a class of lattices, known by now as the relational lattices. They proposed then lattice theory as an algebraic approach to thetheory of databases alternative to the relational algebra. Litak et al. proposed an axiomatization of relational lattices over the signature that extends thepure lattice signature with a constant and argued that the quasiequational theory of relational lattices over this extended signature is undecid…

2017-03-09cs.DBcs.LOmath.CT

Association Rules in the Relational Calculus

School of Computing Science（计算科学学院）；Simon Fraser University（西蒙弗雷泽大学）

One of the most utilized data mining tasks is the search for association rules. Association rules represent significant relationships between items in transactions. We extend the concept of association rule to represent a much broader class of associations, which we refer to as \emph{entity-relationship rules.} Semantically, entity-relationship rules express associations between properties of related objects. Syntactically, these rules are based on a broad subclass of safe domain relational calculus queries. We propose a new definition of support and confidence for entity-relationship rules an…

2007-10-10cs.DBcs.LGcs.LO

更多相关论文收起更多论文

Relational lattices via duality

The natural join and the inner union combine in different ways tables of a relational database. Tropashko [18] observed that these two operations are the meet and join in a class of lattices-called the relational lattices- and proposed lattice theory as an alternative algebraic approach to databases. Aiming at query optimization, Litak et al. [12] initiated the study of the equational theory of these lattices. We carry on with this project, making use of the duality theory developed in [16]. The contributions of this paper are as follows. Let A be a set of column's names and D be a set of cell…

2016-02-26cs.DBcs.LOmath.LO

On-demand Relational Concept Analysis

Le2i, Université Bourgogne Franche-Comté（勃艮第弗朗什-孔泰大学Le2i实验室）；LIRMM, CNRS and Université de Montpellier（蒙彼利埃大学与法国国家科学研究中心联合LIRMM实验室）；LIMOS, Université Clermont Auvergne（克莱蒙奥弗涅大学LIMOS实验室）

Formal Concept Analysis and its associated conceptual structures have been used to support exploratory search through conceptual navigation. Relational Concept Analysis (RCA) is an extension of Formal Concept Analysis to process relational datasets. RCA and its multiple interconnected structures represent good candidates to support exploratory search in relational datasets, as they are enabling navigation within a structure as well as between the connected structures. However, building the entire structures does not present an efficient solution to explore a small localised area of the dataset…

2018-03-21cs.AIcs.DBcs.SE