Search Results for "data structures"

An immutable in-memory database and Datalog query engine in Clojure and ClojureScript. DataScript is meant to run inside the browser. It is cheap to create, quick to query and ephemeral. You create a database on page load, put some data in it, track changes, do queries and forget about it when the user closes the page. DataScript databases are immutable and based on persistent data structures. In fact, they’re more like data structures than databases (think Hashmap). Unlike querying a real SQL...

Moelnir is a basic database file, addressing variable record data through integer identifiers, which applies heap organisation of its data space. Advantage of Moelnir is that each record is stored in a continuous segment on the file while still record size is limit-less variable and modifiable. There are no data length limits other than the range of a 63-bit unsigned integer. Scalability is limited to 1 - 10 Mio. entries due to non-paging internal structures.

... and variable-entry-sized-array implementations for you to use in your data structures. So, what distinguishes meta-treedb from treedb? * "class" interfaces for treedb collections These are vtables (virtual function tables) that implement the interface. * faster compiles - only the "class" interfaces are visible to client code This is at the expense of a small performance hit. * the ability to use implementations that were developed after client code was compiled.

... doesn't have `just too many' log files? Occursions asynchronously tails log files and indexes the individual lines in each log file as each line is written to disk so you don't even have to wait for a second after an event happens to search for it. Occursions uses custom disk backed data structures to create and search its indexes so it is very efficient at using CPU, memory and disk. You can extend Occursions with shared libraries to support your own file formats, even binary file formats!

Question Mark Markup Language is a radical new markup language that is used to describe pseudo-hierarchical database structures. There are currently extremely fast and light weight python bindings available for Linux that are very user friendly.

A utility to update the data-structures of a FireBird database - Auto or Manual modes - No scripting required - Updates from an empty database with new structures - Selective update of metadata items - Can show report - Can create an SQL script

Java based tool for migrating database schemas and data between different databases and different structures.

TM4J is a topic map engine implemented entirely in Java. Topic maps are a standard paradigm for the interchange of knowledge structures. This project aims to produce a complete suite of tools for creating, processing and publishing topic map information.