# Access Geometry Access geometry is the project-specific term for choosing a data structure according to the question it must answer cheaply: hashes for keyed lookup, vectors for indexed candidate sets, trees for hierarchy, lists for sequence, and explicit edges for relations. In the symbolic language engine, offline pipelines created reduced representations and the runtime materialized them into retrieval-appropriate containers. The intelligence was partly in the shape of access, not only in the query algorithm. Related: [[wiki/Offline Precomputation|Offline Precomputation]], [[wiki/Materialized View|Materialized View]], [[wiki/Multi-Index Language Representation|Multi-Index Language Representation]].