iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://doi.org/10.4204/EPTCS.231.5
[1612.01641] Incremental View Maintenance for Deductive Graph Databases Using Generalized Discrimination Networks
Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Computer Science > Databases

arXiv:1612.01641 (cs)
[Submitted on 6 Dec 2016]

Title:Incremental View Maintenance for Deductive Graph Databases Using Generalized Discrimination Networks

Authors:Thomas Beyhl (Hasso Plattner Institute at the University of Potsdam), Holger Giese (Hasso Plattner Institute at the University of Potsdam)
View PDF
Abstract:Nowadays, graph databases are employed when relationships between entities are in the scope of database queries to avoid performance-critical join operations of relational databases. Graph queries are used to query and modify graphs stored in graph databases. Graph queries employ graph pattern matching that is NP-complete for subgraph isomorphism. Graph database views can be employed that keep ready answers in terms of precalculated graph pattern matches for often stated and complex graph queries to increase query performance. However, such graph database views must be kept consistent with the graphs stored in the graph database.
In this paper, we describe how to use incremental graph pattern matching as technique for maintaining graph database views. We present an incremental maintenance algorithm for graph database views, which works for imperatively and declaratively specified graph queries. The evaluation shows that our maintenance algorithm scales when the number of nodes and edges stored in the graph database increases. Furthermore, our evaluation shows that our approach can outperform existing approaches for the incremental maintenance of graph query results.
Comments: In Proceedings GaM 2016, arXiv:1612.01053
Subjects: Databases (cs.DB)
Cite as: arXiv:1612.01641 [cs.DB]
  (or arXiv:1612.01641v1 [cs.DB] for this version)
  https://doi.org/10.48550/arXiv.1612.01641
Journal reference: EPTCS 231, 2016, pp. 57-71
Related DOI: https://doi.org/10.4204/EPTCS.231.5

Submission history

From: EPTCS [view email] [via EPTCS proxy]
[v1] Tue, 6 Dec 2016 02:36:47 UTC (392 KB)
Full-text links:

Access Paper:

  • View PDF
  • TeX Source
  • Other Formats
view license
Current browse context:
cs.DB
< prev   |   next >
new | recent | 2016-12
Change to browse by:
cs

References & Citations

DBLP - CS Bibliography

listing | bibtex
Thomas Beyhl
Holger Giese
export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)