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?

I timed 7,194 journeys to find London's most equidistant pub

Introduction to Multiparty Computation Tutorials

Silicon Valley Splits over Closing the Borders to Chinese A.I

Samsung wins $200B Broadcom AI chip partnership, boosting foundry push

RedisME: RDM tool for Java serialization in the world

A Convergence of Health Crises Under Robert F. Kennedy Jr. Leadership

FDA panel supports broadening access to peptides popular on the gray market

Real Linux for your smartphone: Ubuntu Touch release 24.04-2.0 and 24.04-1.4

Messy Jobs: The Work That AI Cannot Reach

The Silurian Hypothesis (2020)

Wikiview: Graph-based browsing of Wikipedia images

Micron urges White House to reject Apple's blacklist memory plan

The AI Productivity Illusion

Your Best Work Leaves No Trace: Why We Reward the Fix and Replace the Prevention

My web version of Mars MIPS, now have builtin C compiler

Stripe in talks to acquire OpenRouter in potential $10B deal, WSJ reports

Reality Bites Elon Musk and His Tesla, SpaceX Believers

Show HN: Collecte MTL – Montreal waste collection schedules (web and iOS)

Show HN: T-Shirt Weather. See the multi-day forecast for any city on a world map

Chinese Discoveries Thru History

Trump administration admits clean energy grants were canceled based on politics

KFC delivery to Ukraine's front line

A shell colon does nothing. Use it anyway.

Harddrive Is Probably Full

Corporate America Has Suddenly Decided to Stop Blowing Money on AI

If another advanced civilization lived on Earth before us, would we know?

Codeberg is blocking LLM generated code

Show HN: I built sticky notes that connects to Apple Calendar and Reminders

Conversation Is Being Recorded. They All Are

What are you getting paid in? (2024)