Open Source Linux Algorithms

Technical analysis library with indicators like ADX, MACD, RSI, Stochastic, TRIX... includes also candlestick pattern recognition. Useful for trading application developpers using either Excel, .NET, Mono, Java, Perl or C/C++.

JoSQL (Java Objects SQL) provides SQL capabilities for querying, ordering and grouping of collections of Java objects (POJOs). It allows a SQL statement to be applied to the collection of objects and the matching set returned, ordered and grouped.

C-squares is an easily implemented method for storage, querying and display of spatial data locations, based on a hierarchical, grid-based representation of the Earth' surface. Source code for encoding, decoding, mapping, etc. is provided via this site. Additional support is available by contacting the system developer, Tony.Rees@marinespecies.org; see also the c-squares home page at http://www.cmar.csiro.au/csquares/ .

This library implements several locality sensitive hashing(LSH) based algorithms, including indexing data structure for high dimensional spaces and metric spaces, sketch constructions and set embedding algorithms.

Now part of Apache's Mahout machine learning project at http://mahout.apache.org/-- please see there for latest info and code and releases and support!

ARMR provides a foundation for creating an efficient in-memory database. Its unique list processing structures simplify programming logic and allow the developer to rapidly sort, group, and select data. Give your app a hypercard like capability.

BinBase is a software for the automatic analysis of Massspec data from LECO GC-Tofs. All code and documentation has been moved to the google code site of this project: https://code.google.com/p/binbase/ And support is provided by the company coding and more, which can be reached under: contact@codingandmore.org

Bookinex is an application designed to index your collection of books, it supports scanning of Barcodes to recognize ISB Numbers and querying web services to collect data.

Fast search using a standard SQL on Oracle or PostgreSQL database. The package includes the database creator, loader and web application. It supports SMILES and SMARTS substructure searches, similarity search, stereochemistry.

DBI++ is a C++ port of the famous Perl DBI module. Currently it just supports MySQL, but the goal is, to extend it to a driver-independent interface. License is LGPL, so it can be used in closed-source-software, too.

Free scripts & examples- JSP, Eclipse, SQL, PHP, ASP, Win32 Batch, Javascript, Flash/Actionscript. -=-=-=-=-=-=- NOTE: This project is closed. For new development related to integrating Beyond Compare with Eclipse, see http://beyondcvs.sourceforge.net/

The project will be looking at data (the intention is to begin looking at customer name/address data but this may widen over time) and ways to intelligently detect duplicates using fuzzy matching methods and algorithms.

JXmlSql is a Java database API ( MySql, Oracle, Access )that eliminates JDBC code. JXmlSql allows developers to define application and prepopulation SQL statements inside xml files. Options for query, insert, update, delete, report and prepopulation SQL.

JaQLib is a compact Java library that supports programmers in querying all sorts of collections, DBs and XML files in a compact and intuitive manner. Example: List<MyItem> result = Jaqlib.List.selectFrom(myCollection) .where(myCondition).asList()

MAPONTO is an interactive tool for discovering semantic mappings between database schemas and ontologies as well as between different database schemas. The tool analyzes semantics in the input schemas and ontologies for generating semantic mappings.

Java Component created to persist and work with trees (it doesn't matter the type of persistence). Based on "Nested Set Model of Hierarchies" by Joe Celko. [Componente Java para persistir y trabajar con árboles (no importa el tipo de persistencia)]

A simple, fast, embeddable, persistent key/value store written in pure Go. It supports fully serializable transactions and many data structures such as list, set, sorted set. It supports fully serializable transactions and many data structures such as list、set、sorted set. All operations happen inside a Tx. Tx represents a transaction, which can be read-only or read-write. Read-only transactions can read values for a given bucket and a given key or iterate over a set of key-value pairs. Read-write transactions can read, update and delete keys from the DB. NutsDB allows only one read-write transaction at a time but allows as many read-only transactions as you want at a time. Each transaction has a consistent view of the data as it existed when the transaction started. When a transaction fails, it will roll back, and revert all changes that occurred to the database during that transaction.

An adaptive mini database learns algorithmic operations for data intensive algebraic computational methods within a pervasive computing graph. It also provides generic structures and algorithms as a data fabric.

PHPersistencia is a database persistence layer for PHP, offering Object Oriented interface to access the data, generating sql queries transparently for insert/update, selecting data as object collection and verifing data types without database access

The Movinator is a movie database application. It manages information about movies plus ratings assigned to movies by movie critics. Based on these ratings and user ratings, the application can also make movie recommendations.

XPN is relies on a non relational native XML database, where XML documents are stored in a compressed form and indices enables fast access to structure and content, thus enabling a fast evaluation of XQuery queries.

Master's Project: Object Database Spatial Extension. API based on SQL/MM Spatial. Full technical report is available in download section.

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.