Thanks for your comment, Rick. Agree re: the inefficiency of graph traversal in querying tree hierarchies. Cypher's declarative pattern matching technique allows us identify and retrieve relevant/related nodes based on a query, then perform subsequent retrievals related to those nodes. We'll be accounting for time complexity when performing hierarchical graph traversal, tho we also need to be mindful of how our structures change over time. Any thoughts on an indexing strategy that accommodates frequent updates without significant performance trade-offs? Thanks!