Hi everyone,
I am presently working on a binary tree in FileMaker. Hi already created an search index for each of my record. This search index allow me to identified Parent and Children. For example:
level 1 0
level 2 1 2
level 3 11 12 21 22
level 4 111 112 121 122 211 212 221 222
level n
With that kind of identification (search index) it is easy to fastly retreive a childen and every body abode him. Also the sorting is fast.
The problem: when I reached 60 levels (depht) the finding started to go crasy. I rapidly realized that the FileMaker index is limited to 19 charaters per word for a maximum of 60 characters. Bottom line, my database does not work anymore.
I could create a related db who could contain an identification system so that each of my record/position in the tree would e identified correctly. The maintenance is more complicated, espacially since thi system is running under Lasso.
I was wondering if any one would have information about algorythm or some sort of position identifier who would be shorter. Everything was working fine since I hitted the index limit.
Thanks in advance,
Gill
I am presently working on a binary tree in FileMaker. Hi already created an search index for each of my record. This search index allow me to identified Parent and Children. For example:
level 1 0
level 2 1 2
level 3 11 12 21 22
level 4 111 112 121 122 211 212 221 222
level n
With that kind of identification (search index) it is easy to fastly retreive a childen and every body abode him. Also the sorting is fast.
The problem: when I reached 60 levels (depht) the finding started to go crasy. I rapidly realized that the FileMaker index is limited to 19 charaters per word for a maximum of 60 characters. Bottom line, my database does not work anymore.
I could create a related db who could contain an identification system so that each of my record/position in the tree would e identified correctly. The maintenance is more complicated, espacially since thi system is running under Lasso.
I was wondering if any one would have information about algorythm or some sort of position identifier who would be shorter. Everything was working fine since I hitted the index limit.
Thanks in advance,
Gill