MOD

Oh dear, there's that word again - "semantics!" Isn't that what doomed that Semantic Web thing and led to knowledge graphs instead? In fact, many of the same problems, and particularly problems with interoperability, arise again for KGs, and thus we ...

As AI technologies become mature in natural language processing, speech recognition and computer vision, "intelligent" user interfaces emerge to handle complex and diverse tasks that require human-like knowledge and reasoning capability. In Part 1, I ...

This paper demonstrates ShaderNet --- our graph analytics framework with shader codes, which are machine-level codes and are important for GPU designers to tune the hardware, e.g., adjusting clock speeds and voltages. Due to a wide spectrum of use-cases ...

We establish a translation between a formalism for dynamic programming over hypergraphs and the computation of semiring-based provenance for Datalog programs. The benefit of this translation is a new method for computing the provenance of Datalog ...

This paper focuses on subgraph queries where constraints are present in the neighborhood of the explored subgraphs. We describe anti-vertex, a declarative construct that indicates absence of a vertex, i.e., the resulting subgraph should not have a ...

In this paper, we present DynaGraph, a system that supports dynamic Graph Neural Networks (GNNs) efficiently. Based on the observation that existing proposals for dynamic GNN architectures combine techniques for structural and temporal information ...

Dynamic graph processing, execution on vertex-edge graphs that change over time, is quickly becoming a key computing need of the twenty-first century. Dynamic graph algorithms unlock real-time optimization solutions and a wide range of data-mining ...

The interest in the ability of processing data that has an underlying graph structure has grown in the recent past. This has led to the development of many distributed graph processing systems. However, due to rapidly growing amount of data, e.g., web ...

Finding k-cores in graphs is a valuable and effective strategy for extracting dense regions of otherwise sparse graphs. We focus on the important problem of maintaining cores on rapidly changing dynamic graphs, where batches of edge changes need to be ...

Today's space of graph database solutions is characterized by two main technology stacks that have evolved separate from one another: on one hand, there are systems that focus on supporting the RDF family of standards; on the other hand, there is the ...

In this short position paper, we argue that there is a need for a unifying data model that can support popular graph formats such as RDF, RDF^* and property graphs, while at the same time being powerful enough to naturally store information from complex ...