Search Results for "b tree"
Sort By:
Showing 47 open source projects for "b tree"
View related business solutions-
Gemini 3 and 200+ AI Models on One PlatformBuild generative AI apps with Vertex AI. Switch between models without switching platforms.
-
Full-stack observability with actually useful AI | Grafana CloudBuilt on open standards like Prometheus and OpenTelemetry, Grafana Cloud includes Kubernetes Monitoring, Application Observability, Incident Response, plus the AI-powered Grafana Assistant. Get started with our generous free tier today.
-
1
go-datastructures
A collection of useful, performant, and threadsafe Go datastructures
Go-datastructures is a collection of useful, performant, and threadsafe Go datastructures. Interval tree for collision in n-dimensional ranges. Implemented via a red-black augmented tree. Extra dimensions are handled in simultaneous inserts/queries to save space although this may result in suboptimal time complexity. Intersection determined using bit arrays. In a single dimension, inserts, deletes, and queries should be in O(log n) time. Bitarray used to detect existence without having to... -
2
BTree implementation for Go
BTree provides a simple, ordered, in-memory data structure for Go
This package is a high-performance, in-memory B-tree for Go that implements an ordered set/map with efficient insert, delete, and range iteration. It’s parameterized by tree degree so callers can tune cache behavior and memory overhead for their workload. Instead of relying on Go’s built-in maps—which are hash-based and unordered—btree preserves sorted order and provides rich traversal APIs like ascending, descending, and range scans. -
3
BJoinTree
Using B+Tree to join tables inside an index
This is a new DBMS using the BJoinTree technology to create a B+Tree index containing tables in join. The algorithm is simple and is linear on the number of tables in join. -
4
L2
A BST, B-tree and trie data structures library.
L2 is a data structures library. Featured are self balancing BSTs and self balancing BST backed sequences, in memory B-trees and B-tree backed sequences, pointer sets, radix and critical bit trees. A few articles about L2 data structures and more here: https://dsxxi.home.blog/ -
8 Monitoring Tools in One APM. Install in 5 Minutes.AppSignal works out of the box for Ruby, Elixir, Node.js, Python, and more. 30-day free trial, no credit card required.
-
5
xfe
A lightweight file manager for X
X File Explorer (Xfe) is an MS-Explorer like file manager for X. It is based on X Win Commander, which was developed by Maxim Baranov. Xfe aims to be the file manager of choice for people who are looking for a fast and light graphical file manager on Unix systems. -
6
VR Paged List for C# and more
VR Paged List for C# and more
a collection of Vincent Radio {Adrix.NT} C# sources & build projects includes - Paged Lists & Iterators Library for C# - Multi Dimensional Array Library for C# - MDArray List Manager Library for C# - Adjacency (List | Matrix) Direct Graph Libs for C# - Range Check functions - VRMosaic (WinForms) - with Auto Resolver also includes - Source Files - Visual Studio Build Projects - Test Applics have fun adrixnt@hotmail.it -
7
VR Ax Java Sources & Build Projects
VR Adrix Java Works - Paged Lists - Action-Entity Model ...
Adrix.NT Java Works :: Sources & Build Projects includes - Paged Lists of Object & Iterators Library for Java - Action / Entity Model for Java - VR Ax AWT Clock Java Component - VR Multi Dimensions Array Library - VR MDArray List Manager Library - VR Adjacency (List | Matrix) Direct Graph Lib - VRJMosaic cells sliding game with automatic resolver - VR RectsWorld Sample Applic - VR Free Chess 2D Applic also contains - Other Utils Libraries - Demo and Test Applications -... -
8
VR Paged List GXS for C++ and more ...
Paged Lists & Iterators GXS for C++ Sources by Vincent Radio {Adrix.NT
Vincent Radio {Adrix.NT} presents Paged Lists & Iterators GXS for C++ Sources by Vincent Radio {Adrix.NT} also contains - Little Docs about Paged Lists (docx, pdf) - VR Basic Common Utils Sources (Array List ...) - VR Generic Multi Dim Array Class - VR Generic MDArray List Mgr Class - VR Generic Adjacency (List | Matrix) Direct Graph Classes - VR List Interface with STL Support with some nice implementations (ArrayList, Paged-LIst) - Env Var Notes for sources for C++... -
9
Delphi : VRCalc++ OOSL (Script) and more
Delphi : VRCalc++ OOSL & + (Paged List, TextEditor, VRAstroVision ...)
Vincent Radio {Adrix.NT} Sources Library & Applications : Delphi C++ Java VRCalc++ C# VRCalc++ Object Oriented Scripting Language - Engine Source Pascal Code - Delphi Packages Build Prjs - VRCalc++ Scripted System Std RT Library - Guides & Docs (CHM, PDF, DOCX) - VCL & FMX (FireMonkey) Support - Script Test Code (Lang RTL VCL FMX) - Visual Stage Project : VCL & FMX Paged Lists & Iterators : Delphi C++ Java C# Multi-Dim Arrays & Direct Graph Classes : Delphi C++ Java VRCalc++... -
Try Google Cloud Risk-Free With $300 in CreditUse your credit across every product. Compute, storage, AI, analytics. When it runs out, 20+ products stay free. You only pay when you choose to.
-
10
Zee
A modern text editor for the terminal written in Rust
Zee is a modern editor for the terminal, in the spirit of Emacs. It is written in Rust and it is somewhat experimental. In the old tradition of text editor demos, here's what it currently looks like editing its own source code. -
11
JQuickBase
elementary database files for Java, B+ tree index files, ISAM
Java API to realize quick ISAM (Index Sequential Access Method) functionality for application in the file system. Includes scalable database files w/ space recovery and variable record length, scalable B+Tree index files. Supports file backup and restore. Two package types: one with and one without strong file encryption using Twofish algorithm and state-of-the-art encryption technology. -
12
crabdb
A concurrent B+ tree based embedded storage library.
-
13
pMaps
Java File Persistent Map implementation
File persistent and indexed (B-Tree) Key/Value database in java implementing the Map interface. -
14
sled
The champagne of beta embedded databases
...Zstd compression (use the compression build feature, disabled by default). Cpu-scalable lock-free implementation. Flash-optimized log-structured storage. Uses modern b-tree techniques such as prefix encoding and suffix truncation for reducing the storage costs of long keys with shared prefixes. If keys are the same length and sequential then the system can avoid storing 99%+ of the key data in most cases, essentially acting like a learned index. sled performs prefix encoding on long keys with similar prefixes that are grouped together in a range, as well as suffix truncation to further reduce the indexing costs of long keys. -
15
LazView
LazView Image viewer
LazView is a simple image viewer writen in FreePascal and Lazarus IDE -
16
This library solves tree irreconciliated issues: a) Full encoding bidireccional conversions trough unicode encoding b) Small executables versus speed. c) multiplatform Adittionaly this library solves "human equivalent characters" ( for searching
-
17
Hitchhiker Tree
Functional, persistent, off-heap, high performance data structure
Hitchhiker-Tree is a functional, immutable, off-heap, snapshottable sorted map data structure (a persistent key-value tree) designed for scalable, high-performance storage in Clojure / ClojureScript systems. It blends ideas from fractal trees and B-trees, supports lazy loading, and can persist incrementally to arbitrary backends. It is used as a backend for systems like Datahike and can support enormous data sets while retaining functional persistence semantics. ... -
18
bps
A B-tree based associative array library.
B-tree with a twist pointer set. The ordered set approaches the speed of the fastest unordered, hash table based sets, while using several times less memory. -
19
Creates an index to DBF files using a B+ Tree; Cria um indice para um arquivo DBF usando uma arvore B+; Implementação em C; Baseada em Arquivo;
-
20
NetFireCoRE
Network Firewall Linux Kernel Module with Conflict Resolution Engine
We implement an open source conflict resolution framework that consists of a user-space C application that automatically resolves firewall rules anomalies, and b) a generic tree (called policy tree), implemented as a Linux kernel module which maintains the resolved firewall rules and enables the necessary hooks to netfilter for matching incoming (or outgoing) network packets. Tree-based data structures offer improved efficiency compared to traditional access control lists (e.g. iptables or nftable maps), especially for large systems with a huge number of rules. ... -
21
SummitDB
In-memory NoSQL database with ACID transactions, Raft consensus, etc.
...Go must be installed on the build machine. It may be worth noting that while SummitDB supports many Redis features, it is not a strict Redis clone. SummitDB provides one key space that is a large B-tree. An ordered key space allows for stable paging through keys using the KEYS command. Redis uses an unordered dictionary structure and provides a specialized SCAN command for iterating through keys. -
22
bs
A B-tree based sequence library.
BS is a data structures library. It features fixed data size, random access sequences. The sequences are constructed over B-trees. Complexity for most single item operations is about O(logN). -
23
lmdb++
C++11 wrapper for the LMDB embedded B+ tree database library.
This is a comprehensive C++ wrapper for the LMDB embedded database library, offering both an error-checked procedural interface and an object-oriented resource interface with RAII semantics. • Designed to be entirely self-contained as a single <lmdb++.h> header file that can be dropped into a project. • Implements a straightforward mapping from C to C++, with consistent naming. • Provides both a procedural interface and an object-oriented RAII interface. • Simplifies error handling by... -
24
lib_data_io is a set of PHP libraries designed to easily move complex sets of data between PHP array data structures and a variety of sources and destinations including JSON, XML, ICAL, MySQL, HTML, Trac WIKI, text, LDIF, and plot images.
-
25
B Tree First-Fit malloc()
B Tree First-Fit Memory Allocator
BTFF Features O(log n) time with First-Fit behavior, as n is the number of allocated & free blocks. No boundary tag. Separation between payload and bookkeeping meta data. It does not use any free payload area. As of v1.0, payloads are located in data segment area which is acquired by brk(), and bookkeeping meta data are located in separated area which is acquired by mmap(). Small bookkeeping meta data overhead. Applicable to any kind...
