b-tree alternatives and similar packages

Based on the "Data" category.
Alternatively, view b-tree alternatives based on common mentions on social networks and blogs.

• lens

  10.0 7.7 b-tree VS lens

  Lenses, Folds, and Traversals - Join us on web.libera.chat #haskell-lens
  

• semantic-source

  10.0 8.9 b-tree VS semantic-source

  DISCONTINUED. Parsing, analyzing, and comparing source code across many languages
  

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.

Promo www.influxdata.com



• hnix

  9.9 6.8 b-tree VS hnix

  A Haskell re-implementation of the Nix expression language
  

• text

  9.8 7.0 b-tree VS text

  Haskell library for space- and time-efficient operations over Unicode text.
  

• code-builder

  9.8 0.0 b-tree VS code-builder

  Packages for defining APIs, running them, generating client code and documentation.
  

• cassava

  9.7 3.5 b-tree VS cassava

  A CSV parsing and encoding library optimized for ease of use and high performance
  

• unordered-containers

  9.7 2.9 b-tree VS unordered-containers

  Efficient hashing-based container types
  

• Frames

  9.7 6.1 b-tree VS Frames

  Data frames for tabular data.
  

• massiv

  9.7 5.3 b-tree VS massiv

  Efficient Haskell Arrays featuring Parallel computation
  

• compendium-client

  9.7 0.0 b-tree VS compendium-client

  DISCONTINUED. Mu (μ) is a purely functional framework for building micro services.
  

• primitive

  9.6 5.2 b-tree VS primitive

  This package provides various primitive memory-related operations.
  

• holmes

  9.6 0.0 b-tree VS holmes

  A reference library for constraint-solving with propagators and CDCL.
  

• binary

  9.5 2.8 b-tree VS binary

  Efficient, pure binary serialisation using ByteStrings in Haskell.
  

• refined

  9.5 4.8 b-tree VS refined

  Refinement types with static checking
  

• resource-pool

  9.5 0.0 b-tree VS resource-pool

  A high-performance striped resource pooling implementation for Haskell
  

• critbit

  9.5 0.0 b-tree VS critbit

  A Haskell implementation of crit-bit trees.
  

• hashable

  9.5 5.7 b-tree VS hashable

  A class for types that can be converted to a hash value
  

• alfred-margaret

  9.5 6.0 b-tree VS alfred-margaret

  Fast Aho-Corasick string searching
  

• hashtables

  9.4 7.2 b-tree VS hashtables

  Mutable hash tables for Haskell, in the ST monad
  

• higgledy

  9.4 2.6 b-tree VS higgledy

  Higher-kinded data via generics
  

• network-msgpack-rpc

  9.4 b-tree VS network-msgpack-rpc

  A MessagePack-RPC Implementation

• diskhash

  9.4 3.2 b-tree VS diskhash

  Diskbased (persistent) hashtable
  

• data-msgpack

  9.4 b-tree VS data-msgpack

  A Haskell implementation of MessagePack

• aeson-qq

  9.4 3.6 b-tree VS aeson-qq

  JSON quasiquoter for Haskell
  

• cereal

  9.4 0.0 b-tree VS cereal

  A binary serialization library
  

• caledon

  9.4 0.0 b-tree VS caledon

  higher order dependently typed logic programing
  

• jump

  9.4 0.0 b-tree VS jump

  Jump start your Haskell development
  

• discrimination

  9.3 3.6 b-tree VS discrimination

  Fast linear time sorting and discrimination for a large class of data types
  

• audiovisual

  9.3 4.7 b-tree VS audiovisual

  Extensible records, variants, structs, effects, tangles
  

• certificate

  9.3 0.0 b-tree VS certificate

  Certificate and Key Reader/Writer in haskell
  

• dependent-map

  9.3 4.7 b-tree VS dependent-map

  Dependently-typed finite maps (partial dependent products)
  

• json-autotype

  9.3 0.0 b-tree VS json-autotype

  Automatic Haskell type inference from JSON input
  

• IORefCAS

  9.3 5.7 b-tree VS IORefCAS

  A collection of different packages for CAS based data structures.
  

• dependent-sum

  9.3 4.3 b-tree VS dependent-sum

  Dependent sums and supporting typeclasses for comparing and displaying them
  

• uuid-types

  9.2 3.9 b-tree VS uuid-types

  A Haskell library for creating, printing and parsing UUIDs
  

• rei

  9.2 0.0 b-tree VS rei

  Process lists easily
  

• safecopy

  9.2 4.2 b-tree VS safecopy

  An extension to Data.Serialize with built-in version control
  

• bifunctors

  9.2 4.4 b-tree VS bifunctors

  Haskell 98 bifunctors, bifoldables and bitraversables
  

• orgmode-parse

  9.2 0.0 b-tree VS orgmode-parse

  Attoparsec parser combinators for parsing org-mode structured text!
  

• protobuf

  9.2 2.6 b-tree VS protobuf

  An implementation of Google's Protocol Buffers in Haskell.
  

• uuid

  9.2 3.9 b-tree VS uuid

  A Haskell library for creating, printing and parsing UUIDs
  

• scientific

  9.2 0.0 b-tree VS scientific

  Arbitrary-precision floating-point numbers represented using scientific notation
  

• streaming

  9.2 0.0 b-tree VS streaming

  An optimized general monad transformer for streaming applications, with a simple prelude of functions
  

• reflection

  9.2 4.7 b-tree VS reflection

  Reifies arbitrary Haskell terms into types that can be reflected back into terms
  

• avro

  9.2 5.2 b-tree VS avro

  Haskell Avro Encoding and Decoding Native Support (no RPC)
  

• witherable

  9.1 2.4 b-tree VS witherable

  Filter with effects
  

• stdio

  9.1 1.8 b-tree VS stdio

  Haskell Standard Input and Output
  

• typerep-map

  9.1 2.1 b-tree VS typerep-map

  ⚡️Efficient implementation of Map with types as keys
  

• tables

  9.1 0.0 b-tree VS tables

  Deprecated because of
  

• MemoTrie

  9.1 2.1 b-tree VS MemoTrie

  Trie-based memo functions
  

Do you think we are missing an alternative of b-tree or a related project?

SaaSHub - Software Alternatives and Reviews

featured www.saashub.com

Popular Comparisons

• b-tree
  vs
  hashmap
• b-tree
  vs
  hnix
• b-tree
  vs
  murmur-hash
• b-tree
  vs
  wide-word
• b-tree
  vs
  elf