Lossless horizontal decomposition with domain constraints on interpreted attributes

3Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Horizontal decomposition is the process of splitting a relation into sub-relations, called fragments, each containing a subset of the rows of the original relation. In this paper, we consider horizontal decomposition in a setting where some of the attributes in the database schema are interpreted over a specific domain, on which a set of special predicates and functions is defined. We study the losslessness of horizontal decomposition, that is, whether the original relation can be reconstructed from the fragments by union, in the presence of integrity constraints on the database schema. We introduce the new class of conditional domain constraints (CDCs), restricting the values the interpreted attributes may take whenever a certain condition holds on the non-interpreted ones, and investigate lossless horizontal decomposition under CDCs in isolation, as well as in combination with functional and unary inclusion dependencies. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

Feinerer, I., Franconi, E., & Guagliardo, P. (2013). Lossless horizontal decomposition with domain constraints on interpreted attributes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7968 LNCS, pp. 77–91). https://doi.org/10.1007/978-3-642-39467-6_10

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free