This page is not created by, affiliated with, or supported by Slack Technologies, Inc.
2019-08-11
Channels
- # announcements (1)
- # beginners (35)
- # calva (28)
- # cider (14)
- # cljdoc (6)
- # cljs-dev (42)
- # cljsrn (2)
- # clojure (14)
- # clojure-spec (6)
- # clojure-uk (1)
- # clojurescript (13)
- # data-science (1)
- # emacs (3)
- # joker (3)
- # kaocha (1)
- # klipse (1)
- # leiningen (3)
- # off-topic (4)
- # pathom (10)
- # rewrite-clj (1)
- # shadow-cljs (28)
- # sql (5)
currently I am sorting data using the sort
fn, the dataset is small (100 entries). I have specified a custom comparator
for sorting the dataset. at what point does shifting to a db makes sense (assuming the data is stored in a db). What type of db is a good choice to do such a sorting ? or can sorting in db can be as efficient as code ?
A DB index, is often implemented as a sorted tree. As such, just creating an index on the data you want sorted will let you return subsets if the data sorted, rather quickly (this is an overly simple explanation)
@UBHTL6AF3 thanks