Graph Systems and Algorithms

Weaviate OSS Smart Graph

feature updates, demo and use cases
AW1.121
Bob van Luijt
Weaviate is an open-source smart graph that aims to allow anyone, anywhere, any time to create their own semantic search engines, knowledge graphs or knowledge networks. Weaviate is RESTful and GraphQL API based and built on top of a semantic vector storage mechanism called the contextionary. Because all data is stored in the vector space, Weaviate is ideal for; - Semantically search through the knowledge graph. - Automatically classify entities in the graph. - Create easy to use knowledge mappings. Because the use of formal ontologies are optional, Weaviate can be used to create a P2P knowledge network which we want to present during this conference. This is a follow up after the initial design was shared during last year's FOSDEM.
Problem Creating a knowledge graph can be a complex endeavor, let alone the integration of semantic search models. Bain & Company research under US enterprise CTO's shows that 59% of them believe they lack the capabilities to generate meaningful business insights from their data, and 85% said it would require substantial investments to improve their data platforms. Solution Weaviate aims anyone to create large, enterprise-scale knowledge graphs as straight forward as possible. Weaviate's feature set allows anyone to; - Semantically search through the knowledge graph. - Automatically classify entities in the knowledge graph. - Create easy to use knowledge mappings. Weaviate's Contextionary Weavite's Contextionary is the semantic vector storage mechanism that stores data -unlike traditional storage mechanisms- based on its semantic meaning. For example, if someone stores information about a company with the name Apple, this data object would be found closely related to concepts like the iPhone. Because of the algorithmic use (as opposed to retraining) of the pre-trained machine learning model, Weaviate is able to learn new concepts fast and near-realtime. This allows the user to update and manipulate the knowledge graph directly. Demo & Use cases During the session, we want to show a few -recent- use cases to demo how Weaviate can be used. The demo will include; querying; semantic querying; adding concepts; going from an ontology to a schema; and more. Knowledge network Because of Weaviate's contextionary, a formal ontology is optional (e.g., "a company with the name Netflix" is semantically similar to "a business with the identifier Netflix Inc.") this allows multiple Weaviate to connect and communicate over a peer to peer (P2P) network to exchange knowledge. Aka, the knowledge network. During the session, we want to demonstrate the first prototype of this network. more information more information can be found on our website: https://www.semi.technology/documentation/weaviate/current/

Additional information

Type devroom

More sessions

2/1/20
Graph Systems and Algorithms
Vincent Cave
AW1.121
Python has proven to be a popular choice for data scientists in the domain of graph analytics. The multitude of freely available frameworks and python packages allow to develop applications quickly through ease of expressibility and reuse of code. With petabytes of data generated everyday and an ever evolving landscape of hardware solutions, we observe a graph processing framework should expose the following characteristics: ease of use, scalability, interoperability across data formats, and ...
2/1/20
Graph Systems and Algorithms
Sylvain Baubeau
AW1.121
Graffiti is the graph engine of Skydive - an open source networking analysis tool. Graffiti was created from scratch to provide the features required by Skydive : distributed, replicated, store the whole history of the graph, allow subcribing to events on the graph using WebSocket and visualization.
2/1/20
Graph Systems and Algorithms
Max Kießling
AW1.121
Graph algorithms play an increasingly important role in real-world applications. The Neo4j Graph Algorithms library contains a set of ~50 graph algorithms covering a lot of different problem domains. In our talk, we’ll present the architecture of the library and demonstrate the different execution phases using a real world example.
2/1/20
Graph Systems and Algorithms
Muhammad Osama
AW1.121
Gunrock is a CUDA library for graph-processing designed specifically for the GPU. It uses a high-level, bulk-synchronous, data-centric abstraction focused on operations on vertex or edge frontiers. Gunrock achieves a balance between performance and expressiveness by coupling high-performance GPU computing primitives and optimization strategies, particularly in the area of fine-grained load balancing, with a high-level programming model that allows programmers to quickly develop new graph ...
2/1/20
Graph Systems and Algorithms
AW1.121
Graph databases and applications have attracted much attention in the past few years due to the efficiency with which they can represent big data, connecting different layers of data structures and allowing analysis while preserving contextual relationships. This has resulted in a fast-growing community that has been developing various database and algorithmic innovations in this area, many of which will be gathering together in this conference. We joined this field as computer architecture ...
2/1/20
Graph Systems and Algorithms
Stijn Eyerman
AW1.121
Large scale graph analytics is essential to analyze relationships in big data sets. Thereto, the DARPA HIVE program targets a leap in power efficient graph analytics. In response to this program, Intel proposes the Programmable Unified Memory Architecture (PUMA). Based on graph workload analysis insights, PUMA consists of many multi-threaded cores, fine-grained memory and network accesses, a globally shared address space and powerful offload engines. In this talk, we will describe the PUMA ...
2/1/20
Graph Systems and Algorithms
AW1.121
In this talk we will introduce enhancements to the Cypher graph query language, enabling queries spanning multiple graphs, intended for use in sharding and federation scenarios. We will also present our experience with sharding the LDBC Social Network Benchmark dataset.