Unlock a world of possibilities! Login now and discover the exclusive benefits awaiting you.
Hi
I'm using the Hierarchy command in my script to build a "Tree". The tree has 5 levels.
I get my data in 5 separated groups. 4 out of 5 of these groups generate the tree correct. These groups have approx. 900k-1000k nodes in the tree.
The last group is bigger and has approx. 3200k nodes in the tree.
If I use the debug and limit the amount of records it works fine for this group also, with a 1000k-2500k limit. But increasing it to 3000k gives me an script failed 😞
It fails while it is expanding leaves.
I'm using Qlikview 10 64 bits version and have 32GB of memory on the server, so lack of memory is not the problem.
Have anyone of you experienced trouble with a big tree? Or is there a limit for a Qlikview tree?
Any hints, tips and support will be much appreciated
Best regards
Knut Einar
Hi
I did get some feedback from the support I thougt I should share with you.
I have tested the solution since that part of the functionallity have been put on hold.
Add these tests when building your hiearchy(needed if you don't have 110% control of the data quality):
1) Always check if ID is nukk
2) check if name is not empty
LOAD
ParentID,
ID,
NameFROM HGTreeT_E05.qvd (qvd)
WHERE not isnull(ID)
AND Len(Name) > 1
;
You should also look for loops in your tree. Make sure all ID's are unique.
Sounds like something you probably should report to QlikView for further evaluation.
http://support.qlik.com
Hi
Thanks I will do that 🙂
But I'm still open for other suggestions.
Best regards
Knut Einar
Hi
I did get some feedback from the support I thougt I should share with you.
I have tested the solution since that part of the functionallity have been put on hold.
Add these tests when building your hiearchy(needed if you don't have 110% control of the data quality):
1) Always check if ID is nukk
2) check if name is not empty
LOAD
ParentID,
ID,
NameFROM HGTreeT_E05.qvd (qvd)
WHERE not isnull(ID)
AND Len(Name) > 1
;
You should also look for loops in your tree. Make sure all ID's are unique.