Search Results for "b-tree implementation"

Datahike is a durable Datalog database powered by an efficient Datalog query engine. This project started as a port of DataScript to the hitchhiker-tree. All DataScript tests are passing, but we are still working on the internals. Having said this we consider Datahike usable for medium sized projects, since DataScript is very mature and deployed in many applications and the hitchhiker-tree implementation is heavily tested through generative testing. We are building on the two projects and the storage backends for the hitchhiker-tree through konserve. ...

...Since Helidon is simply a collection of Java libraries running on a fast Netty core, there is no extra overhead or bloat. Helidon supports MicroProfile and provides familiar APIs like JAX-RS, CDI and JSON-P/B. Our implementation runs on our fast Helidon Reactive WebServer. Helidon Reactive WebServer provides a modern functional programming model and runs on top of Netty. Lightweight, flexible and reactive, the Helidon WebServer provides a simple-to-use and fast foundation for your microservices.

Java generic API for search algorithms on graphs implicitly given by tree node expansion operator

This package is designed for people who are a) interested in writing emulators or b) integrating this level of detain into their applications (e.g., a video game). The ability to do this is useful because a) it allows for tinkering far before physical implementation of the design is. In addition to a strong core, WFCPK will also include modules emulating various processors (e.g., the MOS 6502 and the Zilog Z80) as well as the Video-Audio Interface (a custom VGA-compatible display and audio controller). ...

An extension of the class javax.swing.JTree with a lot of improvements and utilities.

Stand-alone Java library implementing parser/formatter/comparator/validator for JSON/XML-like text formats oriented on JSON-like object model (list,map,scalar + reflection). Library is designed to maximize adaptivity via set of extendable modules.

Semantic query optimization (SQO) is the process of finding equivalent rewritings of an input query given constraints that hold in a database instance. We present a Chase & Backchase (C&B) algorithm strategy that generalizes and improves on well-known methods in the field. The implementation of our approach, the pegasus system, outperforms existing C&B systems an average by two orders of magnitude. This gain in performance is due to a combination of novel methods that lower the complexity in practical situations significantly.

Application simplifies the development and management of VHDL projects. The project is displayed in a well-arranged tree structure depending on the hierarchy of entities. It also helps to maintain projects in a consistent state. Other features include automatic generation of VHDL testbenches and structures based on user-defined templates. The NetBeans platform is used as a basis for the implementation.

This project aims to provide an extensible Tree interface to supplement the Java Collections framework, making full use of Java 5 generics. At least one reference implementation will be provided as part of the scope of this project.

JDots, Java Dynamic Object Tree Software. A library/framework to create a dynamic tree of Java objects, for active method communication/propagation. Java implementation of the BEAST project.

ProDT is a Prolog Integrated Development Environment (IDE) aiming to be as rich in functionality as the Eclipse's java IDE, and to support any standard Prolog implementation. Currently is being supported SWI Prolog, B-Prolog and XSB Prolog

Another xwiki document tree implementation. There are provided as samples two velocity files: one is a JavaScript approach (offers the posibility in expanding / collapsing a tree node) and the second a standard velocity approach.

A Java implementation of a cubic B-spline curve smoothing function. Allows an arbitary number of points with a variable number of dimensions to have a cubic B-spline curve "fitted". Useful in finance for analysing bond or swap yield and discount curves.

Long Running Transaction Tester (LRTTester) is data-centric test framework to externalize test cases. The goal is to allow non-programmers to easily generate and run tests. Initial implementation will be written in Java and can be run on any platforms, b