Title: Computing cover quotient cube considering functional dependency in base tables
Abstract: This paper proposes a new algorithm DDFS to compute cover quotient cube.Functional dependency between base attributes are considered to improve the efficiency of computing.When the base table is partitioned with a particular attribute order,the attribute functionally depended is considered with a priority.For the attributes pair where there is a functional dependency,the cost of finding the congeneric functional dependency is retrenched.Experimental result on the dataset weather shows that the computing time associated with DDFS is only 76% of that with DFS.There is a conclusion that DDFS can shorten the time of computing cover quotient cube,compared with DFS.
Publication Year: 2009
Publication Date: 2009-01-01
Language: en
Type: article
Access and Citation
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot