A visual language for querying and updating graphs

We show that QGPs naturally express universal and existential quantification, numeric and ratio aggregates, as well as negation.

Better still, the increased expressivity does not come with a much higher price.

The primary emphasis of this release has been additional enterprise functionality, efficiency and overall scalability.

Please refer to the release notes for a complete list of enhancements and improvements.

Allegro Graph supports SPARQL, RDFS , and Prolog reasoning from numerous client applications.

The Allegro Graph product line has always pushed the performance envelope starting with version 1.0 in 2004, which was the first product to claim 1 billion triples loaded and indexed using standard x86 64-bit hardware.

Allegro Graph, a purpose built (not a modified RDBMS), No SQL Graph Database continued to drive innovation in the marketplace with the 2008 Sem Tech conference example of 10 billion quads loaded on Amazon’s EC2 service.

We show that quantified matching, i.e., graph pattern matching with QGPs, remains NP-complete in the absence of negation, and is DP-complete for general QGPs.

We show how quantified matching can be conducted by incorporating quantifier checking into conventional subgraph isomorphism methods.

We then present an application using a graph database to extract social networks.

You must have an account to comment. Please register or login here!