Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

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

From MaRDI portal
Publication:1151055
Jump to:navigation, search

DOI10.1016/0306-4379(80)90014-9zbMath0456.68096OpenAlexW2047907247MaRDI QIDQ1151055

Hartmut Ehrig, Hans-Joerg 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

parallelismdata base models


Mathematics Subject Classification ID

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


Related Items (6)

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




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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1151055&oldid=13207223"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 04:19.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki