The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Tane: An Efficient Algorithm for Discovering Functional and Approximate Dependencies
Abstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Fast discovery of association rules
Agrawal, R., Mannila, H., Srikant, R., Toivonen, H. T. T., & Verkamo, A. I. (1996) · Knowledge Discovery and Data Mining · Cited by 2,376
UCI Repository of Machine Learning Databases
Merz, C. J. (1996) · Medical Entomology and Zoology · Cited by 2,363
Suffix Arrays: A New Method for On-Line String Searches
Manber, U., & Myers, G. (1993) · SIAM Journal on Computing · doi:10.1137/0222058 · Cited by 1,915
Discovery of Frequent Episodes in Event Sequences
Mannila, H., Toivonen, H., & Inkeri Verkamo, A. (1997) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009748302351 · Cited by 1,463
Levelwise Search and Borders of Theories in Knowledge Discovery
Mannila, H., & Toivonen, H. T. T. (1997) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009796218281 · Cited by 889
The Discovery, Analysis, and Representation of Data Dependencies in Databases.
Ziarko, W. (1991) · Cited by 158
The power of sampling in knowledge discovery
Kivinen, J., & Mannila, H. (1994) · doi:10.1145/182591.182601 · Cited by 106
Approximate dependency inference from relations
Kivinen, J., & Mannila, H. (1992) · Lecture notes in computer science · doi:10.1007/3-540-56039-4_34 · Cited by 89
Mannila, H., & Räihä, K. (1987) · Very Large Data Bases · Cited by 80
Bottom-up induction of functional dependencies from relations
Savnik, I., & Flach, P. A. (1993) · Cited by 70
Cited by
Exploratory Data Mining and Data Cleaning
Dasu, T., & Johnson, T. (2003) · Wiley Series in Probability and Statistics · doi:10.1002/0471448354 · Cited by 618
Profiling relational data: a survey
Abedjan, Z., Golab, L., & Naumann, F. (2015) · The VLDB Journal · doi:10.1007/s00778-015-0389-y · Cited by 283
Discovering denial constraints
Chu, X., Ilyas, I. F., & Papotti, P. (2013) · Proceedings of the VLDB Endowment · doi:10.14778/2536258.2536262 · Cited by 262
Discovering Conditional Functional Dependencies
Fan, W., Geerts, F., Li, J., & Xiong, M. (2011) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2010.154 · Cited by 253
IoT data cleaning techniques: A survey
Ding, X., Wang, H., Li, G., Li, H., Li, Y., & Liu, Y. (2022) · Intelligent and Converged Networks · doi:10.23919/icn.2022.0026 · Cited by 35
Metadata
- Authors
- Huhtala, Y.
- Venue
- The Computer Journal
- Publisher
- Oxford University Press (OUP)
- Published
- 1999-02-01
- Volume
- 42
- Issue
- 2
- Pages
- 100-111
- ISSN
- 0010-4620 (ISSN-L)
- 1460-2067
- OpenAlex
- W2166549982
- Cited by
- 598
- References
- 11
- FWCI
- 13.31
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Tane: An Efficient Algorithm for Discovering Functional and Approximate Dependencies. https://app.cochat.ai/papers/10.1093/comjnl/42.2.100
- The paper
- Huhtala, Y. (1999). Tane: An Efficient Algorithm for Discovering Functional and Approximate Dependencies. The Computer Journal. https://doi.org/10.1093/comjnl/42.2.100
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.