Berkeley DB Java Edition Oracle Berkeley DB Java Edition is an open source, embeddable, transactional storage engine written entirely in Java. It takes full advantage of the Java environment to simplify development and deployment. The architecture of Oracle Berkeley DB Java Edition supports very high performance and concurrency for both read-intensive and write-intensive workloads. Depending on your needs choose between Berkeley DB Java Edition's Direct Persistence Layer (DPL), Persistent Collections API, or simply store key/value pairs of arbitrary data. If your application requires something outside the bounds of relational databases then Berkeley DB Java Edition is likely to be the best choice.
graph_survey - Sage Wiki Introduction The SAGE Graph Theory Project aims to implement Graph objects and algorithms in SAGE. The main people working on this project are Emily Kirkman and Robert Miller. We have attempted to make a complete list of existing graph theory software. We posted functionality lists and some algorithm/construction summaries. We are very interested in feedback or last-minute additions, as we are ready to begin benchmarking our findings.
Graph database Graph databases employ nodes, properties, and edges. List of Graph Database The following is a list of several well-known graph databases: Features Graph database Structure Graph databases are based on graph theory. Graph databases employ nodes, properties, and edges. Graph database Nodes represent entities such as people, businesses, accounts, or any other item you might want to keep track of. Properties are pertinent information that relate to nodes. NoSQL Database Technical Overview The Oracle NoSQL Database is a distributed key-value database. It is designed to provide highly reliable, scalable and available data storage across a configurable set of systems that function as storage nodes. Data is stored as key-value pairs, which are written to particular storage node(s), based on the hashed value of the primary key. Storage nodes are replicated to ensure high availability, rapid failover in the event of a node failure and optimal load balancing of queries.
Representing time dependent graphs in Neo4j · SocioPatterns/neo4j-dynagraph Wiki Background Large-scale data collection efforts using wearable sensors to mine for proximity of individuals (for example, the SocioPatterns project) produce time-varying social graphs, where nodes are individuals, edges represent proximity/contact relations of individuals, and the proximity graph changes over time. Both nodes and edges can have rich attributes. Data formats for exchanging the time-dependent graphs are available, see for instance the GEXF format. Efficiently mining large time-dependent graphs, however, requires a database and a representation that can support complex topological queries, temporal queries, multi-scale temporal indexing and aggregation, and more. A growing research community working on temporal networks may benefit from sound and efficient techniques to represent, store and query dynamic graphs.
Sage - Tour Sage is built out of nearly 100 open-source packages and features a unified interface. Sage can be used to study elementary and advanced, pure and applied mathematics. This includes a huge range of mathematics, including basic algebra, calculus, elementary to very advanced number theory, cryptography, numerical computation, commutative algebra, group theory, combinatorics, graph theory, exact linear algebra and much more. It combines various software packages and seamlessly integrates their functionality into a common experience. Blazegraph GPU Mapgraph is SYSTAP’s disruptive new technology to exploit the main memory bandwidth advantages of GPUs. The original work was (partially) funded by the DARPA XDATA program under AFRLContract #FA8750-13-C-0002 and the Defense Advanced Research Projects Agency (DARPA) under Contract No. D14PC00029. The early work was co-developed with the University of Utah SCI Institute and has its pedigree in the UINTAH software running on over 750M cores on the TITAN Super Computer.
redis_graph 1.0 Package Index > redis_graph > 1.0 Not Logged In Status Nothing to report redis_graph 1.0 Downloads ↓ NoSQL Pain? Learn How to Read/write Scale Without a Complete Re-write Lately I've been reading more cases were different people have started to realize the limitations of the NoSQL promise to database scalability. Note the references below: Take MongoDB for example. It's damn fast, but it doesn't really know how to save data reliably to disk. I've had it set up in a replica pair to mitigate that risk.
Blog - Using Datomic as a Graph Database Datomic is a database that changes the way that you think about databases. It also happens to be effective at modeling graph data and was a great fit for performing graph traversal in a recent project I built. I started out building kevinbacon.us using Neo4j, a popular open-source graph database. It worked very well for actors that were a few hops away, but finding paths between actors with more than 5 hops proved problematic. The cypher query language gave me little visibility into the graph algorithms actually being executed. I wanted more. Home - jHepWork Freedom to choose a programming language. Freedom to choose an operating system. Freedom to share your code. Enjoy the freedom of SCaVis. Supported programming languages SCaVis can be used with several scripting languages for the Java platform, such as BeanShell, Jython (the Python programming language), Groovy and JRuby (Ruby programming language).