Improve DenseTensorSchema.key_range #193
Merged
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
DenseTensorSchema.key_rangecurrently returns anIntRangeof the key dimension values for dense arrays. For improved efficiency and memory predictability however, it is better if every partition of this key range (generated bypartition_by_countand/orpartition_by_weight) starts at a tile boundary so that any integral TileDB tile is read (at most) once.This PR updates
DenseTensorSchema.key_rangeto return aConstrainedPartitionsIntRangewhosestart_offsetsare a range with step equal to the tile size of the key dimension, ensuring that every partition (with the possible exception of the first) starts at a tile boundary.While this change is in general beneficial, it is even more important for extending properly #191 to dense arrays (since it is more likely that the default
IntRangepartitioning doesn't align with tile boundaries for an arbitrary user-selected key dimension slice).