Applications of graph grammar theory to consistency, synchronization and scheduling in data base systems

DOI10.1016/0306-4379(80)90014-9MaRDI QIDQ1151055zbMATH OpenOpenAlexFDO

Authors Hartmut Ehrig, Hans-Jörg Kreowski

Publication date 1980

Published in Information Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0306-4379(80)90014-9

zbMATH Keywords

data base modelsparallelism

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of operating systems (68N25) Information storage and retrieval of data (68P20) Formal languages and automata (68Q45)

Cited in

(6)

• Amalgamation of graph transformations: a synchronization mechanism
• Transformations of structures: An algebraic approach
• Syntax and semantics of hybrid database languages
• Single pushout transformations of equationally defined graph structures with applications to actor systems
• -adhesive transformation systems with nested application conditions. Part 1: parallelism, concurrency and amalgamation
• Introduction to graph grammars with applications to semantic networks

This page was built for publication: Applications of graph grammar theory to consistency, synchronization and scheduling in data base systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1151055)