Search Results for "data structures"

Limada (Linked Marked Data) is a framework for managing relationships of data in non-hierarchical structures, where the individual elements are interconnected in complex ways. The philosophy behind: Information is connection, is relationship of data.

...It uses a RAM stored index, which takes up approximately 600MB of memory for a corpus of 2 million sentences. It is based on the idea of a suffix array, enhanced by the presence of other auxiliary data structures. The effects are stunning - Concordia is able to do simple substring lookup at the pace of 5000 queries per second (on personal PC) - a speed which can not be achieved by any other search library. Moreover, Concordia can perform its own "concordia search". For a given input sentece, all substring matches covering this sentence are retrieved. ...

An application developed in C using the list and the AVL tree data structures, which analyzes a text (.txt file) giving the following information as an output: 1. the total occurrences of every word in the text 2. the exact line of every occurrence of every word 3. the exact position in the line of every occurrence of every word 4. the exact paragraph of every occurrence of every word 5.

Diversity assessments and comparisons of large compound databases require calculating similarities of millions of compounds in an affordable time. ParaSim addresses this challenge by parallelizing the calculations according to the number of computing cores available on a single machine. It is optimized for the throughput of very large numbers of query structures against very large numbers of reference structures. As as special feature, ParaSim allows to store and and to access frequently...

Highly efficient Data Generator for Benchmarks and Algorithm Performance Analysis. Supports fully configurable schemata as well as meta structures like Foreign Keys and Functional Dependencies.

The goal of project is delivering useful and simple tools to creating charts. Functionality is provided by modules/plugins (OSGi technology). It allows you to create your plugins or customize Analysis application (by changing installed plugins in application). The Application, thanks to JAVA technology, is portable on the most operating system. In Files page you can find the application and also patches to its.

UDA stands for Universal Descriptive Algebra. It consists of a Java package handling universal algebras and relational structures as description systems.

The aim of MIEX (Metadata and Information Extractor from small XML documents) is to create a wrapper for the Stanford Parser, to extract and store metadata (syntactic structures, relationships among words...) from simple XML documents.

JavaMatch is an engine that can search inside a runtime Java data structures, and look for objects that best match the criteria that you specify. The extensive query mechanism allows for highly customizable tuning of your match queries.