The surprisingly difficult problem of user-defined order in SQL

1. mudderjs

   1 1 125 0.0 JavaScript

   Lexicographically-subdivide the “space” between strings, by defining an alternate non-base-ten number system using a pre-defined dictionary of symbol↔︎number mappings. Handy for ordering NoSQL keys.

   

   I have solved this problem for my own purposes — no claims of grand scalability or high efficiency — by storing indices or "ranks" of items as strings (Postgres TEXT) using a library called mudderjs[0] and a thin wrapper around it[1]. Sorted lexicographically (in dictionary order) arbitrary-length strings have arbitrary precision. You can always find a string between any two strings; for instance, between "a" and "b" is "am" and between "a" and "ab" is "aam". You do have to have the entire ordered collection in scope to generate a new rank for an item, but reordering an item only requires updating one row and isn't subject to floating point precision.

   [0] https://github.com/fasiha/mudderjs

   [1] https://github.com/pubpub/pubpub/blob/master/utils/rank.ts

2. InfluxDB

   www.influxdata.com featured

   InfluxDB – Built for High-Performance Time Series Workloads. InfluxDB 3 OSS is now GA. Transform, enrich, and act on time series data directly in the database. Automate critical tasks and eliminate the need to move data externally. Download now.

   

3. Awesome Nested Set

   2 2 2,411 5.8 Ruby

   An awesome replacement for acts_as_nested_set and better_nested_set.

   

   Ex https://github.com/collectiveidea/awesome_nested_set

Suggest a related project