Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

Algorithmic Perspective of Strongly Possible Keys and Functional Dependencies

View through CrossRef
It is common to encounter missing values in database tables. For an incomplete table, a possible world can be obtained by replacing any missed value with a value from the attribute (infinite) domain. A possible key (possible functional dependency) is satisfied in an incomplete table ”T” if there exists a possible world of ”T” that satisfies the key (the functional dependency) constraint. If all possible worlds of ”T” satisfy the key (functional dependency), then we say that ”T” satisfies a certain key (functional dependency). The concept of strongly possible worlds was introduced recently that considers only the active domain (the set of values that are already appearing in each attribute in the table), in a way that a strongly possible worldis obtained by replacing any missing value with a value from the corresponding attributes active domain. So, a strongly possible key spKey (functional dependency spFD) is satisfied by a table ”T” if there exists a strongly possible world that satisfies the key (functional dependency). In this paper, we investigate the approximation measures of spKeys and spFDs when the strongly possible constraint is not satisfied by a given table. We introduce the g5 measures which is the ratio of the minimum number of tuples that need to be added so that the constraint is satisfied. The measure g3 represent the ratio of the minimum number of tuples that need to be removed so that the table satisfies the constraint. We introduce a new measureg5, which is the ratio of the minimum number of tuples to be added to the table so the result satisfies the constraint. Where adding new tuples with new values will extend the active domain. We prove that g3 is an upper bound of g5 for a constraint in a table. Furthermore, g3 and g5 are independent of each other, where there exist tables of some large number of tuples that satisfy g3 − g5 = p/q for any rational number 0 ≤ p/q < 1. We study the complexity of determining these approximate measures.
Slovenian Association Informatika
Title: Algorithmic Perspective of Strongly Possible Keys and Functional Dependencies
Description:
It is common to encounter missing values in database tables.
For an incomplete table, a possible world can be obtained by replacing any missed value with a value from the attribute (infinite) domain.
A possible key (possible functional dependency) is satisfied in an incomplete table ”T” if there exists a possible world of ”T” that satisfies the key (the functional dependency) constraint.
If all possible worlds of ”T” satisfy the key (functional dependency), then we say that ”T” satisfies a certain key (functional dependency).
The concept of strongly possible worlds was introduced recently that considers only the active domain (the set of values that are already appearing in each attribute in the table), in a way that a strongly possible worldis obtained by replacing any missing value with a value from the corresponding attributes active domain.
So, a strongly possible key spKey (functional dependency spFD) is satisfied by a table ”T” if there exists a strongly possible world that satisfies the key (functional dependency).
In this paper, we investigate the approximation measures of spKeys and spFDs when the strongly possible constraint is not satisfied by a given table.
We introduce the g5 measures which is the ratio of the minimum number of tuples that need to be added so that the constraint is satisfied.
The measure g3 represent the ratio of the minimum number of tuples that need to be removed so that the table satisfies the constraint.
We introduce a new measureg5, which is the ratio of the minimum number of tuples to be added to the table so the result satisfies the constraint.
Where adding new tuples with new values will extend the active domain.
We prove that g3 is an upper bound of g5 for a constraint in a table.
Furthermore, g3 and g5 are independent of each other, where there exist tables of some large number of tuples that satisfy g3 − g5 = p/q for any rational number 0 ≤ p/q < 1.
We study the complexity of determining these approximate measures.

Related Results

Programming model abstractions for optimizing I/O intensive applications
Programming model abstractions for optimizing I/O intensive applications
This thesis contributes from the perspective of task-based programming models to the efforts of optimizing I/O intensive applications. Throughout this thesis, we propose programmin...
Algorithmic Trading and AI: A Review of Strategies and Market Impact
Algorithmic Trading and AI: A Review of Strategies and Market Impact
This review explores the dynamic intersection of algorithmic trading and artificial intelligence (AI) within financial markets. It delves into the evolution, strategies, and broade...
The Role of Algorithmic Anthropomorphism, Transparency, and Fairness in Shaping Consumer Purchase Intentions in E-Commerce
The Role of Algorithmic Anthropomorphism, Transparency, and Fairness in Shaping Consumer Purchase Intentions in E-Commerce
Artificial intelligence (AI) is often employed in various sectors of e-commerce. Conse-quently, it becomes necessary to identify the impact of various parameters of the algorithm o...
Algorithmic Governance and Public Accountability: Audits, Transparency, and Harm
Algorithmic Governance and Public Accountability: Audits, Transparency, and Harm
Algorithmic systems are increasingly embedded in public administration, shaping decisions in areas such as social services, law enforcement, urban governance, and financial regulat...
ALGORITHMIC MANAGEMENT: AN EMPIRICAL STUDY
ALGORITHMIC MANAGEMENT: AN EMPIRICAL STUDY
The paper addresses algorithmic management within mechanistic and organic organizational paradigms, and discusses problems associated with algorithmic management from the socio-tec...
Gambaran Possible selves Pada Remaja SMP
Gambaran Possible selves Pada Remaja SMP
Possible selves are the part of the self that describe a person’s future self. The developed cognitive abilities and hypothetical thinking in adolescence allow them to conceptualiz...
Approximate Integrity Constraints in Incomplete Databases With Limited Domains 
Approximate Integrity Constraints in Incomplete Databases With Limited Domains 
Abstract In case of incomplete database tables, a possible world is obtained by replacing any missing value by a value from the corresponding attribute's domain that can be...
Municipal Surveillance Regulation and Algorithmic Accountability
Municipal Surveillance Regulation and Algorithmic Accountability
A wave of recent scholarship has warned about the potential for discriminatory harms of algorithmic systems, spurring an interest in algorithmic accountability and regulation. Mean...

Back to Top