Hybrid search plan generation for generalized graph pattern matching

•Constraints in a graph query are represented uniformly.•Static information allows considering the graph query's structure.•Dynamic information allows tailoring to host graph heterogeneities.•Filtering effects of constraint checks are considered. In recent years, the increased interest in appli...

Full description

Saved in:
Bibliographic Details
Published inJournal of logical and algebraic methods in programming Vol. 114; p. 100563
Main Authors Barkowsky, Matthias, Giese, Holger
Format Journal Article
LanguageEnglish
Published Elsevier Inc 01.08.2020
Subjects
Online AccessGet full text

Cover

Loading…