Typing graph-manipulation operations

Hidders, Jan (2003) Typing graph-manipulation operations. In: Calvanese, D. and Lenzerini, M. and Motwani, R. (eds.) Database Theory: ICDT 2003. Lecture Notes in Computer Science 2572. Springer, pp. 391-406. ISBN 9783540003236.

Full text not available from this repository.

Official URL: https://doi.org/10.1007/3-540-36285-1\_26

Abstract

We present a graph-based data model called GDM where database instances and database schemas are described by certain types of labeled graphs called instance graphs and schema graphs. For this data model we introduce two graph-manipulation operations, an addition and a deletion, that are based on pattern matching and can be represented in a graphical way. For these operations it is investigated if they can be typed such that it is guaranteed for well-typed operations that the result belongs to a certain database schema graph, and what the complexity of deciding this well-typedness is.

Metadata

Item Type:	Book Section
School:	Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences
Depositing User:	Sarah Hall
Date Deposited:	20 Apr 2021 18:31
Last Modified:	09 Aug 2023 12:50
URI:	https://eprints.bbk.ac.uk/id/eprint/43941

Statistics

Archive Staff Only (login required)

Edit/View Item