You are here:  Home  >  Education Resources For Use & Management of Data  >  Data Daily | Data News  >  Current Article

Cambridge Semantics Shatters Previous Record of Loading and Querying ‘Trillion Triples’ by 100X

By   /  December 9, 2016  /  No Comments

csby Angela Guess

According to a recent press release, “Cambridge Semantics, the leading provider of graph-based Smart Data management and exploratory analytic solutions, today announced that its Anzo Graph Query Engine™ completed a load and query of one trillion triples as a Google Cloud Partner on the Google Cloud Platform in just under two hours, 100 times faster than the previous solution running the Lehigh University Benchmark (LUBM) at the same data scale. The LUBM is an industry standard that evaluates the query performance of semantic web repositories over a large data set. A ‘triple’ consists of a subject, predicate and an object. In the LUBM test conducted on the Google Cloud Platform on Oct. 31, 2016, Cambridge Semantics’ Anzo Graph Query Engine was able to load and query 1.065 trillion triples in 1.98 hours, surpassing the previous LUBM benchmark of 220 hours set by Oracle in September 2014.”

The release goes on, “To place the data results in context, examples of one trillion triples includes: six months of worldwide Google searches, 133 facts for each of the 7 billion people on earth, 100 million facts describing all the details of each of 10,000 clinical trial studies, 156 facts about each device connected to the internet. ‘A key challenge for semantic-based analytics has been enabling a load and query performance on very large data sets from a data lake in timeframes that offer an acceptable user experience,’ said Barry Zane, vice president of engineering at Cambridge Semantics. ‘With the LUBM results, it’s been validated that a loading and query process that once took over a month’s worth of business hours can now be completed in less than two hours’.”

Read more at PRWeb.

Photo credit: Cambridge Semantics

You might also like...

Data Science in 90 Seconds: Support Vector Machines

Read More →