Packed Data Support in Haskell

https://arthi-chaud.github.io/posts/packed/

77•matt_d•1y ago

Comments

nine_k•1y ago

> Introducing the ‘packed’ data format, a binary format that allows using data as it is, without the need for a deserialisation step. A notable perk of this format is that traversals on packed trees is proven to be faster than on ‘unpacked’ trees: as the fields of data structures are inlines, there are no pointer jumps, thus making the most of the L1 cache.

That is, a "memory dump -> zero-copy memory read" of a subgraph of Haskell objects, allowing to pass such trees / subgraphs directly over a network. Slightly reminiscent of Cap'n Proto.

90s_dev•1y ago

We are always reinventing wheels. If we didn't, they'd all still be made of wood.

Zolomon•1y ago

They mention this in the article.

spockz•1y ago

It reminds me more of flat buffers though. Does protobuf also have zero allocation (beyond initial ingestion) and no pointer jumps?

cstrahan•1y ago

No, one example of why being variable sized integers.

See https://protobuf.dev/programming-guides/encoding/

carterschonwald•1y ago

One thing that sometimes gets tricky in these things is handling Sub term sharing. I wonder how they implemented it.

tlb•1y ago

> the serialised version of the data is usually bigger than its in-memory representation

I don’t think this is common. Perhaps for arrays of floats serialized as JSON or something. But I can’t think of a case where binary serialization is bigger. Data types like maps are necessarily larger in memory to support fast lookup and mutability.

nine_k•1y ago

I suppose all self-describing formats, like protobuf, or thrift or, well, JSON are bigger than the efficient machine representation, because they carry the schema in every message, one way or another.

IsTom•1y ago

If you use a lot of sharing in immutable data it can grow a lot when serializing. A simple pathological example would be a tree that has all left subtrees same as the right ones. It takes O(height) space in memory, but O(2^height) when serialized.

gitroom•1y ago

honestly i wish more stuff worked this way - fewer hops in memory always makes me happy

lordleft•1y ago

This was very well written. Excellent article!

NetOpWibby•1y ago

Is this like MessagePack for Haskell?

We Like Things

IBM builds a better fridge for its quantum computers

Show HN: A design skill that turn your feelings into UI and remembers it

Show HN: Synchroize, control, and orachstrate any angets on any device

Commenting no longer works on old.reddit.com

Alexander Vampilov

Prediction Market Cheating Gets Creative

Show HN: MandarinClips – Learn conversational Chinese from 130k+ TV drama clips

The science behind Pixel Watch's insulin resistance feature

Study Finds Narwhal Tusks Have 2 Spirals – Not 1–Twisting in Opposite Directions

A Doctor Who Became Afraid of Death

I built a courtroom for the internet. Verdicts stay sealed until you vote

Old-School Electronics Repair Man Vows to Be the Last in Chicago

Mojo is now open source

Show HN: Tech / AI / Product super aggregator – SudoReport

Testtospeech.com – New leaderboard adds balance and removes bias

Show HN: Zmina – clipboard with per-app paste transforms

Product.now

Life finds a way OpenAI claims partial pause and rolls out ChatGPT for Teens

Landing the Plane

Show HN: Store Front For Vibe coded apps

Algorithms + Data Structures = Programs

The Data Center Capital of the World [video]

Ask HN: Calorie Trackers

What is inference engineering? Deepdive

The Hermès heist: how an heir to the dynasty was swindled out of $15B of shares

Ornith-1.5: From Self-Scaffolding to Self-Improvement

X262: X264 with MPEG-2 Support

The two largest reservoirs in the US have hit record-low levels

Does daycare damage children's brains?