Lossless Horizontal Decomposition with Domain Constraints on Interpreted Attributes

  • Ingo Feinerer
  • Enrico Franconi
  • Paolo Guagliardo
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7968)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley (1995)Google Scholar
  2. 2.
    Bra, P.D.: Horizontal Decompositions in the Relational Database Model. Ph.D. thesis, University of Antwerp (1987)Google Scholar
  3. 3.
    Ceri, S., Negri, M., Pelagatti, G.: Horizontal data partitioning in database design. In: SIGMOD Conference, pp. 128–136. ACM Press (1982)Google Scholar
  4. 4.
    De Bra, P.: Horizontal decompositions based on functional-dependency-set-implications. In: Atzeni, P., Ausiello, G. (eds.) ICDT 1986. LNCS, vol. 243, pp. 157–170. Springer, Heidelberg (1986)Google Scholar
  5. 5.
    De Bra, P., Paredaens, J.: Conditional dependencies for horizontal decompositions. In: Díaz, J. (ed.) ICALP 1983. LNCS, vol. 154, pp. 67–82. Springer, Heidelberg (1983)CrossRefGoogle Scholar
  6. 6.
    Franconi, E., Guagliardo, P.: On the translatability of view updates. In: AMW 2012. CEUR-WS, vol. 866, pp. 154–167 (2012)Google Scholar
  7. 7.
    Furtado, A.L.: Horizontal decomposition to improve a non-BCNF scheme. SIGMOD Record 12(1), 26–32 (1981)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Jaffar, J., Maher, M.J., Stuckey, P.J., Yap, R.H.C.: Beyond finite domains. In: Borning, A. (ed.) PPCP 1994. LNCS, vol. 874, pp. 86–94. Springer, Heidelberg (1994)CrossRefGoogle Scholar
  9. 9.
    Lahiri, S.K., Musuvathi, M.: An efficient decision procedure for UTVPI constraints. In: Gramlich, B. (ed.) FroCos 2005. LNCS (LNAI), vol. 3717, pp. 168–183. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  10. 10.
    Maier, D., Ullman, J.D.: Fragments of relations. In: SIGMOD Conference, pp. 15–22. ACM Press (1983)Google Scholar
  11. 11.
    Özsu, M.T., Valduriez, P.: Principles of Distributed Database Systems, 3rd edn. Springer (2011)Google Scholar
  12. 12.
    Schutt, A., Stuckey, P.J.: Incremental satisfiability and implication for UTVPI constraints. INFORMS Journal on Computing 22(4), 514–527 (2010)MathSciNetMATHCrossRefGoogle Scholar
  13. 13.
    Seshia, S.A., Subramani, K., Bryant, R.E.: On solving boolean combinations of UTVPI constraints. JSAT 3(1-2), 67–90 (2007)MathSciNetMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Ingo Feinerer
    • 1
  • Enrico Franconi
    • 2
  • Paolo Guagliardo
    • 2
  1. 1.Vienna University of TechnologyAustria
  2. 2.Free University of Bozen-BolzanoItaly

Personalised recommendations