Question
Q6. Draw a hash tree for the following set of 3-itemsets (as candidate 3-itemsets): ACD, ACE, EIK, EIM, MNO, NUY, CDK, CKO, EIO. Use h(A)=0,
Q6. Draw a hash tree for the following set of 3-itemsets (as candidate 3-itemsets): ACD, ACE, EIK, EIM, MNO, NUY, CDK, CKO, EIO. Use h(A)=0, h(C) = 1, h(D) = 2, h(E)=0, h(I)=1, h(K)=2, h(M)=0, h(N)=1, h(O)=2, h(U)=0, h(Y)=1. Assume each non-leaf-level node can hold up to three itemsets. A left-level node is a node that cannot be split in the hash tree even when it is full.
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started
Advances In Databases And Information Systems 14th East European Conference Adbis 2010 Novi Sad Serbia September 2010 Proceedings Lncs 6295
Authors: Barbara Catania ,Mirjana Ivanovic ,Bernhard Thalheim
2010th Edition
3642155758, 978-3642155758
