The implication problem for measure-based constraints

Authors:
Bassem Sayrafi;Dirk Van Gucht;Marc Gyssens
Affiliations:
Computer Science Department, Indiana University, Lindley Hall 215, 150 S. Woodlawn Avenue, Bloomington, IN 47405-7104, USA;Computer Science Department, Indiana University, Lindley Hall 215, 150 S. Woodlawn Avenue, Bloomington, IN 47405-7104, USA;Department WNI, Hasselt University and Transnational University of Limburg, Agoralaan, Building D, B-3590 Diepenbeek, Belgium
Venue:
Information Systems
Year:
2008

Citing 23
Cited 0

Another view of functional and multivalued dependencies in the relational database model

International Journal of Parallel Programming
Statistical treatment of the information content of a database

Information Systems
An Infornation-Theoretic Analysis of Relational Databases Part I: Data Dependencies and Information Metric

IEEE Transactions on Software Engineering
On the undecidability of implications between embedded multivalued database dependencies

Information and Computation
Normalization and hierarchical dependencies in the relational data model

ACM Transactions on Database Systems (TODS)
Multivalued dependencies and a new normal form for relational databases

ACM Transactions on Database Systems (TODS)
Equivalent Representations of Set Functions

Mathematics of Operations Research
A relational model of data for large shared data banks

Communications of the ACM
A condensed representation to find frequent patterns

PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A complete axiomatization for functional and multivalued dependencies in database relations

SIGMOD '77 Proceedings of the 1977 ACM SIGMOD international conference on Management of data
Fuzzy Measures and Integrals: Theory and Applications

Fuzzy Measures and Integrals: Theory and Applications
Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Totals

Data Mining and Knowledge Discovery
Axiomatization of frequent itemsets

Theoretical Computer Science
Mining All Non-derivable Frequent Itemsets

PKDD '02 Proceedings of the 6th European Conference on Principles of Data Mining and Knowledge Discovery
Fast Algorithms for Mining Association Rules in Large Databases

VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Concise Representation of Frequent Patterns Based on Generalized Disjunction-Free Generators

PAKDD '02 Proceedings of the 6th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining
Analysis and design of relational schemata for database systems.

Analysis and design of relational schemata for database systems.
Reasoning about Uncertainty

Reasoning about Uncertainty
Privacy-Preserving Distributed Mining of Association Rules on Horizontally Partitioned Data

IEEE Transactions on Knowledge and Data Engineering
Differential constraints

Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Theory of Relational Databases

Theory of Relational Databases
A measure-theoretic framework for constraints and bounds on measurements of data

A measure-theoretic framework for constraints and bounds on measurements of data
Introduction to Automata Theory, Languages, and Computation (3rd Edition)

Introduction to Automata Theory, Languages, and Computation (3rd Edition)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the implication problem of measure-based constraints. These constraints are formulated in a framework for measures generalizing that for mathematical measures. Measures arise naturally in a wide variety of domains. We show that measure constraints, for particular measures, correspond to constraints that occur in relational databases, data mining applications, cooperative game theory, and in the Dempster-Shafer and possibility theories of reasoning about uncertainty. We prove that the implication problem for measure constraints is in general decidable. We introduce inference systems for particular classes of measure constraints and show that some of these are complete, yielding tractability for the corresponding implication problem.