v0.8.17: Scalar indices, index statistics, ANN search performance improvement
New features
- feat: allow scalar indices to be updated with new data by @westonpace in #1576
- feat: add python bindings for creating scalar indices by @westonpace in #1592
- feat: expose index cache size by @rok in #1587
- feat: track index cache hit rate by @rok in #1586
- feat: serialize arbitrary float type of PQ to protobuf by @eddyxu in #1624
- feat: coerce float array for nearest query by @eddyxu in #1618
- feat: make partition calculation parallel by @chebbyChefNEQ in #1625
- feat(rust): simplify object store option API by @wjones127 in #1627
- feat(python): add
index_cache_hit_rate
toindex_stats()
by @rok in #1631
Bug fixes
- fix: handle no max value for string by @wjones127 in #1600
- fix: fix chunk size issue by @wjones127 in #1630
Performance improvements
Previously, there was a performance bug where ANN search would be much slower if an entire fragment was deleted. This release fixes that so there is no drop in performance.
- perf: more efficient treemap implementation for row ids by @wjones127 in #1632
Other changes
- ci: use M1 runner for now for release by @wjones127 in #1623
- chore: expose avx512fp16 feature via main lance crate by @eddyxu in #1626
Full Changelog: v0.8.16...v0.8.17