Sciweavers

1542 search results - page 54 / 309
» Redundancy in Spatial Databases
Sort
View
GIS
2006
ACM
14 years 8 months ago
Query optimizer for spatial join operations
This paper presents a query optimizer module based on cost estimation that chooses the best filtering step algorithm to perform a specific spatial join operation. A set of express...
Cirano Iochpe, João Luiz Dihl Comba, Miguel...
DASFAA
2004
IEEE
158views Database» more  DASFAA 2004»
13 years 11 months ago
A Cost Model for Spatial Intersection Queries on RI-Trees
Abstract. The efficient management of interval sequences represents a core requirement for many temporal and spatial database applications. With the Relational Interval Tree (RI-tr...
Hans-Peter Kriegel, Martin Pfeifle, Marco Pöt...
COSIT
1997
Springer
102views GIS» more  COSIT 1997»
13 years 11 months ago
Partition and Conquer
Abstract. Although maps and partitions are ubiquitous in geographical information systems and spatial databases, there is only little work investigating their foundations. We give ...
Martin Erwig, Markus Schneider
GIS
1997
ACM
13 years 11 months ago
Speeding up Bulk-Loading of Quadtrees
Spatial indexes, such as the PMR quadtree, are important in spatial databases for efficient execution of queries involving spatial constraints, especially when the queries involve...
Gísli R. Hjaltason, Hanan Samet, Yoram J. S...
IDEAS
2003
IEEE
86views Database» more  IDEAS 2003»
14 years 27 days ago
A Medium Complexity Discrete Model for Uncertain Spatial Data
This paper presents a method for representing uncertainty in spatial data in a database. The model presented requires moderate amounts of storage space. To compute the probability...
Erlend Tøssebro, Mads Nygård