Fast chunked cross product

Open
#3,108 0 comments 0 reactions 0 assignees View on GitHub

Nobody has claimed this yet.

Assessment

Difficulty
5/5
Estimated time
Over a week
Newbie friendliness
35/100
Issue type
Feature
Clarity
Mostly clear
Activity status
Stale
Tech stack
haskell
Domain
backend

Research direction

Start by reading the stream cross product and unfold implementations, then compare their performance to understand where per element processing and fusion affect the current approach. The issue proposes using streams of arrays and unfolds; done would mean a faster cross product implementation that supports the stated logic programming use case. No files or tests are named, so first locate the relevant code and benchmarks.

Written by the indexing model from the issue text.

Description

Experimental idea: Currently cross product style streams are slow because they work on a per element basis and it does not fuse. The cross product using unfolds is extremely fast because it fuses. A good way to make stream cross products fast is by using stream of arrays and perform cross product of arrays using unfolds. This could help in implementing a faster logic programming monad.

Dominant language
Haskell
Stars
926
Forks
71
Avg merge
6h 49m
Merged PRs (30d)
3

Getting set up

First steps

  1. Read the whole issue, then the project's contributing guide.
  2. Comment on the issue to say you are picking it up — it saves two people doing the same work.
  3. Fork the repository and make your change on a branch.
  4. Open a pull request that references the issue number.

More from composewell/streamly

All issues in composewell/streamly

Similar issues

More Haskell issues

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.