8th TUC Meeting – Yinglong Xia (Huawei), Big Graph Analytics Engine

  • Posted on: 3 February 2017
  • By: Adrian Diaz

Yinlong started his talk with an introduction of his new position at Huawei, what is the company doing and more specifically how is it involved with Big Data Research and graphs. He also explained that his research center is currently working on Big Data Analytics and Management from 4 sides: Natural Language Processing, Graph analyrics, Machine Learning and Deep Learning. His team at the same time, focuses on 4 market segments that include financial graph analytics, consumer data gathered from smartphones and other portable devices, telecommunications and cloud technology.

8th TUC Meeting – George Fletcher (TU Eindhoven), gMark: Schema-driven data and workload generation for graph databases

  • Posted on: 31 January 2017
  • By: Adrian Diaz

George Fletcher, Associate Professor at the Eindhoven University of Technology, presented gMark, an open-source framework for generating synthetic graph instances and workloads. The main focus of gMark has been to tailor different graph data management scenarios, often driven by query workloads. Such as multi-query optimization, workload-driven graph database physical design or mapping discovery and query rewriting data integration systems.

8th TUC Meeting – Marcus Paradies (SAP) Social Network Benchmark, Business Intelligence Workload

  • Posted on: 27 January 2017
  • By: Adrian Diaz

Marcus Paradies, Software developer at SAP extended the talk Arnau Prat gave about the SNB, in this case about the Intelligence workload. In contrast with the 17+4 queries the Interactive workload has, the Business Intelligence (BI) workload consists on 24 queries that can be seen as OLAP-style against the OLTP-style of the Interactive one. The BI focuses on analytic queries and they touch the whole graph.

8th TUC Meeting - Sergey Edunov (Facebook). Generating realistic trillion-edge graphs.

  • Posted on: 24 January 2017
  • By: Adrian Diaz

Sergey Edunov, Software Engineer at Facebook gave a great talk on how and why his company generating large-scale social graphs. The underlying reasons to start such an ambitious project are capacity planning to make sure that their system will be able to handle a graph that keeps growing year after year and fair evaluation of their system against the ones being implemented by other companies.

8th TUC Meeting - Weining Qian (ECNU). On Statistical Characteristics of Real-Life Knowledge Graphs.

  • Posted on: 23 January 2017
  • By: Adrian Diaz

Weining Qian, professor at East China Normal University presented his talk on Statistical Characteristics of Real-Life Knowledge graphs during the 8th TUC Meeting held at Oracle’s facilities in Redwood City, California.

Qian explained that term knowledge graph was introduced by Google in 2012 and it has been an evolution of the semantic web. Professor Qian then introduced the main question of his talk: how can we efficiently manage knowledge graphs? Are the existing benchmarks sufficient to test them since most of these benchmarks focus only on Social Networks?

8th TUC Meeting - Peter Boncz (CWI). Query Language Task Force status

  • Posted on: 19 January 2017
  • By: Adrian Diaz

Peter Boncz, Research Scientist at the Centrum Wiskunde & Informatica in the Netherlands, talked about the updates on the Graph Query Language Task Force after being alive for a year. This Task Force was created to answer an issue detected during the benchmark meetings, all the workload is created in English text because there is no common graph query language.

8th TUC Meeting - Lijun Chang (University of New South Wales). Efficient Subgraph Matching by Postponing Cartesian Products.

  • Posted on: 11 January 2017
  • By: Adrian Diaz

Lijun Chang, DECRA Fellow at the University of New South Wales talked about how to make subgraph matching more efficient thanks to postponing Cartesian products. They key problem he explained was the extraction of subgraph isomorphic embeddings. The applications of this process are wide enough to cover protein interaction research, social network analysis and even chemical compound investigation. The testing of subgraph isomorphism is an NP-complete type of problem however, his team is focusing on enumerating all subgraph embeddings which, he explains, is even harder.

8th TUC Meeting - Jerven Bolleman (SIB Swiss Institute of Bioinformatics/UniProt consortium). UniProt: challenges of a public SPARQL endpoint.

  • Posted on: 3 January 2017
  • By: Adrian Diaz

Jerven Bolleman, Lead Software Developer at Swiss-Prot Group, explained why are they offering a free SPARQL and RDF endpoint for the world to use and why is it hard to optimize it. The data biologists use tends to be extremely ambiguous and dirty, additionally, scientists are always trying to find new questions to ask, thus why the difficulty regarding the optimization of UniProt, they wouldn’t be offering the right service to their users by optimizing the query patterns. Furthermore, since UniProt is publicly funded, all the data needs to be public.

8th TUC Meeting - Martin Zand University of Rochester Clinical and Translational Science Institute). Graphing Healthcare Networks: Data, Analytics and Use Cases

  • Posted on: 27 December 2016
  • By: Adrian Diaz

Martin Zand, Professor of Medicine and Public Health Sciences at the Rochester enter for Health Informatics, switched the focus of the presentations talking as a user of graph databases. Zand pinpointed the relevance of using graph in healthcare comparing 3 characteristics of healthcare to their counterpart with graphs:

  • Healthcare is delivered by networks.
  • Patients traverse those networks.
  • The topology of the networks influences outcomes.

The talk of Dr. Zand was structured around the presentation of 3 uses cases:

Pages