Exploiting equality generating dependencies in checking chase termination

Greco, Sergio; Molinaro, Cristian; Trubitsyna, Irina

doi:10.14778/2876473.2876475

Cited by 11 publications

(5 citation statements)

References 37 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…More general (and complex) criteria guaranteeing finiteness of a universal set of founded updates could be defined and we reserve such a topic for further future investigation. Criteria recently studied guaranteeing chase termination for TGDs (Greco et al (2015); Calautti et al (2016)) may be the inspiration for more general conditions for finiteness of universal set of founded updates.…”

Section: Definition 8 (Weakly Monotonic Eaics)mentioning

confidence: 99%

Existential active integrity constraints

Caroprese¹,

Greco

Molinaro

et al. 2021

Expert Systems with Applications

Self Cite

View full text Add to dashboard Cite

Active integrity constraints (AICs) are a useful formalism to express integrity constraints and policies to restore consistency in databases violating them. However, AICs do not allow users to express different kinds of constraints commonly arising in practice, such as foreign keys.In this paper, we propose existential active integrity constraints (EAICs), a powerful extension of AICs that allows us to express a wide range of constraints used in databases and ontological systems. We investigate different properties of EAICs. Specifically, we show that there exists a "representative" set of founded updates, called universal, which suffices for query answering. As such a set might contain an infinite number of founded updates, each of infinite size, we study syntactic restrictions ensuring finiteness, as well as the existence of a single universal founded update.

show abstract

Section: Definition 8 (Weakly Monotonic Eaics)mentioning

confidence: 99%

Existential active integrity constraints

Caroprese¹,

Greco

Molinaro

et al. 2021

Expert Systems with Applications

Self Cite

View full text Add to dashboard Cite

show abstract

“…The class of weakly-acyclic sets of TGDs is a well-known formalism, introduced in the context of data exchange, that guarantees the termination of the semi-oblivious chase [17]. 9 Formally, a set Σ is weakly-acyclic if there is no cycle in dg( ) that contains a special edge. It would be extremely useful if, whenever we focus on linear TGDs, weak-acyclicity is also a necessary condition for the termination of the semioblivious chase.…”

Section: Critically-weakly-acyclic Linear Tgdsmentioning

confidence: 99%

“…Let us clarify that in this section, unlike Section 4, we consider arbitrary TGDs not in normal form. In the previous section, we assumed TGDs in normal form only for technical reasons 9. Let us clarify that[17] does not consider the semi-oblivious, but the restricted (a.k.a.…”

mentioning

confidence: 99%

Semi-Oblivious Chase Termination: The Sticky Case

Pieris

2020

Theory Comput Syst

Self Cite

View full text Add to dashboard Cite

The chase procedure is a fundamental algorithmic tool in database theory with a variety of applications. A key problem concerning the chase procedure is all-instances termination: for a given set of tuple-generating dependencies (TGDs), is it the case that the chase terminates for every input database? In view of the fact that this problem is undecidable, it is natural to ask whether known well-behaved classes of TGDs, introduced in different contexts such as ontological reasoning, ensure decidability. We consider a prominent paradigm that led to a robust TGD-based formalism, called stickiness. We show that for sticky sets of TGDs, all-instances chase termination is decidable if we focus on the (semi-)oblivious chase, and we pinpoint its exact complexity: PSPACE-complete in general, and NLOGSPACE-complete for predicates of bounded arity. These complexity results are obtained via a graph-based syntactic characterization of chase termination that is of independent interest.

show abstract

“…To cope with this issue, several "termination criteria" have been proposed, that is, (decidable) sufficient conditions ensuring chase termination. Some recent works can be found in [49,50].…”

Section: Dealing With Incomplete and Inconsistent Datamentioning

confidence: 99%

Evaluating User Behaviour in a Cooperative Environment

Bazzi¹,

Cassavia

Chiggiato³

et al. 2018

Information

Self Cite

View full text Add to dashboard Cite

Big Data, as a new paradigm, has forced both researchers and industries to rethink data management techniques which has become inadequate in many contexts. Indeed, we deal everyday with huge amounts of collected data about user suggestions and searches. These data require new advanced analysis strategies to be devised in order to profitably leverage this information. Moreover, due to the heterogeneous and fast changing nature of these data, we need to leverage new data storage and management tools to effectively store them. In this paper, we analyze the effect of user searches and suggestions and try to understand how much they influence a user’s social environment. This task is crucial to perform efficient identification of the users that are able to spread their influence across the network. Gathering information about user preferences is a key activity in several scenarios like tourism promotion, personalized marketing, and entertainment suggestions. We show the application of our approach for a huge research project named D-ALL that stands for Data Alliance. In fact, we tried to assess the reaction of users in a competitive environment when they were invited to judge each other. Our results show that the users tend to conform to each other when no tangible rewards are provided while they try to reduce other users’ ratings when it affects getting a tangible prize.

show abstract

Exploiting equality generating dependencies in checking chase termination

Cited by 11 publications

References 37 publications

Existential active integrity constraints

Existential active integrity constraints

Semi-Oblivious Chase Termination: The Sticky Case

Evaluating User Behaviour in a Cooperative Environment

Contact Info

Product

Resources

About