Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/oxford-university-press/tane-an-efficient-algorithm-for-discovering-functional-and-approximate-mrzYJWTGMs
References (27)
-
Jyrki Kivinen, H. Mannila (1994)
The power of sampling in knowledge discovery -
Ykä Huhtala, Juha Kärkkäinen, P. Porkka, Hannu Toivonen (1998)
Efficient discovery of functional and approximate dependencies using partitionsProceedings 14th International Conference on Data Engineering
-
H. Mannila, Kari-Jouko Räihä (1992)
On the Complexity of Inferring Functional DependenciesDiscret. Appl. Math., 40
-
(1997)
Discovery of frequency episodes in event sequences. Data Mining and Knowledge Discovery -
Jean-Marc Petit, F. Toumani, Jean-François Boulicaut, J. Kouloumdjian (1996)
Towards the reverse engineering of renormalized relational databasesProceedings of the Twelfth International Conference on Data Engineering
-
H. Mannila, Kari-Jouko Räihä (1992)
Design of Relational Databases -
(1996)
FDEP home page -
Monowar Bhuyan, D. Bhattacharyya, Hossein Homaei, Hamid Shahriari, Jiankun Hu, Yong Yu, Yi Mu, Guilin Wang, Ying Sun, Hassan Asghar, Josef Pieprzyk, Huaxiong Wang, Jun Zhang, Yang Xiang, Wanlei Zhou, Lei Ye, Lan Zhou, Vijay Varadharajan, M. Hitchens, Lein Harn, Chia-Yin Lee, Changlu Lin, Chin-Chen Chang, Yini Wang, Sheng Wen, Silvio Cesare, Erika Rosas, Olivier Marin, Xavier Bonnaire (1958)
The Computer JournalNature, 181
-
R. Agrawal, H. Mannila, R. Srikant, Hannu Toivonen, A. Verkamo (1996)
Fast Discovery of Association Rules -
B. Pfahringer, Stefan Kramer (1995)
Compression-Based Evaluation of Partial Determinations -
S. Cosmadakis, P. Kanellakis, N. Spyratos (1985)
Partition semantics for relationsJ. Comput. Syst. Sci., 33
-
P. Bra, J. Paredaens (1982)
Horizontal Decompositions for Handling Exceptions to Functional Dependencies -
Stefan Kramer, B. Pfahringer (1996)
Efficient Search for Strong Partial Determinations -
Iztok Savnik, Peter Flach (1993)
Bottom-up induction of functional dependencies from relations -
Mehmet Dalkilic, E. Robertson, D. Gucht (1997)
CE: the Classifier-Estimator Framework for Data Mining -
Siegfried Bell, Peter Brockhausen (1999)
Discovery of data dependencies in relational databases -
D. Bitton, Jeffrey Millman, Solveig Torgersen (1989)
A feasibility and performance study of dependency inference (database design)[1989] Proceedings. Fifth International Conference on Data Engineering
-
U. Manber, E. Myers (1993)
Suffix arrays: a new method for on-line string searchesSIAM J. Comput., 22
-
H. Mannila, Kari-Jouko Räihä (1994)
Algorithms for Inferring Functional Dependencies from RelationsData Knowl. Eng., 12
-
H. Mannila, Kari-Jouko Räihä (1986)
Design by Example: An Application of Armstrong RelationsJ. Comput. Syst. Sci., 33
-
W. Ziarko (1991)
The Discovery, Analysis, and Representation of Data Dependencies in Databases -
J. Schlimmer (1993)
Using learned dependencies to automatically construct sufficient and sensible editing views -
G. Weddell (1992)
Reasoning about functional dependencies generalized for semantic data modelsACM Trans. Database Syst., 17
-
H. Mannila, Kari-Jouko Räihä (1987)
Dependency Inference -
J. Schlimmer (1993)
Efficiently Inducing Determinations: A Complete and Systematic Search Algorithm that Uses Optimal Pruning -
Jyrki Kivinen, H. Mannila (1992)
Approximate Dependency Inference from Relations -
Catherine Blake (1998)
UCI Repository of machine learning databases
- Publisher
- Oxford University Press
- Copyright
- Copyright © 2015 British Computer Society
- ISSN
- 0010-4620
- eISSN
- 1460-2067
- DOI
- 10.1093/comjnl/42.2.100
- Publisher site
- See Article on Publisher Site
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. Received 17 September, 1998. Revised 31 March, 1999. Copyright 1999 « Previous | Next Article » Table of Contents This Article The Computer Journal (1999) 42 (2): 100-111. doi: 10.1093/comjnl/42.2.100 » Abstract Free Full Text (PDF) Free Classifications Article Services Article metrics Alert me when cited Alert me if corrected Find similar articles Similar articles in Web of Science Add to my archive Download citation Request Permissions Citing Articles Load citing article information Citing articles via CrossRef Citing articles via Scopus Citing articles via Web of Science Citing articles via Google Scholar Google Scholar Articles by Huhtala, Y. Articles by Toivonen, H. Search for related content Related Content Load related web page information Share Email this article CiteULike Delicious Facebook Google+ Mendeley Twitter What's this? Search this journal: Advanced » Current Issue November 2015 58 (11) Alert me to new issues The Journal About this journal Rights & Permissions Dispatch date of the next issue The Wilkes Award We are mobile – find out more Reviewer Guidelines Guidelines for Editors Review and Appeals Process Journals Career Network Published on behalf of BCS, The Chartered Institute for IT Impact factor: 0.787 5-Yr impact factor: 0.962 View full editorial board For Authors Instructions to authors Online submission instructions Submit a manuscript Self archiving policy Alerting Services Email table of contents Email Advance Access CiteTrack XML RSS feed Corporate Services Advertising sales Reprints Supplements var taxonomies = ("SCI01540"); Most Most Read Fast Implementation of Relational Operations Via Inverse Projections What is the Use of Operating Systems? Defining System Requirements to meet Business Needs: a Case Study Example On the Meaning of Safety and Security A Simplex Method for Function Minimization » View all Most Read articles Most Cited A Simplex Method for Function Minimization How Many Clusters? Which Clustering Method? Answers Via Model-Based Cluster Analysis Hierarchical grouping methods and stopping rules: an evaluation Function minimization by conjugate gradients A new approach to variable metric algorithms » View all Most Cited articles Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department. Online ISSN 1460-2067 - Print ISSN 0010-4620 Copyright © 2015 British Computer Society Oxford Journals Oxford University Press Site Map Privacy Policy Cookie Policy Legal Notices Frequently Asked Questions Other Oxford University Press sites: Oxford University Press Oxford Journals China Oxford Journals Japan Academic & Professional books Children's & Schools Books Dictionaries & Reference Dictionary of National Biography Digital Reference English Language Teaching Higher Education Textbooks International Education Unit Law Medicine Music Online Products & Publishing Oxford Bibliographies Online Oxford Dictionaries Online Oxford English Dictionary Oxford Language Dictionaries Online Oxford Scholarship Online Reference Rights and Permissions Resources for Retailers & Wholesalers Resources for the Healthcare Industry Very Short Introductions World's Classics function fnc_onDomLoaded() { var query_context = getQueryContext(); PF_initOIUnderbar(query_context,":QS:default","","JRN"); PF_insertOIUnderbar(0); }; if (window.addEventListener) { window.addEventListener('load', fnc_onDomLoaded, false); } else if (window.attachEvent) { window.attachEvent('onload', fnc_onDomLoaded); } var gaJsHost = (("https:" == document.location.protocol) ? "https://ssl." : "http://www."); document.write(unescape("%3Cscript src='" + gaJsHost + "google-analytics.com/ga.js' type='text/javascript'%3E%3C/script%3E")); try { var pageTracker = _gat._getTracker("UA-189672-16"); pageTracker._setDomainName(".oxfordjournals.org"); pageTracker._trackPageview(); } catch(err) {}
Journal
The Computer Journal – Oxford University Press
Published: Jan 1, 1999