There is an increasing need to integrate spatial index structures into commercial database management systems. In geographic information systems (GIS), huge amounts of information involving both, spatial and thematic attributes, have to be managed. Whereas relational databases are adequate for handling thematic attributes, they fail to manage spatial information efficiently. In this paper, we point out that neither a hybrid solution using relational databases and a separate spatial index nor the approach of existing object-relational database systems provide a satisfying solution to this problem. Therefore, it is necessary to map the spatial information into the relational model. Promising approaches to this mapping are based on sp...
The advantages of three dimensional (3D) city models can be seen in various applications including p...
[[abstract]]Recently, millions of databases have been used and we need a new technique that can auto...
Mapping to one-dimensional values and then using a one-dimensional indexing method has been proposed...
Abstract. There is an increasing need to integrate spatial index structures into commercial database...
Spatial data are often stored in a database with the finest level of details. The problem with carto...
Spatial objects other than points and boxes can be stored in spatial indexes, but the techniques usu...
Modern database applications including computer-aided design, multimedia information systems, medica...
In this paper we describe the spatial access method z-ordering and its application in the context of...
For the application of space-??lling curves to the cre-ation of e??cient indexes on spatial objects,...
Spatial data are often stored in a database with thefinest level of details. The problem of cartogra...
Abstract. Efficiently accessing multidimensional data is a challenge for building modern database ap...
The use of index structures can increase the performance of query processing. However, the index str...
Nowadays cartographic objects of different resolutions are hold in different coexisting databases. T...
The requirement of ordering a set of multiattribute data arises frequently from spatial index proce...
. An algorithm for ranking spatial objects according to increasing distance from a query object is i...
The advantages of three dimensional (3D) city models can be seen in various applications including p...
[[abstract]]Recently, millions of databases have been used and we need a new technique that can auto...
Mapping to one-dimensional values and then using a one-dimensional indexing method has been proposed...
Abstract. There is an increasing need to integrate spatial index structures into commercial database...
Spatial data are often stored in a database with the finest level of details. The problem with carto...
Spatial objects other than points and boxes can be stored in spatial indexes, but the techniques usu...
Modern database applications including computer-aided design, multimedia information systems, medica...
In this paper we describe the spatial access method z-ordering and its application in the context of...
For the application of space-??lling curves to the cre-ation of e??cient indexes on spatial objects,...
Spatial data are often stored in a database with thefinest level of details. The problem of cartogra...
Abstract. Efficiently accessing multidimensional data is a challenge for building modern database ap...
The use of index structures can increase the performance of query processing. However, the index str...
Nowadays cartographic objects of different resolutions are hold in different coexisting databases. T...
The requirement of ordering a set of multiattribute data arises frequently from spatial index proce...
. An algorithm for ranking spatial objects according to increasing distance from a query object is i...
The advantages of three dimensional (3D) city models can be seen in various applications including p...
[[abstract]]Recently, millions of databases have been used and we need a new technique that can auto...
Mapping to one-dimensional values and then using a one-dimensional indexing method has been proposed...