Network devices have always been considered as configurable black boxes until the
emergence of software-defined networking (SDN). SDN enables the networks to be …

The limitations of traditional databases, in particular the relational model, to cover the
requirements of current applications has lead the development of new database …

Query languages for graph databases started to be investigated some 25 years ago. With
much current data, such as linked data on the Web and social network data, being graph …

Graph pattern matching is commonly used in a variety of emerging applications such as
social network analysis. These applications highlight the need for studying the following two …

Graph pattern matching is fundamental to social network analysis. Traditional techniques
are subgraph isomorphism and graph simulation. However, these notions often impose too …

Graph pattern matching is often defined in terms of subgraph isomorphism, an NP-complete
problem. To lower its complexity, various extensions of graph simulation have been …

Graph pattern matching is finding all matches in a data graph for a given pattern graph and
is often defined in terms of subgraph isomorphism, an np-complete problem. To lower its …

This article studies discovery of Graph Functional Dependencies (GFDs), a class of
functional dependencies defined on graphs. We investigate the fixed-parameter tractability …

Graph data management concerns the research and development of powerful technologies
for storing, processing and analyzing large volumes of graph data. This chapter presents an …

A graph is a fundamental and general data structure underlying all data applications. Many
applications today call for the management and query capabilities directly on graphs. Real …