Minimization of Tree Patterns

Many of today’s graph query languages are based on graph pattern matching. We investigate optimization of tree-shaped patterns that have transitive closure operators. Such patterns not only appear in the context of graph databases but also were originally studied for querying tree-structured data, w...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of the ACM 2018-08, Vol.65 (4), p.1-46
Hauptverfasser:	CzerwiŃski, Wojciech, Martens, Wim, Niewerth, Matthias, Parys, Paweł
Format:	Artikel
Sprache:	eng
Schlagworte:	Graph matching Graph theory Mathematical problems Nodes Optimization Pattern matching
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!