Search Results for "data visualization, research"

BadgerDB is an embeddable, persistent and fast key-value (KV) database written in pure Go. It is the underlying database for Dgraph, a fast, distributed graph database. It's meant to be a performant alternative to non-Go-based key-value stores like RocksDB. Badger is stable and is being used to serve data sets worth hundreds of terabytes. Badger supports concurrent ACID transactions with serializable snapshot isolation (SSI) guarantees. A Jepsen-style bank test runs nightly for 8h, with...

The definition of the metamodel for TRAK (defines allowed AD elements and relationships i.e. tuples/ triples for the TRAK viewpoints and views). TRAK is a general systems-thinkers'/system engineering enterprise architecture framework. It is simple, user-friendly, pragmatic and not limited to IT. 100% triple-centric and semantically-sound. Forms basis for RDF + OWL ontology description - see https://trakmetamodel.sourceforge.io/vocab/TRAK_metamodel.html. Each TRAK metamodel element now has...

The graph database built for super large-scale graphs with milliseconds of latency. Optimized SUBGRAPH and FIND PATH for better performance. Optimized query paths to reduce redundant paths and time complexity. Optimized the method to get properties for better performance of MATCH statements. Nebula Graph adopts the Apache 2.0 license, one of the most permissive free software licenses in the world. Free as in freedom, because, under the Apache 2.0 license, you can use, copy, modify and...

The architecture viewpoints (specifications for architecture views iaw ISO 42010) for TRAK. TRAK is a general systems-thinkers'/system engineering enterprise architecture framework. It is simple, user-friendly, pragmatic and not limited to IT. 100% triple-centric and semantically-sound. Defines a total of 24 viewpoints. The ones needed are selected by taking the task sponsor's concerns and matching them to the typical concerns that each TRAK viewpoint addresses. The triples that address...

...For example, using an underlying oodb, a OneToMany and ManyToOne relationships can be implemented allowing quick and robust hierarchies to be built (a subset of a graph). The system also includes a Big Data implementation, other analytics and visualization. The current invokation is based on a Versant Db. Examples for use can be found in CrispI-Examples.