A Nested-Graph Model for the Representation and Manipulation of Complex Objects

A Nested-Graph Model for the Representation and Manipulation of Complex Objects (1994)

Cached

Download Links

[www.dcs.bbk.ac.uk]
[www.dcs.bbk.ac.uk]

Other Repositories/Bibliography

DBLP

by Alexandra Poulovassilis , Mark Levene

Venue:	ACM Transactions on Information Systems
Citations:	34 - 3 self

Versions

Version History

Metadata Version 3

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	A Nested-Graph Model for the Representation and Manipulation of Complex Objects	user correction - Legacy Corrections
AUTHOR NAME	Alexandra Poulovassilis	SVM HeaderParse 0.1
AUTHOR AFFIL	Department of Computer Science, King's College London	SVM HeaderParse 0.2
AUTHOR ADDR	Strand, London, WC2R 2LS, U.K.	SVM HeaderParse 0.1
AUTHOR NAME	Mark Levene	SVM HeaderParse 0.1
AUTHOR AFFIL	Department of Computer Science, University College London	SVM HeaderParse 0.2
AUTHOR ADDR	Gower Street, London, WC1E 6BT,; U.K.	SVM HeaderParse 0.1
ABSTRACT	this paper we report upon a graph-based approach to such an integration. Our use of graphs has two key advantages : firstly, graphs are formally defined, well-understood structures; secondly, it is widely accepted that graph-based formalisms considerably enhance the usability of complex systems [19]. Graphs have been used in conjunction with a number of conventional data models, for example the hierarchical and network models [35], the entity-relationship model [9] and a recent extension thereof for complex objects [27], and various semantic data models [16, 20, 31]. Graphs or hypergraphs [6] have also been used more recently in [12, 17, 23, 25, 33, 36] as a data modelling tool in their own right. We give a comparison between this recent work and our own approach in Section 4 of the paper. Directed graphs have also been the foundation of Hypertext databases [11, 33]. Such databases are graphs consisting of nodes which refer to units of stored information (typically text) and of named links. Each link connects two nodes, the "source" and the "destination". Links are traversed either forwards (from source to destination) or backwards (from destination to source). The process of traversing named links and examining the text associated with nodes is called	user correction - Legacy Corrections
YEAR	1994	INFERENCE
VENUE	ACM Transactions on Information Systems	INFERENCE
VENUE TYPE	JOURNAL	INFERENCE
PAGES	35--68	INFERENCE
VOLUME	12	INFERENCE
CITATIONS	37 found	ParsCit 1.0