## Realm-Based Spatial Data Types: The ROSE Algebra (1995)

### Cached

### Download Links

Venue: | VLDB JOURNAL |

Citations: | 45 - 4 self |

### BibTeX

@ARTICLE{Güting95realm-basedspatial,

author = {Ralf Hartmut Güting and Markus Schneider},

title = {Realm-Based Spatial Data Types: The ROSE Algebra },

journal = {VLDB JOURNAL},

year = {1995},

volume = {4},

pages = {243--286}

}

### Years of Citing Articles

### OpenURL

### Abstract

Spatial data types or algebras for database systems should (1) be fully general, that is, closed under set operations, (2) have formally defined semantics, (3) be defined in terms of finite representations available in computers, (4) offer facilities to enforce geometric consistency of related spatial objects, and (5) be in-dependent of a particular DBMS data model, but cooperate with any. We present an algebra that uses realms as geometric domains underlying spatial data types. A realm, as a general database concept, is a finite, dynamic, user-defined structure underlying one or more system data types. Problems of numerical robustness and topological correctness are solved within and below the realm layer so that spatial algebras defined above a realm have very nice algebraic properties. Realms also interact with a DMBS to enforce geometric consistency on object creation or up-date. The ROSE algebra is defined on top of realms and offers general types to represent point, line, and region features, together with a comprehensive set of operations. It is described within a polymorphic type system and interacts with a DMBS data model and query language through an abstract object model interface. An example integration of ROSE into the object-oriented data model 02 and its query language is presented.

### Citations

278 | Algorithms for reporting and counting geometric intersections - Bentley, Ottmann - 1979 |

172 | Geographic Information Systems and Cartographic Modeling - Tomlin - 1990 |

105 | The LSD tree: Spatial access to multidimensional point and nonpoint objects
- Henrich, Six, et al.
- 1989
(Show Context)
Citation Context ...nent that allows to represent a realm and which offers realm operations (updates with redrawing, described in [GüS93]) is almost finished. The points and segments of a realm are stored in an LSD-tree =-=[HeSW89]-=-. For the problems of interfacing realms and database systems see [GüS93]. 10 For a lines or regions value, its halfsegment sequence contains each segment of the object twice, once for the left and on... |

105 | PROBE spatial data modeling and query processing in an image database application - Orenstein, Manola - 1988 |

80 |
Finite-resolution computational geometry
- GREENE, YAO
- 1986
(Show Context)
Citation Context ...or-free integer arithmetic. For mapping an application’s set of intersecting line segments into a realm’s set of non-intersecting segments the concept of redrawing and finite resolution geometry from =-=[GrY86]-=- is used. Although intersection points computed with finite resolution in general move away from their exact Euclidean position, this concept ensures that the unavoidable distortion of geometry (that ... |

70 | Geo-Relational Algebra: A Model and Query Language for Geometric Database Systems
- Güting
- 1988
(Show Context)
Citation Context ...t practical since these finite representations are far too large to be efficiently manageable. The geometric consistency problem is not solved in any of these proposals; there is some weak support in =-=[Gü88a]-=- through an area data type, but it is not sufficient. Finally, all three proposals have connected their spatial types to a fixed data model − Güting and Gargano et al. to the relational model and Scho... |

70 | An efficient pictorial database system for PSQL - Roussopoulos, Faloutsos, et al. - 1988 |

59 | Preparata: Plane-sweep algorithms for intersecting geometric figures - Nievergelt, F - 1982 |

57 |
A topological data model for spatial databases
- Egenhofer, Frank, et al.
- 1990
(Show Context)
Citation Context ...f computers they suggest to abandon coordinate-based geometry and to only consider the topological structures of point sets underlying spatial values. Their topological data model (later continued in =-=[EgFJ89]-=-) is based on simplicial complexes and has a similar purpose as our concept of realms. Essentially they offer an irregular triangular network partition of the plane as a geometric domain over which sp... |

57 | The 02 Database Programming Language - Richard - 1989 |

57 | A.: Thematic Map Modeling
- Scholl, Voisard
- 1989
(Show Context)
Citation Context ...ot fulfill most of the criteria given above. In [Gü88a, Gü88b] data types for points, lines, and regions are available but too restricted, e.g. a region is a single simple polygon (without holes). In =-=[ScV89]-=- general regions are defined; in Voisard’s thesis [Vo92] this has been extended to general types for points and lines. However, the definitions are unnecessarily complex. In [GaNT91] there is only a s... |

52 | PICQUERY: A high level query language for pictorial database management - JOSEPH, CARDENAS - 1988 |

48 | G üting. Rule-based optimization and query processing in an extensible geometric database system - Becker, H - 1992 |

42 | Geo-SAL: A Query Language for Spatial Data Analysis - Svensson, Huang - 1991 |

40 | Gral: An extensible relational database system for geometric applications - Güting - 1989 |

37 | Implementation of the ROSE algebra: Efficient algorithms for realm-basedspatial data types - Güting, Ridder, et al. - 1995 |

36 |
Cell graphs: A provable correct method for the storage of geometry
- Frank, Kuhn
- 1986
(Show Context)
Citation Context ...heir work by offering an abstract interface not dependent on any particular data model. Separating geometric primitives from the remainder of geometric modeling was already proposed by Frank and Kuhn =-=[FrK86]-=-. Because of the conflict between the infinite precision real numbers of Euclidean geometry and the finite precision number systems of computers they suggest to abandon coordinate-based geometry and t... |

32 | A Query Language for the O2 object-oriented Database System - Bancilhon, Cluet, et al. - 1990 |

30 | Second-Order Signature: A Tool for Specifying DataModels, Query Processing and Optimization
- Güting
- 1993
(Show Context)
Citation Context ... there is a collision between the typographical conventions for realm-based primitives and for data types (both underscore italic). It cannot be avoided in order to remain consistent with [GüS93] and =-=[Gü93]-=- (the latter will be used below as a framework for defining signatures). ∑sunion (P 1 , P 2 ) := P 1 ∪ P 2 union (L 1 , L 2 ) := blocks(S(L 1 ) ∪ S(L 2 )) − 14 − a points value a lines value a regions... |

28 | A query language for the O 2 object-oriented database system - Bancilhon, Cluet, et al. - 1989 |

27 | A Query Language for an ObjectOriented Database System - Bancilhon, Cluet, et al. - 1989 |

27 | Realms: A foundation for spatial data types in database systems
- Güting, Schneider
- 1993
(Show Context)
Citation Context ... it. 2 Instead, the SDT definition should be based on an abstract interface to the DBMS data model which we call the object model interface. The purpose of this paper (together with a companion paper =-=[GüS93]-=-) is to develop a formal definition of spatial data types fulfilling these criteria. A central idea is to introduce into the DBMS the concept of a realm. A realm is in general a finite, user defined s... |

27 | Realms: A foundation for spatial data types in database systems - Gfiting, Schneider - 1993 |

15 |
M.: Abstract data types for the logical modeling of complex data
- Gargano, Nardelli, et al.
- 1991
(Show Context)
Citation Context ...sistency problem. Most closely related to this work are the formal definitions of spatial data types (or algebras) given by Güting [Gü88a, Gü88b], Scholl and Voisard [ScV89, Vo92], and Gargano et al. =-=[GaNT91]-=-. All of these proposals do not fulfill most of the criteria given above. In [Gü88a, Gü88b] data types for points, lines, and regions are available but too restricted, e.g. a region is a single simple... |

15 | Modelling and manipulating objects in geoscientific databases - Lipeck, Neumann - 1987 |

13 | Gral: An Extensible Relational Database System for Geometric Applications - Gting - 1989 |

12 | Geo-Relational Algebra: A Model and Query Language for Geometric Database Systems - G��ting - 1988 |

9 | Second-Order Signature: A Tool for Specifying Data Models - Gting - 1993 |

6 | An efficient pictorial database system for PSQL - Rossopoulos, Faloutsos, et al. - 1988 |

5 | Modeling Non-Standard Database Systems by Many-Sorted Algebras - Güting - 1988 |

5 | Modeling Non-Standard Database Systems by Many-Sorted Algebras - Gting - 1988 |

3 | Delobel C., “A query language for the 02 object-oriented database system - Bancilhon, Cluet - 1989 |

3 | Geo-relational algebra: A model and query language for geometric database systems - Giiting - 1988 |

2 |
Bases de données géographiques: du modèle de données à l’interface utilisateur
- Voisard
- 1992
(Show Context)
Citation Context ...ü88b] data types for points, lines, and regions are available but too restricted, e.g. a region is a single simple polygon (without holes). In [ScV89] general regions are defined; in Voisard’s thesis =-=[Vo92]-=- this has been extended to general types for points and lines. However, the definitions are unnecessarily complex. In [GaNT91] there is only a single type for all kinds of geometric objects; a value i... |

2 | Bases de donnes gographiques: du modle de donnes l'interface utilisateur - Voisard - 1992 |

2 | Gral: An extensible relational database system for geometric applications - Gfiting - 1989 |

1 | The O2Book - Bancilhon, Delobel, et al. - 1992 |

1 |
Die ROSE-Algebra: Implementierung geometrischer Datentypen und Operationen fiir erweiterbare Datenbanksysteme (The ROSE algebra: Implementation of geometric data types and operations for extensible database systems). Fernuniversit/it Hagen, Fachbereich In
- Ridder
- 1994
(Show Context)
Citation Context ...tation of the ROSE algebra. Data structures for the three SDTs and procedures for all operations except for dist and the set-manipulating operations of the last group (Section 7.4) have been realized =-=[Ri94]-=- and are available as a module library written in Modula-2. The implementation of operations makes heavy use of the following three techniques: (i) scan or parallel scan of the halfsegment sequence 10... |

1 |
Föderation von Datenbanksystemen (Extensibility, Cooperation, Federation of Database Systems
- Schek, Weikum, et al.
(Show Context)
Citation Context ...query language with a complex application-specific sublanguage has been examined in some detail. Such interfaces will be important for cooperative database systems using external computation services =-=[ScW91]-=-. Open Problems and Future Work Implementation of the ROSE algebra. Data structures for the three SDTs and procedures for all operations except for dist and the set-manipulating operations of the last... |

1 | Second-order signature: A tool for specifying data models, query processing, and optimization - Giiting - 1993 |

1 | Realms: A foundation for spatial data types in database systems - Giiting, H, et al. - 1993 |

1 | Gtiting: Realm-Based Spatial Data Types 285 - Lipeck, Neumann - 1986 |

1 | The ROSE system - Ridder - 1995 |

1 | F6deration yon Datenbanksystemen (Extensibility, Cooperation, Federation of Database Systems - Schek, Weikum, et al. - 1991 |