Julia library that implements a combinator-based embedded query language.
Switch branches/tags
Nothing to show
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Failed to load latest commit information.
doc
src
test
.codecov.yml
.gitignore
.travis.yml
LICENSE.md
Project.toml
README.md
REQUIRE
appveyor.yml

README.md

DataKnots.jl

DataKnots is a Julia library for representing and querying data, including nested and circular structures. DataKnots provides integration and analytics across CSV, JSON, XML and SQL data sources with an extensible, practical and coherent algebra of query combinators.

Linux/OSX Build Status Windows Build Status Code Coverage Status Open Issues Latest Documentation MIT License

DataKnots is designed to let data analysts and other accidental programmers query and analyze complex structured data.

DataKnots implements an algebraic query interface of Query Combinators. This algebra’s elements, or queries, represent relationships among class entities and data types. This algebra’s operations, or combinators, are applied to construct query expressions.

There are significant advantages of DataKnots over the state of the art.

  • DataKnots is a practical alternative to SQL with a declarative syntax; this makes it suitable for use by domain experts.

  • DataKnots' data model handles nested and recursive structures (unlike DataFrames or SQL); this makes it suitable for working with CSV, JSON, XML, and SQL databases.

  • DataKnots has a formal semantic model based upon monadic composition; this makes it easy to reason about the structure and interpretation of queries.

  • DataKnots is a combinator algebra (like XPath but unlike LINQ or SQL); this makes it easier to assemble queries dynamically.

  • DataKnots is fully extensible with Julia; this makes it possible to specialize it into various domain specific query languages.