TANE

TANE: An efficient algorithm for discovering functional and approximate dependencies. environments. The discovery of functional dependencies from relations is an important database analysis technique. We present TANE, an efficient algorithm for finding functional dependencies from large databases. TANE is based on partitioning the set of rows with respect to their attribute values, which makes testing the validity of functional dependencies fast even for a large number of tuples. The use of partitions also makes the discovery of approximate functional dependencies easy and efficient and the erroneous or exceptional rows can be identified easily. Experiments show that TANE is fast in practice. For benchmark databases the running times are improved by several orders of magnitude over previously published results. The algorithm is also applicable to much larger datasets than the previous methods


References in zbMATH (referenced in 34 articles , 1 standard article )

Showing results 1 to 20 of 34.
Sorted by year (citations)

1 2 next

  1. Chardin, Brice; Coquery, Emmanuel; Pailloux, Marie; Petit, Jean-Marc: RQL: a query language for rule discovery in databases (2017)
  2. Kolb, Samuel; Paramonov, Sergey; Guns, Tias; De Raedt, Luc: Learning constraints in spreadsheets and tabular data (2017)
  3. Combi, Carlo; Sala, Pietro: Mining approximate interval-based temporal dependencies (2016)
  4. Garnaud, Eve; Maabout, Sofian; Mosbah, Mohamed: Functional dependencies are helpful for partial materialization of data cubes (2015)
  5. Baixeries, Jaume; Kaytoue, Mehdi; Napoli, Amedeo: Characterizing functional dependencies in formal concept analysis with pattern structures (2014)
  6. Cambazard, Hadrien; O’Sullivan, Barry: Erratum to “Reformulating table constraints using functional dependencies---an application to explanation generation” (2010)
  7. Medina, Raoul; Nourine, Lhouari: Conditional functional dependencies: an FCA point of view (2010)
  8. de Marchi, Fabien; Lopes, Stéphane; Petit, Jean-Marc: Unary and n-ary inclusion dependency discovery in relational databases (2009) ioport
  9. Jaudoin, H.; Flouvat, F.; Petit, J.-M.; Toumani, F.: Towards a scalable query rewriting algorithm in presence of value constraints (2009)
  10. Marchi, Fabien De; Lopes, Stéphane; Petit, Jean-Marc: Unary and n-ary inclusion dependency discovery in relational databases (2009) ioport
  11. Medina, Raoul; Nourine, Lhouari: A unified hierarchy for functional dependencies, conditional functional dependencies and association rules (2009)
  12. Naidenova, K. A.: Reducing one class of machine learning algorithms to logical operations of plausible reasoning (2009)
  13. Wolf, Garrett; Kalavagattu, Aravind; Khatri, Hemal; Balakrishnan, Raju; Chokshi, Bhaumik; Fan, Jianchun; Chen, Yi; Kambhampati; Subbarao: Query processing over incomplete autonomous databases: query rewriting using learned data dependencies (2009) ioport
  14. Cambazard, Hadrien; O’Sullivan, Barry: Reformulating table constraints using functional dependencies-an application to explanation generation (2008)
  15. Sánchez, Daniel; Serrano, José-María; Blanco, Ignacio; Martín-Bautista, Maria J.; Miranda, María Amparo Vila: Using association rules to mine for strong approximate dependencies. (2008) ioport
  16. Sánchez, Daniel; Serrano, José María; Blanco, Ignacio; Martín-Bautista, Maria Jose; Vila, María-Amparo: Using association rules to mine for strong approximate dependencies (2008) ioport
  17. Trinh, Thu: Using transversals for discovering XML functional dependencies (2008)
  18. Yao, Hong; Hamilton, Howard J.: Mining functional dependencies from data. (2008) ioport
  19. Yao, Hong; Hamilton, Howard J.: Mining functional dependencies from data (2008) ioport
  20. Yu, Cong; Jagadish, H. V.: XML schema refinement through redundancy detection and normalization (2008) ioport

1 2 next