I have started to converge on this space from a different perspective -- thinking about how to design a graph database in terms of discrete topology, which has led me to thinking in terms of the holographic principle: &quot;the description of a volume of space can be thought of as encoded on a boundary to the region&quot;. Specifically, I have been exploring how to use shape to succinctly and uniquely define an object&#x2F;relation in terms of the composition of its constituent parts in a way that enables fast decomposition back into its constituent parts.<p>For example, picture a spatial structure resulting from a the prime decomposition  (<a href="https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Integer_factorization#Prime_decomposition" rel="nofollow">https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Integer_factorization#Prime_de...</a>) of all the positive 64 bit integers [0 to 2^63-1]. In this space, the prime numbers are the base of this discrete topology. Picture the trees resulting from all the decompositions, with the roots jutting up into space like peaks in a mountain range. This gives the numbers shape and provides a foundation to anchor more abstract objects representations.<p>To further illustrate the point, we could define a discrete topology with each unicode character (<a href="https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Unicode#Code_point_planes_and_blocks" rel="nofollow">https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Unicode#Code_point_planes_and_...</a>) as a base element. Now define an algorithm to decompose strings into its constituent parts. Similarly, we could do the same thing with dates and time, decomposing them into trees, and likewise with geo coordinates in space. Or, we could map all of these structures onto a tree of its binary representation.<p>Now with these discrete elements as anchor points existing in multiple dimensions, define relations betweens them, and use the elements and relations to compose higher-level objects.<p>For example, in a property graph (<a href="https:&#x2F;&#x2F;github.com&#x2F;tinkerpop&#x2F;gremlin&#x2F;wiki&#x2F;Defining-a-Property-Graph" rel="nofollow">https:&#x2F;&#x2F;github.com&#x2F;tinkerpop&#x2F;gremlin&#x2F;wiki&#x2F;Defining-a-Propert...</a>),  each vertex can contain key&#x2F;value attributes, and traditionally when adding a new vertex, a vertex ID is assigned using a sequence generator. Edges are composed of two vertices, a label, optional key&#x2F;value properties, and an edge ID is commonly assigned using a sequence generator. Each vertex and edge is traditionally stored as a row in the database, and traversing the graph is a process that begins with looking up the &quot;start vertex&quot;, looking up its outgoing edges, traversing the outgoing edges to the incoming vertices, and continuing this process while using constraints to direct the traversal and filter out vertices and paths. For large graphs distributed across multiple machines, finding optimal ways to partition the graph across multiple machines is a challenge.<p>What if instead of identifying each vertex and edge by a meaningless integer, we uniquely define each vertex and edge by a compact representation of its constituent parts, like the cells of a body compose to form a person?<p>For example, consider the key&#x2F;value properties in a vertex, such as:<p><pre><code>  {type: &quot;person&quot;, handle: &quot;espeed&quot;, location: &quot;Dallas, TX&quot;, age: 38, updated: 20151205112207}
</code></pre>
...using our discrete topology, each key&#x2F;value pair is uniquely represented as a point in space, and the set of points are grouped together in a cell. Multiple cells compose together to form a cell complex (<a href="https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;CW_complex" rel="nofollow">https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;CW_complex</a>). When the set points are in general position, there exists a unique Delaunay triangulation (<a href="https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Delaunay_triangulation" rel="nofollow">https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Delaunay_triangulation</a>).<p>Use Delaunay triangulation to encode a unique ID for each vertex, and then use the resulting vertex IDs, label, orientation, and optional key&#x2F;value properties to compose edges. Edges then compose together to form a graph.<p>Here&#x27;s the question I&#x27;m exploring: Can we encode a graph in such a way that traversing the graph is reduced to a geometric algorithm?