InfiniteGraph 1.1 released today with new indexing options and improved performance

InfiniteGraph 1.1, the distributed graph database, was released today with a new indexing framework that gives users greater performance on indexing, data ingest and lookups. The improvements will help developers more quickly develop and deploy with InfiniteGraph, to process larger graph datasets and collections.

How much faster is this version? We’ve seen 100x faster performance in some scenarios, such as processing multiple indexed fields with large index sizes.

The InfiniteGraph roadmap continues to emphasize performance and support for the requirements of developers and system architects who are leading enterprise and mission-critical government projects. In the six months since InfiniteGraph concluded its beta phase and released the first GA version of the product, the company and project team have been hard at work, gathering feedback and use cases from evaluators and developers. Much of this feedback has centered around the importance of indexing performance and the limitations of other indexing mechanisms.

The organizations currently looking at InfiniteGraph, are doing so because they understand how this technology could help them get to the real value they seek — the fast analysis of the relationships within their data” says Darren Wood, InfiniteGraph’s chief architect. “There are other graph products available today, but what is drawing developers and architects to InfiniteGraph, is our focus on performance and the requirements at the higher end of systems and use cases our company has a long history of solving.

InfiniteGraph’s graph processing strengths are well suited to many applications, including those in intelligence, internet systems and services around social media, location based networking and personalization, discovering networks of people that have business, influence or other value, analysis of financial transactions to detect and prevent fraud, and in adding new capabilities to enterprise business intelligence (BI) systems.

Future plans…

InfiniteGraph’s product roadmap and a series of releases planned for 2011 include additional data ingest improvements, and parallel ingest capabilities to make the most of InfiniteGraph’s distributed processing strengths. The product team is also working with the open source Blueprints project, to provide an interface to InfiniteGraph, and which will enable connections to several other tools that aid in graph access, query, analysis and manipulation. These include Gremlin (a graph traversal language), and Rexster (which would add a RESTful interface to InfiniteGraph). Faster graph processing, range querying and geo-hashed indexes are also slated for upcoming releases within this same timeframe. Additionally, options will be made available for developers to relax InfiniteGraph’s fully ACID compliant consistency model, to allow reduced contention and significantly speed performance as per their particular requirements.

The InfiniteGraph team has been very excited to be involved in, and help support, many of the developer community efforts and discussions around new, alternative and NOSQL technologies. We see companies and projects every day that simply don’t know they can actually solve their big data challenges. The more we can help spread the word, the better for them, and all the other technologies in this space.

A note for evaluators: We have flexible evaluation, licensing and usage options. Many of the more interesting use cases we’re seeing are coming from new ventures and startups with limited finances. Again, anyone interested may evaluate InfiniteGraph for free. If our product aligns with your long term technical requirements, let us know. We will work with you to determine the license and pricing options best suited to your short term needs, and long term success.

We also invite developers to join our free InfiniteGraph Startup Program. The Startup Program allows qualified new companies to use InfiniteGraph on any virtualized cloud platform or distributed environment of their choosing, without any cost for the technology, other than the various cloud providers’ standard usage fees. Our field engineers will work with you to create the machine image you need, on the cloud platform of your choice.

About InfiniteGraph

InfiniteGraph is a distributed, scalable graph database and developer API which enables large-scale graph processing, data analytics and discovery in systems and services developed around social networking, business intelligence, scientific research, national security and other advanced, mission critical requirements. InfiniteGraph offers a unique, graph database solution based on a highly-scalable, distributed data persistence technology that has been deployed in some of the most advanced and mission-critical enterprise and government systems in operation today. Organizations can use this solution to discover complex relationships in their data and develop applications with significant time-to-market advantages and technical cost savings. For more information, visit InfiniteGraph.com.

About Objectivity, Inc.

Objectivity, Inc. is a leader in distributed, scalable data management technology, and provides the core technology for InfiniteGraph. The company’s patented distributed data engine and persistent object store is the enabling technology within many markets, powering some of the most complex applications and mission critical systems used in commercial, enterprise, government and research organizations today. Objectivity, Inc. is headquartered in Sunnyvale, California, USA. Contact Objectivity, Inc. online at Objectivity.com, or call (408) 992-7100 for more information.

 

2 Trackbacks/Pingbacks

  1. […] This post was mentioned on Twitter by Peter Neubauer and Marko A. Rodriguez, Infinite Graph. Infinite Graph said: InfiniteGraph, the #NoSQL #graphdb, released v.1.1 today with new indexing options and improved performance http://ht.ly/3QD4t […]

  2. […] InfiniteGraph 1.1 Release! […]

Post a Comment

Required fields are marked *
*
*

%d bloggers like this: