Skip to main content
SpringerLink
Log in
Book cover

International Conference on Database and Expert Systems Applications

DEXA 2014: Database and Expert Systems Applications pp 35–49Cite as

Discovering non-constant Conditional Functional Dependencies with Built-in Predicates

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 8644))

Abstract

In the context of the data quality research area, Conditional Functional Dependencies with built-in predicates (CFDps) have been recently defined as extensions of Conditional Functional Dependencies with the addition, in the patterns of their data values, of the comparison operators. CFDps can be used to impose constraints on data; they can also represent relationships among data, and therefore they can be mined from datasets. In the present work, after having introduced the distinction between constant and non-constant CFDps, we describe an algorithm to discover non-constant CFDps from datasets.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aqel, M., Shilbayeh, N., Hakawati, M.: CFD-Mine: An efficient algorithm for discovering functional and conditional functional dependencies. Trends in Applied Sciences Research 7(4), 285–302 (2012)

    Article  Google Scholar 

  2. Bache, K., Lichman, M.: UCI Machine Learning Repository (2013), http://archive.ics.uci.edu/ml

  3. Chen, W., Fan, W., Ma, S.: Analyses and validation of conditional dependencies with built-in predicates. In: Bhowmick, S.S., Küng, J., Wagner, R. (eds.) DEXA 2009. LNCS, vol. 5690, pp. 576–591. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  4. Chiang, F., Miller, R.: Discovering data quality rules. Proceedings of the VLDB Endowment 1(1), 1166–1177 (2008)

    Article  Google Scholar 

  5. Cong, G., Fan, W., Geerts, F., Jia, X., Ma, S.: Improving data quality: Consistency and accuracy. In: Koch, C., et al. (eds.) International Conference on Very Large Data Bases (VLDB 2007), pp. 315–326. ACM (2007)

    Google Scholar 

  6. Diallo, T., Novelli, N., Petit, J.M.: Discovering (frequent) constant conditional functional dependencies. Int. Journal of Data Mining, Modelling and Management 4(5), 205–223 (2012)

    Google Scholar 

  7. Fan, W., Geerts, F., Jia, X.: Semandaq: A data quality system based on conditional functional dependencies. Proceedings of the VLDB Endowment 1(2), 1460–1463 (2008)

    Article  Google Scholar 

  8. Fan, W., Geerts, F., Jia, X., Kementsietsidis, A.: Conditional functional dependencies for capturing data inconsistencies. ACM Transactions on Database Systems (TODS) 33(2), 94–115 (2008)

    Article  Google Scholar 

  9. Fan, W., Geerts, F., Li, J., Xiong, M.: Discovering conditional functional dependencies. IEEE Transactions on Knowledge and Data Engineering (TKDE) 23(5), 683–697 (2011)

    Article  Google Scholar 

  10. Golab, L., Karloff, H., Korn, F., Srivastava, D.: Data Auditor: Exploring data quality and semantics using pattern tableaux. Proceedings of the VLDB Endowment 3(2), 1641–1644 (2010)

    Article  Google Scholar 

  11. Huhtala, Y., Karkkainen, J., Porkka, P., Toivonen, H.: TANE: An efficient algorithm for discovering functional and approximate dependencies. Computer Journal 42(2), 100–111 (1999)

    Article  MATH  Google Scholar 

  12. Kivinen, J., Mannila, H.: Approximate inference of functional dependencies from relations. Theoretical Computer Science 149(1), 129–149 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  13. Li, J., Liu, J., Toivonen, H., Yong, J.: Effective pruning for the discovery of conditional functional dependencies. The Computer Journal 56(3), 378–392 (2013)

    Article  MATH  Google Scholar 

  14. Lopes, S., Petit, J.-M., Lakhal, L.: Efficient discovery of functional dependencies and Armstrong relations. In: Zaniolo, C., Lockemann, P.C., Scholl, M.H., Grust, T. (eds.) EDBT 2000. LNCS, vol. 1777, pp. 350–364. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  15. Mannila, H., Raiha, K.J.: On the complexity of inferring functional dependencies. Discrete Applied Mathematics 40, 237–243 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  16. Pivert, O., Prade, H.: Handling dirty databases: From user warning to data cleaning — Towards an interactive approach. In: Deshpande, A., Hunter, A. (eds.) SUM 2010. LNCS, vol. 6379, pp. 292–305. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  17. Wyss, C., Giannella, C., Robertson, E.: FastFDs: A heuristic-driven, depth-first algorithm for mining functional dependencies from relation instances - extended abstract. In: Kambayashi, Y., Winiwarter, W., Arikawa, M. (eds.) DaWaK 2001. LNCS, vol. 2114, pp. 101–110. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  18. Yao, H., Hamilton, H.: Mining functional dependencies from data. Journal Data Mining and Knowledge Discovery 16(2), 197–219 (2008)

    Article  MathSciNet  Google Scholar 

  19. Zanzi, A., Trombetta, A.: Data quality evaluation of scientific datasets: A case study in a policy support context. In: International Conference on Data Management Technologies and Applications (DATA 2013), pp. 167–174. SciTePress (2013)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Scienze Teoriche e Applicate, Università degli Studi dell’Insubria, via Mazzini 5, 21100, Varese, Italy

    Antonella Zanzi & Alberto Trombetta

Authors
  1. Antonella Zanzi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alberto Trombetta
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Instituto Tecnológico de Informática, 46022, Valencia, Spain

    Hendrik Decker

  2. Faculty of Electrical Engineering, Department of Cybernetics, Czech Technical University in Prague, 166 27, Prague 6, Czech Republic

    Lenka Lhotská

  3. Department of Computer Science, The University of Auckland, 1010, Auckland, New Zealand

    Sebastian Link

  4. Knowledge Management, LMU University of Munich, Leopoldstraße 13, 80802, Munich, Germany

    Marcus Spies

  5. University of Linz, FAW, Altenbergerstrasse 69,, 4040, Linz, Austria

    Roland R. Wagner

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Zanzi, A., Trombetta, A. (2014). Discovering non-constant Conditional Functional Dependencies with Built-in Predicates. In: Decker, H., Lhotská, L., Link, S., Spies, M., Wagner, R.R. (eds) Database and Expert Systems Applications. DEXA 2014. Lecture Notes in Computer Science, vol 8644. Springer, Cham. https://doi.org/10.1007/978-3-319-10073-9_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-10073-9_4

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-10072-2

  • Online ISBN: 978-3-319-10073-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation