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?

Show HN: Pragmatiq – open-source framework for foundational models in banking

Cursor (IDE) tried launching on HN 8 times unsuccessfully

Thoma Bravo takes one of the largest PE write downs in history on Medallia

Broadband Access and Adolescent Fertility

Donald Trump, Champion of Renewable Energy

Does anything I write matter anymore?

What If the Work We're Busy Automating Is Needless?

Research in math will change (from my email)

Cuba approves unprecedented free-market reforms to stave off economic collapse

OS Written in Embedded Swift

The Story of Semicolon

A Man Who Ran Putin's Hit Squad [video]

Why are Linux devices called TTY? [video]

A framework for systematically addressing undefined behavior in the C++ Standard [pdf]

My Taste Is Better Than Your Taste

Outlaw Billionaires

Google has made us Stupid

Try AI Operators on PostgreSQL

Worlds Smallest microcontroller, the Cortex M0 MCU MSPM0C1104

Ask HN: How to stop your coding agent from creating just AI slop for the UI/UX?

Show HN: Surface skill for HTML pages a coding agent watches and reacts to

Americans Want More Trains. Amtrak Delivers

Where in the wave of Physical are we now?

Indian Peaks Wilderness

Bison herd defend a newborn calf from wolf attack in a primeval Polish forest

InfiniBand, RoCE, and All That

Ask HN: What's the hardest part of maintaining a legacy codebase?

When Local Blocks Go Global: The India-Telegram BGP Incident

"Optimizing" Concurrent Regexes

Flint Paper Battery