April 05, 2004
1. Build query graph.
2. Enumerate unique paths through query graph up to path length 4.
3. Do the same for the search graphs.
4. List combinations of paths to uniquely traverse query graph.
5. Drop those search graphs that don't match in number of enumerated paths.
6. Finally match, join and trim the search graph paths which match the query graph paths.
Posted by daen at April 5, 2004 12:46 AM