Hierarchy design - how to support sub tree searches?
I have a design problem that requires that a hierarchy support sub tree searching.
For example, take the following hierarchy....
| |--- London
| |--- Manchester
| |--- Edinburgh
There is a search requirement where if a parent node is selected then the search results should return all child nodes under that parent node, across all underlying subordinate levels. For example, selecting 'Europe' as the search parameter would return 'UK', 'London',' Manchester', 'Edinburgh', 'France' and 'Germany' as the results.