Search Results for "tree database"
Sort By:
Showing 21 open source projects for "tree database"
View related business solutions-
Our Free Plans just got better! | Auth0You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
-
$300 Free Credits for Your Google Cloud ProjectsLaunch your next project with $300 in free Google Cloud credits—no strings attached. Test, build, and deploy without risk. Use your credits across the entire Google Cloud platform to find what works best for your needs. After your credits are used, continue with always-free tier services. Only pay when you're ready to scale. Sign up in minutes and start exploring.
-
1
db4o-gpl
new db4o gpl source code, for java7+ .netstandard2 android xamarin
Object-Oriented Database the best database project to help you to learn how to make databases https://sourceforge.net/p/db4o-gpl/code/ci/master/tree/README.md -
2
libadb
Astronomical Database
libadb is an astronomical catalog management library desgined to provide fast access to astronomical object data. -
3
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. -
4
avldb
Simple struct storage system, database library and engine.
Very simple struct storage system, AVL and red-black tree based database library - database engine. You can define indexes over C struct. -
$300 Free Credits to Build on Google CloudStart your next project with $300 in free Google Cloud credit. Spin up VMs, run containers, query petabytes in BigQuery, or build agents with Gemini Enterprise Agent Platform. Once your credits are used, keep building with 20+ always-free tier products including Compute Engine, Cloud Storage, GKE, and Cloud Run functions. No commitment required—just sign up and start building.
-
5
levin
in-memory key value server with fuzzy search capabilities
Levin is an event-based key/value server based on radix-tree (space optimized trie). Key search can be performed with an approximate key matching algorithm based on Levenshtein edit distance. -
6
meta-treedb
on-disk memory library using meta-data
meta-treedb can implement malloc functionality, and much more! Need a heap that allocates from a fixed size chunk of memory? No problem. But where treedb comes into its own is when it comes to allocating from a mmap()ed disk file - the memory becomes persistent. If you follow the tests/examples, you too can store dictionaries, trees, lists or whatever you can think of in disk-based memory, just an open() and mmap() away. Meta-treedb comes with an AVL tree, doubly-linked-list and... -
7
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... -
8
DB Comparator is a simple to use tool to compare and sync MS SQL Server databases. It shows all data object differences side by side in a hierarchical tree view. It compares tables, views, indexes, constraints, procedures, functions and user data typ
-
9
Occursions
Fast customizable time series web database for big data like log files
Our goal is to create the world's fastest extendable, non-transactional time series database for big data (you know, for kids)! Log file indexing is our initial focus. For example append only ASCII files produced by libraries like Log4J, or containing FIX messages or JSON objects. Occursions was built by a small team sick of creating hacks to remotely copy and/or grep through tons of large log files. We use it to index around a terabyte of new log data per day. You can use it too. Who... -
Secure File Transfer for Windows with Cerberus by RedwoodCerberus supports unlimited users and connections on a single IP, with built-in encryption, 2FA, and a browser-based web client — all deployable in under 15 minutes with a 25-day free trial.
-
10
solidDB for MySQL
SolidDB Storage Engine for MySQL
solidDB for MySQL is an open source relational database management system (RDBMS) that consists of MySQL Server and solidDB Storage Engine for MySQL. Project has morphed into a fully pluggable storage engine for MySQL 5.5 and later. Follow us on Facebook via the SolidDB MySQL Storage Engine page! -
11
Binary tree as a PostgreSQL data type. This was a university class project and I don't intend to develop it further. Made in Visual Studio 2010 for PostgreSQL 9.0. DLL provided (debug build). May you find the code useful.
-
12
An append only database manager in the style of dbm. It has both a C and a Python interface and is ACID compliant. Internally it uses an immutable B+ Tree. (Being append only doesn't mean that you can't replace records or delete keys).
-
13
A Tree is a hierarchical object database, based on Offsider technology. Data and/or functionality is stored as properties of nodes on the database. The Tree and all its nodes understand about paths. Database and nodes respond to object messages.
-
14
Tokyo Cabinet is the successor of QDBM, a high performance database library similar to the DBM family. It also supports hash and B-tree databases and does not require any server process. The overall speed is improved compared to QDBM.
-
15
A disk based production quality RTree based upon Guttmans quadratic split algorithm having following features: Buffering with dirty write, Index joins, Tree Seeding, Window and NN queries, Runtime STR Packing capability, Completely Thread safe.
-
16
ChaiDB is an embedded data storage developed at the kernel level by using B-Tree implementation. It is a natural database choice for name/value applications such as JSON. JSON-Cache utilizes ChaiDB to provide persistence and cache solution for JSON data.
-
17
XSpace is a globally accessible repository for hierarchically-keyed information. It provides persistence for trees with an elegant tree-navigation API. XSpace also publishes real-time events whenever a persisted tree is updated.
-
18
Red/Black Tree implementation. Port of the sourceforge libredblack library to C#. The package also consists of mutlitree (tree with non-unique key) and tree with quick direct access to items by the index.
-
19
Persitancy api simaler to Prevailer but with more transparancy and less intrusiv to how you can disign your data structure. It uses a bytecode enhancer to add needed code to have your object presited betwhen sessions.
-
20
JSpeed -- Java-based Open-Source Embedded Database Management System supporting network database model with limited relational access. JSpeed's goal is to provide a high-speed embedded database written in 100 percent Java. Key management uses EP-Tree.
-
21
- Previous
- You're on page 1
- Next
