- Posts: 14
Before asking for help please read "Requesting Help and Suggestions" by clicking on that tab above here.
relashanship between me and an individual
- mohammed@omantel.net.om
-
Topic Author
- Offline
- New Member
-
Less
More
1 week 5 days ago #1
by mohammed@omantel.net.om
Mohammed Alkindy - Ver 2.1.16 nginx
relashanship between me and an individual was created by mohammed@omantel.net.om
hello every one,
i wonder how long does a search for relationship with me take if all possibilities is chosen? if i run the closest i get almost immediate results but if i want to display all possibilities and all relations i wait for ever with out result. i do not think my machine is slow. could it be my configuration of the web server and the php? i am running 2.1.17
i wonder how long does a search for relationship with me take if all possibilities is chosen? if i run the closest i get almost immediate results but if i want to display all possibilities and all relations i wait for ever with out result. i do not think my machine is slow. could it be my configuration of the web server and the php? i am running 2.1.17
Mohammed Alkindy - Ver 2.1.16 nginx
Please Log in or Create an account to join the conversation.
- drblam
-
- Offline
- Junior Member
-
Less
More
- Posts: 128
1 week 5 days ago #2
by drblam
Replied by drblam on topic relashanship between me and an individual
There was a previous discussion of this issue on the forum where Greg explained how "Find Relationships" works, but I can't locate it.
When you try to find all possible relationships, the search algorithm becomes recursive, which makes it consume vastly more resources.
The basic algorithm finds the shortest path from A to B, so in order to find different paths the problem gets split into finding the shortest path from A to C, followed by the shortest path from C to B, for all possible choices of C.
By default, the depth of the recursion, i.e., the number of specified intermediate points, is unlimited, so the program quickly runs out of memory and gives up without finding any answers, unless you have a very small tree. To prevent this, you can go to the control panel and try to limit the depth of recursion.
My tree has over 30,000 individuals, and one level of recursion often finds alternate paths, and still succeeds every time I've tried it.
When you try to find all possible relationships, the search algorithm becomes recursive, which makes it consume vastly more resources.
The basic algorithm finds the shortest path from A to B, so in order to find different paths the problem gets split into finding the shortest path from A to C, followed by the shortest path from C to B, for all possible choices of C.
By default, the depth of the recursion, i.e., the number of specified intermediate points, is unlimited, so the program quickly runs out of memory and gives up without finding any answers, unless you have a very small tree. To prevent this, you can go to the control panel and try to limit the depth of recursion.
My tree has over 30,000 individuals, and one level of recursion often finds alternate paths, and still succeeds every time I've tried it.
Please Log in or Create an account to join the conversation.
- mohammed@omantel.net.om
-
Topic Author
- Offline
- New Member
-
Less
More
- Posts: 14
1 week 4 days ago #3
by mohammed@omantel.net.om
Mohammed Alkindy - Ver 2.1.16 nginx
Replied by mohammed@omantel.net.om on topic relashanship between me and an individual
million thanks, some how i did not realize that i can make do seating on this feature. i tried it and it worked. thank you
Mohammed Alkindy - Ver 2.1.16 nginx
Please Log in or Create an account to join the conversation.