EXPLICIT GRAPHS IN A FUNCTIONAL-MODEL FOR SPATIAL DATABASES

Martin Erwig

doi:10.1109/69.317707

EXPLICIT GRAPHS IN A FUNCTIONAL-MODEL FOR SPATIAL DATABASES

1994-01-01

13

PRE

AI

DOI：10.1109/69.317707

Original

Original request for help

Save

Abstract

En 中文

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 hierarchies, graphs are available as an explicit, modeling, tool, and graph operations are part of the query language. 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. Furthermore, a dynamic generalization concept is introduced to handle heterogeneous collections of objects in a query. In cool nection with spatial data types, this leads to powerful modeling and querying capabilities for spatial databases, in particular for spatially embedded networks such as highways, rivers, public transport, and so forth. We use multilevel 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 constructors as functions between kinds, and so provides the types that can be used at the first level.

Keywords:

DYNAMIC GENERALIZATION

EXPLICIT GRAPHS

FUNCTIONAL DATA MODEL

GRAPHS IN DATABASES

HETEROGENEOUS COLLECTIONS

MULTILEVEL ALGEBRA

ORDER-SORTED ALGEBRA

SPATIAL DATABASES

EXPLICIT GRAPHS IN A FUNCTIONAL-MODEL FOR SPATIAL DATABASES

Abstract

AI Summary

Journal

Organization