@neo2551 datascript indices are implemented using PersistentSortedSet: https://github.com/tonsky/persistent-sorted-set Which are themselves B-trees: https://en.wikipedia.org/wiki/B-tree So worst case logarithmic search/insert/delete. Not sure on the log’s base tho. Shouldn’t be too hard to find the branching factor in the source code.