Reference:
Thomas Beyhl, Dominique Blouin, Holger Giese, Leen Lambers, "On the Operationalization of Graph Queries with Generalized Discrimination Networks", Technical Report 106, Hasso Plattner Institute at the University of Potsdam, 2016.
Abstract:
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.
Links:
@TechReport{GieseHildebrandtLambers2010_1_2,
AUTHOR = {Beyhl, Thomas and Blouin, Dominique and Giese, Holger and Lambers, Leen},
TITLE = {{On the Operationalization of Graph Queries with Generalized Discrimination Networks}},
YEAR = {2016},
NUMBER = {106},
INSTITUTION = {Hasso Plattner Institute at the University of Potsdam},
URL = {https://publishup.uni-potsdam.de/opus4-ubp/files/9627/tbhpi106.pdf},
PDF = {uploads/pdf/GieseHildebrandtLambers2010_1_2.pdf},
OPTacc_pdf = {},
ABSTRACT = {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. }
}Copyright notice: This material is presented to ensure timely dissemination of
scholarly and technical work. Copyright and all rights therein are retained by
authors or by other copyright holders. All persons copying this information are
expected to adhere to the terms and constraints invoked by each author's copyright.
In most cases, these works may not be reposted without the explicit permission of
the copyright holder.
Powered by
bibtexbrowser