Multi-Dimensional Range Query Processing with Spatial Relations
نویسندگان
چکیده
The processing of multi-dimensional range queries involving spatial relations arises in many application areas including Spatial Databases and GISs. In this paper we show how a variety of threeor four-dimensional queries that correspond to different relations can be processed using spatial data structures. We provide analytical formulas that describe the expected cost of retrieval and test the accuracy of the formulas through extensive experimentation. We also propose alternative methods aimed at the efficient processing of certain queries. The paper concludes by discussing the most suitable data structure for each type of query taking into account the properties of the data.
منابع مشابه
Direction Relations and Two-Dimensional Range Queries: Optimization Techniques
Despite the attention that direction relations, such as east, southeast etc., have attracted in several domains related to Spatial Databases and Geographic Information Systems (GIS), little work has been done on their formalization and efficient processing. In this paper we define direction relations between two-dimensional objects in different levels of qualitative resolution and we show how t...
متن کاملNCGIA National Center for Geographic Information and Analysis Direction Relations and Two-Dimensional Range Queries: Optimization Techniques
Despite the attention that direction relations, such as east, southeast etc., have attracted in several domains related to Spatial Databases and Geographic Information Systems (GIS), little work has been done on their formalization and efficient processing. In this paper we define direction relations between two-dimensional objects in different levels of qualitative resolution and we show how t...
متن کاملRange Queries Involving Spatial Relations: A Performance Analysis
Spatial relations are becoming an important aspect of spatial access methods because of the increasing interest on qualitative spatial information processing. In this paper we show how queries involving spatial relations can be transformed to range queries and implemented in existing DBMSs. We provide a performance analysis of Band Rtree indexing methods to support such queries and we evaluate ...
متن کاملDirection Relations and Two-Dimensional Range Queries: Optimisation Techniques
This paper defines direction relations (e.g., north, northeast) between two-dimensional objects and shows how they can be efficiently retrieved using B-, KDBand Rtree-based data structures. Essentially, our work studies optimisation techniques for 2D range queries that arise during the processing of direction relations. We test the efficiency of alternative indexing methods through extensive ex...
متن کاملQuery Planning for Range Queries with User-defined Aggregation on Multi-dimensional Scientific Datasets
Applications that make use of very large scientific datasets have become an increasingly important subset of scientific applications. In these applications, the datasets are often multi-dimensional, i.e., data items are associated with points in a multi-dimensional attribute space. The processing is usually highly stylized, with the basic processing steps consisting of (1) retrieval of a subset...
متن کامل