A New Finitely Controllable Class of Tuple Generating Dependencies: The Triangularly-Guarded Class

05/21/2018
by   Vernon Asuncion, et al.
0

In this paper we introduce a new class of tuple-generating dependencies (TGDs) called triangularly-guarded (TG) TGDs. We show that conjunctive query answering under this new class of TGDs is decidable since this new class of TGDs also satisfies the finite controllability (FC) property. We further show that this new class strictly contains some other decidable classes such as weak-acyclic, guarded, sticky and shy. In this sense, the class TG provides a unified representation of all these aforementioned classes of TGDs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/17/2018

A New Decidable Class of Tuple Generating Dependencies: The Triangularly-Guarded Class

In this paper we introduce a new class of tuple-generating dependencies ...
research
06/01/2018

A new class of irreducible pentanomials for polynomial based multipliers in binary fields

We introduce a new class of irreducible pentanomials over F_2 of the for...
research
09/26/2019

Compound vectors of subordinators and their associated positive Lévy copulas

Lévy copulas are an important tool which can be used to build dependent ...
research
04/21/2020

GGDs: Graph Generating Dependencies

We propose Graph Generating Dependencies (GGDs), a new class of dependen...
research
06/27/2021

Edge-Unfolding Prismatoids: Tall or Rectangular Base

We show how to edge-unfold a new class of convex polyhedra, specifically...
research
08/23/2018

Reflected maxmin copulas and modelling quadrant subindependence

Copula models have become popular in different applications, including m...
research
09/04/2020

AnyDB: An Architecture-less DBMS for Any Workload

In this paper, we propose a radical new approach for scale-out distribut...

Please sign up or login with your details

Forgot password? Click here to reset