feat(experimental): add batch-preserving luDF joins and lookups - #2962
Open
ibgreen-openai wants to merge 4 commits into
Open
feat(experimental): add batch-preserving luDF joins and lookups#2962ibgreen-openai wants to merge 4 commits into
ibgreen-openai wants to merge 4 commits into
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
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.
Goals
Expose documented unique-right-key
uint32inner joins and bounded left lookups through the optional luDF API while preserving independently streamed left/right source batches, explicit ownership, stable row identity, and GPU-resident diagnostics.Changes
LuDataFrame.innerJoin,LuDataFrame.lookup, and corresponding filtered/derived query methods with explicit key names and bounded index/output capacities.GPUBatchHashIndexprerequisite with existing GPU hash join/query primitives; build one index from independently chunked right tables without concatenation, repacking, CPU row access, or hidden submission.[3,0,5]/[2,0,3]topologies, nullable rows, discontinuous offsets, bounded outputs, duplicate/reserved/overflow contracts, repeated encodes, schema-only right tables, and source destruction.Dependencies
Verification
nvm use: Node v22.22.1.yarn install: not rerun; reused a verified dependency tree because the existing enterprise alpha registry dependency returns HTTP 403.@vis.gl/dev-toolsalpha lint configuration and finalyarn lint fixpassed.yarn buildpassed.yarn test: Node 621 passed/1 skipped; real Chromium/WebGPU 1,590 passed/25 skipped.yarn website:buildand(cd website && yarn build)passed.yarn examples:typecheckand all sevenyarn bundle-sizebudgets passed.Limitations
0xffffffffremains reserved; valid reserved right keys explicitly invalidate the join.