Data Structures

Android GraphView is used to display data in graph structures.

ELKI is an open source (AGPLv3) data mining software written in Java. The focus of ELKI is research in algorithms, with an emphasis on unsupervised methods in cluster analysis and outlier detection. In order to achieve high performance and scalability, ELKI offers many data index structures such as the R*-tree that can provide major performance gains. ELKI is designed to be easy to extend for researchers and students in this domain, and welcomes contributions in particular of new methods. ELKI aims at providing a large collection of highly parameterizable algorithms, in order to allow easy and fair evaluation and benchmarking of algorithms.

Hierarchy is meant to provide a high performance basic hierarchy to associate data with, no data is stored in the hierarchy itself, it is simply there to allow you to maintain the hierarchical structure and to provide methods to manipulate it and query it

Translates COBOL structures to a java model. Converts Mainframe data to Java objects.

A simple configuration library for Java applications that can handle a variety of formats and provides a node-based data structure able to handle a wide variety of configuration schemas

Data structure which allows accurate estimation of quantiles and related rank statistics

Graal is a java toolkit dedicated to ontological query answering in the framework of existential rules. We consider knowledge bases composed of data and an ontology expressed by existential rules. The main features of Graal are the following: a basic layer that provides generic interfaces to store and query various kinds of data, forward chaining and query rewriting algorithms, structural analysis of decidability properties of a rule set, a textual format and its parser, and import of OWL 2 files. We describe in more detail the query rewriting algorithms, which rely on original techniques, and report some experiments.

Provides various facilities required by the 2P-Kt project, including but not limited to caching, casting, lazy data structures, deques, tags, etc.

Provides various facilities required by the 2P-Kt project, including but not limited to caching, casting, lazy data structures, deques, tags, etc.

Provides various facilities required by the 2P-Kt project, including but not limited to caching, casting, lazy data structures, deques, tags, etc.

Translates COBOL structures to a java model. Converts Mainframe data to Java objects.

Kotlin Optimized Data Structures

Library to generate SemanticDB from Scalac 2.x internal data structures

数据结构相关支持库

Structured data access for Cassandra by hierarchical paths with support for both CQL3 and Thrift

Data structures for Java

SchemaOrg4J is a library for Java which provides a properly typed translation of schema.org structured data to Java beans.

Kotlin Optimized Data Structures

Kotlin Optimized Data Structures

Semargl is a modular framework for crawling linked data from structured documents. The main goal of project is to provide lightweight and performant tool without excess dependencies.

Core data structures

A library for common data structures.

A tool to extract text from documents and generate structured data

fastutil extends the Java Collections Framework by providing type-specific maps, sets, lists, and queues with a small memory footprint and fast operations; it provides also big (64-bit) arrays, sets, and lists, sorting algorithms, fast, practical I/O classes for binary and text files, and facilities for memory mapping large files. This jar (fastutil-core.jar) contains data structures based on integers, longs, doubles, and objects, only; fastutil.jar contains all classes. If you have both jars in your dependencies, this jar should be excluded.

The Process Control System's data handling package. This package contains data structures and readers and writers to write an input file format similar to HDF, as represented in XML.

Semargl is a modular framework for crawling linked data from structured documents. The main goal of project is to provide lightweight and performant tool without excess dependencies.

This project builds on top of the CAS file management component and exposes its underlying data delivery capabilities using the OODT ProductServer component. All-in-all, this project contributes an OODT LargeProductHandler component, that can be used to deliver and format a CAS product structure into an OODT XML Query Result Set.

ELKI is an open source (AGPLv3) data mining software written in Java. The focus of ELKI is research in algorithms, with an emphasis on unsupervised methods in cluster analysis and outlier detection. In order to achieve high performance and scalability, ELKI offers many data index structures such as the R*-tree that can provide major performance gains. ELKI is designed to be easy to extend for researchers and students in this domain, and welcomes contributions in particular of new methods. ELKI aims at providing a large collection of highly parameterizable algorithms, in order to allow easy and fair evaluation and benchmarking of algorithms.

SPL(Structured Process Language) A programming language specially for structured data computing.

BioJava is an open-source project dedicated to providing a Java framework for processing biological data. It provides analytical and statistical routines, parsers for common file formats and allows the manipulation of sequences and 3D structures. The goal of the biojava project is to facilitate rapid application development for bioinformatics.

BioJava is an open-source project dedicated to providing a Java framework for processing biological data. It provides analytical and statistical routines, parsers for common file formats and allows the manipulation of sequences and 3D structures. The goal of the biojava project is to facilitate rapid application development for bioinformatics.

My solutions to some of the algorithm and data structure questions in Java

Library to generate SemanticDB from Scalac 2.x internal data structures

Accent4J is a suite of libraries, helpers and data structures that make Java programming idioms more fluent.

A Scala implementation of the versatile purely functional data structure of the same name.

Graal is a java toolkit dedicated to ontological query answering in the framework of existential rules. We consider knowledge bases composed of data and an ontology expressed by existential rules. The main features of Graal are the following: a basic layer that provides generic interfaces to store and query various kinds of data, forward chaining and query rewriting algorithms, structural analysis of decidability properties of a rule set, a textual format and its parser, and import of OWL 2 files. We describe in more detail the query rewriting algorithms, which rely on original techniques, and report some experiments.

Sirix is a temporal storage system effectively and efficiently storing snapshots of time varying (currently semi-structured) data taking full advantage of flash based drives as for instance SSDs. We not only provide several ways of navigating the tree-structure of a single revision, we also support navigation in time. Furthermore we provide a novel storage technique called sliding snapshot to circumvent intermitant full dump snapshots to fast track their in-memory reconstruction and thus we avoiding write peaks and having to read long chains of page fragments/increments/deltas. Sirix uses copy-on-write (COW) as well as an append-only storage making it an ideal candidate for flash based drives while not dropping support for erstwhile disks.

Graal is a java toolkit dedicated to ontological query answering in the framework of existential rules. We consider knowledge bases composed of data and an ontology expressed by existential rules. The main features of Graal are the following: a basic layer that provides generic interfaces to store and query various kinds of data, forward chaining and query rewriting algorithms, structural analysis of decidability properties of a rule set, a textual format and its parser, and import of OWL 2 files. We describe in more detail the query rewriting algorithms, which rely on original techniques, and report some experiments.

Core Protocol Buffers library. Protocol Buffers are a way of encoding structured data in an efficient yet extensible format.

Graal is a java toolkit dedicated to ontological query answering in the framework of existential rules. We consider knowledge bases composed of data and an ontology expressed by existential rules. The main features of Graal are the following: a basic layer that provides generic interfaces to store and query various kinds of data, forward chaining and query rewriting algorithms, structural analysis of decidability properties of a rule set, a textual format and its parser, and import of OWL 2 files. We describe in more detail the query rewriting algorithms, which rely on original techniques, and report some experiments.

Graal is a java toolkit dedicated to ontological query answering in the framework of existential rules. We consider knowledge bases composed of data and an ontology expressed by existential rules. The main features of Graal are the following: a basic layer that provides generic interfaces to store and query various kinds of data, forward chaining and query rewriting algorithms, structural analysis of decidability properties of a rule set, a textual format and its parser, and import of OWL 2 files. We describe in more detail the query rewriting algorithms, which rely on original techniques, and report some experiments.

Graal is a java toolkit dedicated to ontological query answering in the framework of existential rules. We consider knowledge bases composed of data and an ontology expressed by existential rules. The main features of Graal are the following: a basic layer that provides generic interfaces to store and query various kinds of data, forward chaining and query rewriting algorithms, structural analysis of decidability properties of a rule set, a textual format and its parser, and import of OWL 2 files. We describe in more detail the query rewriting algorithms, which rely on original techniques, and report some experiments.

Structured information from unstructured data

Structured information from unstructured data

Structured information from unstructured data

Structured information from unstructured data

Structured information from unstructured data

Structured information from unstructured data

Structured information from unstructured data

Structured information from unstructured data