Explicit Graphs in a Functional Model for Spatial Databases (1994)
Cached
Download Links
| Venue: | IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING |
| Citations: | 28 - 8 self |
BibTeX
@ARTICLE{Erwig94explicitgraphs,
author = {Martin Erwig and Ralf Hartmut Güting},
title = {Explicit Graphs in a Functional Model for Spatial Databases},
journal = {IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING},
year = {1994},
volume = {5},
pages = {787--804}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Observing that networks are ubiquitous in applications for spatial databases, we define a new data model and query language that especially supports graph structures. This model integrates concepts of functional data modeling with order-sorted algebra. Besides object and data type hierar-chies graphs are available as an explicit modeling tool, and graph operations are part of the query lan-guage. Graphs have three classes of components, namely nodes, edges, and explicit paths. These are at the same time object types within the object type hierarchy and can be used like any other type. Explicit paths are useful because “real world ” objects often correspond to paths in a network. Further-more, a dynamic generalization concept is introduced to handle heterogeneous collections of objects in a query. In connection with spatial data types this leads to powerful modeling and querying capa-bilities for spatial databases, in particular for spatially embedded networks such as highways, rivers, public transport, and so forth. We use multi-level order-sorted algebra as a formal framework for the specification of our model. Roughly spoken, the first level algebra defines types and operations of the query language whereas the second level algebra defines kinds (collections of types) and type con-structors as functions between kinds and so provides the types that can be used at the first level.
Keyphrases
spatial database functional model explicit graph query language explicit path graph operation roughly spoken explicit modeling tool type con-structors time object type second level algebra defines kind object type hierarchy public transport dynamic generalization concept formal framework graph structure real world object order-sorted algebra new data model first level algebra defines type functional data heterogeneous collection data type hierar-chies graph multi-level order-sorted algebra spatial data type first level powerful modeling query lan-guage
