Advances, Systems and Applications
Table 1 Main differences between BHC Binary Hierarchical Clustering and BRT Bayesian Rose tree structural data model
| Â | BHC Binary Hierarchical Clustering structure | BRT Bayesian Rose Tree structure |
|---|---|---|
Applicability of structure | specialized | general |
Quality of data structure | poor/good | very good |
Emptiness of data structure | supported | not supported |
Basic DML operations | supported | supported |
Number of children | maximum two | arbitrary |
Degree of node (in/out) | limited | unlimited |
Number of subtrees | mainly two (left/right) | zero or many |
Height of tree | log2 N (where N is the number of nodes) | logM N (where M is the order of tree) |
Data order | ordered | unordered/ordered |
Order criteria | single | zero or multiple |
Resulting partition set | large | small |
Performance requirements | performed when data is loaded in the RAM | performed when data is loaded in the disk and/or RAM |
Execution time | logarithmic | exponential |
Scope of appliance | mostly in coding and code optimizations | in DBMS internal structures and distributed environments |