Search Results for "disk wipe linux"

HSQLDB is a relational database engine written in Java, with a JDBC driver, conforming to ANSI SQL:2023. A small, fast, multithreaded engine and server with memory and disk tables, LOBs, transaction isolation, multiversion concurrency and ACID.

Nonblonde is a key/value database. Nonblonde tables are backed by b-trees that organize their nodes as critical bit trees. It allows multiple tables per store, atomic updates, keys of unlimited size. Head and tail key compression and a variable block size reduce the database disk size. Disk blocks are never modified in place, for which the written database is always in an intended state and does not need repair or recovery.

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...

FastFreeTextSearchFiles (fastfreetextsea) is a external, internal hard disk, USB flash pen, file indexer for Fast Free Text Search.

Ray improves throughput when many concurrent queries access large scientific databases. Queries are synchronized to access sectors on disk simultaneously so that an arbitrary number of parallel queries can be executed without degradation in performance.

A disk based production quality RTree based upon Guttman’s 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.

Flared is Yet Another Memcached (but disk based). This software provides high-performance, distributed and fault tolerant objectstorage system w/ almost-memcached-compatible I/O interfaces.

The ZODB is a persistence system and database for Python objects. Persistent programming languages provide facilities that automatically write objects to disk and read them in again when they're required by a running program.

This is an implementation of the java DOM specification that keeps all its "parsed-node" data in disk files instead of RAM. This means you can create really big DOM trees an not use all your RAM.