Support SIMD low-memory overhead and high-performance adaptive radix tree.

future

Last update: Sep 7, 2022

Related tags

Overview

Artful

Artful is an adaptive radix tree library for Rust. At a high-level, it's like a BTreeMap. It is based on the implementation of paper, see The Adaptive Radix Tree: ARTful indexing for Main-Memory Databases for more information.

Artful is available on crates.io, and API Documentation is available on docs.rs.

Features

API similar to a BTreeMap<K,V>
Support SIMD instructions operations

Using Artful

Artful is available on crates.io The recommended way to use it is to add a line into your Cargo.toml such as:

[dependencies]
artful = "0.1.1"

Contribution

Static low-bandwidth search at scale

Pagefind Pagefind is a fully static search library that aims to perform well on large sites, while using as little of your users' bandwidth as possibl

657 Dec 30, 2022

Simple, automatic, and customizable tree pretty-printing in Rust.

display_tree Simple, automatic, and customizable tree pretty-printing in Rust. This crate provides tools to easily pretty-print data as a tree, includ

20 Dec 24, 2022

Serialize & deserialize device tree binary using serde

serde_device_tree Use serde framework to deserialize Device Tree Blob binary files; no_std compatible. Use this library Run example: cargo run --examp

20 Aug 20, 2022

An embedded key-value storage for learning purpose, which is based on the idea of SSTable / LSM-tree.

Nouzdb An embedded key-value storage for learning purpose, which is based on the idea of SSTable / LSM-tree. Plan Implement a memtable. Implement the

1 Dec 5, 2021

A cargo plugin for showing a tree-like overview of a crate's modules.

cargo-modules Synopsis A cargo plugin for showing an overview of a crate's modules. Motivation With time, as your Rust projects grow bigger and bigger

445 Jan 3, 2023

A minimal `syn` syntax tree pretty-printer

prettyplease::unparse A minimal syn syntax tree pretty-printer. Overview This is a pretty-printer to turn a syn syntax tree into a String of well-form

429 Dec 28, 2022

Embeddable tree-walk interpreter for a "mostly lazy" Lisp-like scripting language.

ceceio Embeddable tree-walk interpreter for a "mostly lazy" Lisp-like scripting language. Just a work-in-progress testbed for now. Sample usage us

7 Aug 18, 2022

Key-value store for embedded systems, for raw NOR flash, using an LSM-Tree.

ekv Key-value store for embedded systems, for raw NOR flash, using an LSM-Tree. Features None yet TODO Everything Minimum supported Rust version (MSRV

16 Nov 22, 2022

A tutorial of building an LSM-Tree storage engine in a week! (WIP)

LSM in a Week Build a simple key-value storage engine in a week! Tutorial The tutorial is available at https://skyzh.github.io/mini-lsm. You can use t

870 Jan 3, 2023

Comments

support get_mut
Most people want returns a mutable reference to the value corresponding to the key

the api just like

pub fn get_mut<K: ArtKey>(&mut self, key: K) -> Option<&mut V> where K: Borrow<K>
kind/enhancement help wanted kind/feature
opened by pidb 0
Clean duplicate algorithm codes

Due to Rust's memory model, the current implementation uses a lot of repetitive code to support Mutable and immutable methods. So, we want clean this duplicated codes.

In particular, we will introduce a new generic parameter type BorrowType for static dispatch different methods between Mut and Immut.

In high-level, the basic idea is shown below:

kind/documentation duplicate kind/enhancement help wanted kind/cleanup kind/feature

opened by pidb 2
SIMD instruction for node4
Basic idea 💡

The order of node4 keys is not maintained.

For insert_child, append-only.

For remove_child, the child at the corresponding index is marked as none.

For get_child, use the SIMD.

For shrink_to_fit, use SIMD to find the only child that is not none.

Therefore, two basic operations need to be implemented using SIMD

Input key byte, return the index of the corresponding child

Find the index of the only child that is not empty

kind/feature
opened by pidb 0
release v0.1
To release v0.1.0, here's what to do

[x] basic insert

[x] basic get

[x] #2

[x] support find use simd in node16

[x] x86 and x86_64 instructions (sse2)

[x] arm/aarch64 simd instructions (neon)

[x] #3

[x] x86 and x86_64 instructions (sse2)

[x] arm/aarch65 simd instructions (neon)

[x] #6

[x] #7

[x] #12

[x] #15

[x] #18

[x] #19

[x] #22

[x] #23

[ ] #24

[x] #25

[ ] #26

[x] #29

[ ] #31

kind/enhancement good first issue
opened by pidb 0

Owner

future

GitHub https://docs.rs/artful/latest/artful/

A radix tree implementation for router, and provides CRUD operations.

radixtree A radix tree implementation for router, and provides CRUD operations. Radixtree is part of treemux, on top of which updates and removes are

2 Dec 19, 2022

An inline SIMD accelerated hashmap designed for small amount of data.

Small-Map An inline SIMD accelerated hashmap designed for small amount of data. Usage use small_map::SmallMap; // Don't worry about the 16 here. // Wh

49 Nov 14, 2023

memchr vs stringzilla - up to 7x throughput difference between two SIMD-accelerated substring search libraries in Rust

memchr vs stringzilla Rust Substring Search Benchmarks Substring search is one of the most common operations in text processing, and one of the slowes

38 Mar 5, 2024

A Rust implementation of generic prefix tree (trie) map with wildcard capture support

prefix_tree_map A Rust implementation of generic prefix tree (trie) map with wildcard capture support. Design Trie is a good data structure for storin

3 Dec 6, 2022

Cogo is a high-performance library for programming stackful coroutines with which you can easily develop and maintain massive concurrent programs.

47 Nov 17, 2022

Support SIMD low-memory overhead and high-performance adaptive radix tree.

Related tags

Overview

Artful

Features

Using Artful

Contribution

You might also like...

Static low-bandwidth search at scale

Simple, automatic, and customizable tree pretty-printing in Rust.

Serialize & deserialize device tree binary using serde

An embedded key-value storage for learning purpose, which is based on the idea of SSTable / LSM-tree.

A cargo plugin for showing a tree-like overview of a crate's modules.

A minimal `syn` syntax tree pretty-printer

Embeddable tree-walk interpreter for a "mostly lazy" Lisp-like scripting language.

Key-value store for embedded systems, for raw NOR flash, using an LSM-Tree.

A tutorial of building an LSM-Tree storage engine in a week! (WIP)

Comments

support get_mut

Clean duplicate algorithm codes

SIMD instruction for node4

release v0.1

Owner

future

A radix tree implementation for router, and provides CRUD operations.

An inline SIMD accelerated hashmap designed for small amount of data.

memchr vs stringzilla - up to 7x throughput difference between two SIMD-accelerated substring search libraries in Rust

A Rust implementation of generic prefix tree (trie) map with wildcard capture support

Cogo is a high-performance library for programming stackful coroutines with which you can easily develop and maintain massive concurrent programs.

Nyah is a programming language runtime built for high performance and comes with a scripting language.

An AI-native lightweight, reliable, and high performance open-source vector database.

High concurrency, RealTime, In-memory storage inspired by erlang mnesia

Low-level CPU and register abstractions for the N64 console

Low level access to T-Head Xuantie RISC-V processors