Support graph-oriented indexing #95

New issue

Open

opened 2020-08-06 16:54:49 +00:00 by gburd · 0 comments

gburd commented

2020-08-06 16:54:49 +00:00

(Migrated from github.com)

Pull expressions allow for recursion. One could also write rules, or even regular queries, that do path traversal over attributes.

We should consider whether there are any indexing options to expose to consumers that would help Datomish efficiently answer these queries. For example, a transitive closure index on an attribute would, at the cost of materializing and maintaining the transitive closure matrix/list, turn a recursive SQL join into a simple lookup, and also exposes minimum distance functions cheaply.

This is one example of a set of ways in which Datomish might support graph queries and other kinds of operations at a higher level of abstraction, just as :fulltext true does for full-text search. We should be on the lookout for more.

[Pull expressions allow for recursion](http://docs.datomic.com/pull.html#recursive-specifications). One could also write rules, or even regular queries, that do path traversal over attributes. We should consider whether there are any indexing options to expose to consumers that would help Datomish efficiently answer these queries. For example, a transitive closure index on an attribute would, at the cost of materializing and maintaining the transitive closure matrix/list, turn a recursive SQL join into a simple lookup, and also exposes minimum distance functions cheaply. This is one example of a set of ways in which Datomish might support graph queries and other kinds of operations at a higher level of abstraction, just as `:fulltext true` does for full-text search. We should be on the lookout for more.