Commit graph

4 commits

Author SHA1 Message Date
7493d8e33f fix: code-point string collation in LSM SSTable, COW trees/refs, sorted queries
Replaces localeCompare / raw relational operators with compareCodePoints (UTF-8
byte order) in the remaining persisted or native-facing comparison sites:
- SSTable sourceId sort + zone-map range check + binary search (graph LSM)
- COW TreeObject + RefManager name sorts (reproducible content hashes and ref
  listings across environments)
- getSortedIdsForFilter (numeric-aware; code-point for strings) so the JS sort
  fallback matches the native column store exactly

Deterministic across OS/Node/ICU and byte-identical to the native engine. No
migration: COW serialize/deserialize preserve stored order, so existing trees
keep their hashes; only new writes adopt code-point order.
2026-05-27 11:53:26 -07:00
239a4da835 fix: replace require('crypto') with ESM import in SSTable
SSTable.calculateChecksum() used require('crypto') which breaks in ESM
environments and Bun. Replace with top-level import { createHash } from
'node:crypto' — SSTable is Node-only (LSM-tree filesystem storage) so
a direct node:crypto import is appropriate.
2026-02-24 12:25:26 -08:00
773c5171c3 fix: flush all native providers on shutdown to prevent data loss
Shutdown/close/flush now properly flushes all 4 components in parallel:
metadataIndex, graphIndex, HNSW dirty nodes, and storage counts. Previously
only counts were flushed, causing native provider data loss on restart.

Also:
- Wire roaring, msgpack, entityIdMapper provider consumption from plugins
- Fix allOf filter O(n²) intersection → O(n) Set-based
- Fix ne/exists negation filter to use Set-based exclusion
- Add setMsgpackImplementation() swap in SSTable for native msgpack
- Add setRoaringImplementation() swap for native CRoaring bitmaps
- Add getAllIntIds() to EntityIdMapper for bitmap operations
- Remove TypeAwareHNSWIndex from default index creation path
- Export memory detection utilities from internals
- Clean up 26 permanently-skipped dead tests
2026-02-01 16:23:49 -08:00
David Snelling
e1e1a9733d feat: billion-scale graph storage with LSM-tree
Implement production-grade LSM-tree for graph relationships, reducing
memory usage by 385x (500GB → 1.3GB for 1B relationships) while maintaining
sub-5ms neighbor lookups.

Core Components:
- BloomFilter: MurmurHash3 with 90% disk read reduction
- SSTable: Binary sorted files with MessagePack (50-70% smaller)
- LSMTree: MemTable + automatic compaction (L0→L6)
- GraphAdjacencyIndex: Migrated to LSM-tree storage

Performance:
- Memory: 385x reduction for billion-scale relationships
- Reads: Sub-5ms with bloom filter optimization
- Writes: Sub-10ms amortized
- Storage: Works with all adapters (Memory, FS, S3, GCS, R2, OPFS)

Testing:
- 490/492 tests passing (99.6% success rate)
- Zero breaking changes
- All Triple Intelligence, VFS, Neural APIs working

🤖 Generated with [Claude Code](https://claude.com/claude-code)

Co-Authored-By: Claude <noreply@anthropic.com>
2025-10-14 16:36:26 -07:00