Host-graph-sensitive RETE nets for incremental graph pattern matching with nested graph conditions
Authors:
- Matthias BarkowskyMBMatthias Barkowsky
- Holger GieseHGHolger Giese
- 25 November 2022
- journal article
- research article
- Published by Elsevier in Journal of Logical and Algebraic Methods in Programming
- Vol. 131
Abstract
No abstract availableKeywords
Funding Information
- Deutsche Forschungsgemeinschaft (336677879)
This publication has 12 references indexed in Scilit:
- Road to a reactive and incremental model transformation platform: three generations of the VIATRA frameworkSoftware and Systems Modeling, 2016
- How good are query optimizers, really?Proceedings of the VLDB Endowment, 2015
- Correctness of high-level transformation systems relative to nested conditionsMathematical Structures in Computer Science, 2009
- Trigger condition testing and view maintenance using optimized discrimination networksIEEE Transactions on Knowledge and Data Engineering, 2002
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small TreewidthSIAM Journal on Computing, 1996
- On the complexity of H-coloringJournal of Combinatorial Theory, Series B, 1990
- On the optimal nesting order for computing N -relational joinsACM Transactions on Database Systems, 1984
- Graph minors. III. Planar tree-widthJournal of Combinatorial Theory, Series B, 1984
- Increasing tree search efficiency for constraint satisfaction problemsArtificial Intelligence, 1980
- Algorithm 97: Shortest pathCommunications of the ACM, 1962