Beyhl, Thomas's Books

On the operationalization of graph queries with generalized discrimination networks

By: Beyhl, Thomas,Blouin, Dominique,Giese, Holger,Lambers, Leen

Write a review Read reviews Take a Quiz Solve Book Puzzle

On the operationalization of graph queries with generalized discrimination networks

By: Beyhl, Thomas,Blouin, Dominique,Giese, Holger,Lambers, Leen

Graph queries have lately gained increased interest due to application areas such as social networks, biological networks, or model queries. For the relational database case the relational algebra and generalized discrimination networks have been studied to find appropriate decompositions into subqueries and ordering of these subqueries for query evaluation or incremental updates of query results. For graph database queries however there is no formal underpinning yet that allows us to find such suitable operationalizations. Consequently, we suggest a simple operational concept for the decomposition of arbitrary complex queries into simpler subqueries and the ordering of these subqueries in form of generalized discrimination networks for graph queries inspired by the relational case. The approach employs graph transformation rules for the nodes of the network and thus we can employ the underlying theory. We further show that the proposed generalized discrimination networks have the same expressive power as nested graph conditions.

Average ratings

N/A

Write a review

Solve jigsaw puzzle

Age

Page Count

Publisher

Universitätsverlag Potsdam

Published Date

ISBN 10

3869563729

ISBN 13

9783869563725

Efficient and scalable graph view maintenance for deductive graph databases based on generalized discrimination networks

By: Beyhl, Thomas,Giese, Holger

Write a review Read reviews Take a Quiz Solve Book Puzzle

Efficient and scalable graph view maintenance for deductive graph databases based on generalized discrimination networks

By: Beyhl, Thomas,Giese, Holger

Graph databases provide a natural way of storing and querying graph data. In contrast to relational databases, queries over graph databases enable to refer directly to the graph structure of such graph data. For example, graph pattern matching can be employed to formulate queries over graph data. However, as for relational databases running complex queries can be very time-consuming and ruin the interactivity with the database. One possible approach to deal with this performance issue is to employ database views that consist of pre-computed answers to common and often stated queries. But to ensure that database views yield consistent query results in comparison with the data from which they are derived, these database views must be updated before queries make use of these database views. Such a maintenance of database views must be performed efficiently, otherwise the effort to create and maintain views may not pay off in comparison to processing the queries directly on the data from which the database views are derived. At the time of writing, graph databases do not support database views and are limited to graph indexes that index nodes and edges of the graph data for fast query evaluation, but do not enable to maintain pre-computed answers of complex queries over graph data. Moreover, the maintenance of database views in graph databases becomes even more challenging when negation and recursion have to be supported as in deductive relational databases. In this technical report, we present an approach for the efficient and scalable incremental graph view maintenance for deductive graph databases. The main concept of our approach is a generalized discrimination network that enables to model nested graph conditions including negative application conditions and recursion, which specify the content of graph views derived from graph data stored by graph databases. The discrimination network enables to automatically derive generic maintenance rules using graph transformations for maintaining graph views in case the graph data from which the graph views are derived change. We evaluate our approach in terms of a case study using multiple data sets derived from open source projects.

Average ratings

N/A

Write a review

Solve jigsaw puzzle

Age

Page Count

154

Publisher

Universitätsverlag Potsdam

Published Date

ISBN 10

3869563397

ISBN 13

9783869563398

On the operationalization of graph queries with generalized discrimination networks

By: Beyhl, Thomas,Blouin, Dominique,Giese, Holger,Lambers, Leen

Write a review Read reviews Take a Quiz Solve Book Puzzle

On the operationalization of graph queries with generalized discrimination networks

By: Beyhl, Thomas,Blouin, Dominique,Giese, Holger,Lambers, Leen

Average ratings

N/A

Write a review

Solve jigsaw puzzle

Age

Page Count

Publisher

Universitätsverlag Potsdam

Published Date

ISBN 10

3869563729

ISBN 13

9783869563725

Book's by Beyhl, Thomas

On the operationalization of graph queries with generalized discrimination networks

On the operationalization of graph queries with generalized discrimination networks

Efficient and scalable graph view maintenance for deductive graph databases based on generalized discrimination networks

Efficient and scalable graph view maintenance for deductive graph databases based on generalized discrimination networks

On the operationalization of graph queries with generalized discrimination networks

On the operationalization of graph queries with generalized discrimination networks

Username

Password

Username

Password

Password again

Birthday

Email