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: Conecta – blue-green deployments on a VPS using DNS and Caddy

Show HN: My Instagram saved posts was a mess, so I created InstaSave

Show HN: Automated XBRL Data Extraction for 10ks and 10qs

Show HN: SwarmMemo – a public bulletin board for agents

Awed, Scared and Humbled

Engineer and Nam A2 and AI = Perfect and Free Valen Halen Plug-In [video]

Flock used >100 times to track veteran who recorded traffic stop

Show HN: Formula-Only Sudoku and Tower of Hanoi in Excel

Show HN: A Lightweight TUI for Colima and Docker

When the Finder's size 'on disk' is misleading

Learn Programming with OCaml

Ig Nobels honor cockroach milk, interspecies kissing, taunting venomous snakes

Slackware 16.0 Alpha 1

Building a readable Rust alternative – looking for contributors

Sofka – K9s in Rust

Stretchly: Free software for 20-20-20 eye breaks

Judge Orders Trump Officials to Divulge Names of Those Who Set Up $1.8 Bi (Cont)

Latent Powers

Business grads buying firms to install themselves as CEO

NewLISP Neo: Replacing a Tree-Walking Interpreter with a VM and Generational GC

Older adults now outnumber the youngest children worldwide

Artificial Deadlines (Part 2): Retrograding Ariely and Wertenbroch

Comcast "offers" to track you in your home

Inside a growing movement warning AI could turn on humanity

More Rank-and-File Workers Are Getting Paid in Company Stock

Bob and Van

Still sending checks in the mail? It's time to stop

You can use "croc SSH" to share a terminal (this replaces tmate)

JRR Tolkien's Letter to the Nazis

Show HN: Amaze Kings – a browser logic puzzle with 1,400 hand-graded levels