Relations and their domain structures
In this scribble I’ll discuss an implementation of different topological structures, which can be used for indexing different “relation systems”, for example trees for menus, book structures, etc… graphs for caching links between pages.
We can split the problem into two main subproblems. First, navigation and queries withing a single relation domain. For example local table of contents for a section in a book. Second is higher order or inter-domain queries. For example: given a node, determine the all related nodes, ordering them by their distance from the node, based on taxonomy, their position in a book(s), and their position in the site’s “link web”. We should be able to implement second and hier order based queries, based on the results of these two basic problems.