Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

Interesting.

For short trees and in-memory management another option would be:

  electronics
  /televisions
  //tube
  //lcd
  //plasma
  /portable electronics
  //mp3 players
  ///flash
  //cd players
  //2 way radios
Where depth levels are represented by slashes only.

Replace with indexes and you have a shorter version.

Let's see what else we can come up with just for fun...



You seem to be assuming a record order; SQL doesn't really have that. (You can hack stuff together but you're still building on an essentially orderless foundation.) That's a fine text document format, though tabs or spaces would be more traditional in that role.


record: n int, val varchar2

Manage and sort in-memory and store already ordered when done (no matter if it is physically unordered).

That's why I said, for small trees and in-memory management.




Consider applying for YC's Summer 2026 batch! Applications are open till May 4

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: