You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
{{ message }}
This repository has been archived by the owner on Jul 19, 2024. It is now read-only.
Curious if there is a way to use HierarchialPartitionKeys with geospatial data and doing "bounds" queries. For example, given a READ-heavy use case, where 99% of queries are utilizing ST_WITHIN and ST_INTERSECTS -- is there a way to utilize HierarchialPartitionKeys with geospatial data?
Currently, for the above use case, we are using the document ID as the partition key and a spatial (geography) index on a Point (latitude / longitude) -- which seems to work well, but if there is a better way to approach the problem, I would be interested in knowing as there seems to be a lack of examples that deal with geospatial design / queries.
Thanks in advance.
The text was updated successfully, but these errors were encountered:
Sign up for freeto subscribe to this conversation on GitHub.
Already have an account?
Sign in.
Hello,
Not really an issue, but a question ...
Curious if there is a way to use HierarchialPartitionKeys with geospatial data and doing "bounds" queries. For example, given a READ-heavy use case, where 99% of queries are utilizing ST_WITHIN and ST_INTERSECTS -- is there a way to utilize HierarchialPartitionKeys with geospatial data?
Currently, for the above use case, we are using the document ID as the partition key and a spatial (geography) index on a Point (latitude / longitude) -- which seems to work well, but if there is a better way to approach the problem, I would be interested in knowing as there seems to be a lack of examples that deal with geospatial design / queries.
Thanks in advance.
The text was updated successfully, but these errors were encountered: