Multidimensional access methods

@article{Gaede1998MultidimensionalAM,
  title={Multidimensional access methods},
  author={Volker Gaede and Oliver G{\"u}nther},
  journal={ACM Comput. Surv.},
  year={1998},
  volume={30},
  pages={170-231}
}
Search operations in databases require special support at the physical level. This is true for conventional databases as well as spatial databases, where typical search operations include the point query (find all objects that contain a given search point) and the region query (find all objects that overlap a given search region). More than ten years of spatial database research have resulted in a great variety of multidimensional access methods to support such operations. We give an overview… Expand
Multidimensional Access Methods : Important Factor for Current and Next Decade ’ s Applications in Spatial Databases
In spatial databases search operations take an important role. These operations consist of the point query (find all objects that contain a given search point), the range query (find all objects thatExpand
NA-Trees: A Dynamic Index for Spatial Data
TLDR
This paper considers the problem of retrieving spatial data via exact match queries and range queries from a large, dynamic index, and proposes a new data structure, a Nine-Areas tree, designed for paged secondary storage to minimize the number of disk accesses during a tree search. Expand
Efficient Concurrent Operations in Spatial Databases
TLDR
Solutions for efficient concurrent access frameworks on both types of spatial indexing structures are provided, as well as for continuous query processing on moving objects, for multiple-user environments, to satisfy the concurrency control requirements, while providing outstanding performance for concurrent queries. Expand
An efficient method for the retrieval of objects by topological relations in spatial database systems
In this paper, we present a new method to improve the performance of query processing in a spatial database. The previous approach can process the retrieval of spatial objects by topologicalExpand
A Comparative Study on the Performance of HZR+ Trees on Query Processing
TLDR
The packing of non spatial data converts the data into a form that paves the way for multidimensional access, similar to using spatial access methods for spatial data, and the proposal of a new index structure, Hilbert ZR+ Tree [HZR- Tree]. Expand
Evaluating the spatial indexing of dense point sets
  • W. Osborn, Marc Moreau
  • Computer Science
  • 2013 26th IEEE Canadian Conference on Electrical and Computer Engineering (CCECE)
  • 2013
TLDR
An evaluation of the mqr-tree as a spatial access method for handling high-density point regions, such as world co-ordinates shows that the mqa-tree can index high- density point regions effectively and requires far fewer disk accesses than the R-tree when point density is very high. Expand
Spatial query processing for high resolutions
TLDR
The new High Resolution Indexing (HRI) method can easily be integrated into general purpose DBMSs and outperforms competitive techniques that are implementable on top of a standard object-relational DBMS by an order of magnitude with respect to secondary storage space and overall query response time. Expand
Clustering Multidimensional Extended Objects to Speed Up Execution of Spatial Queries
TLDR
A cost-based adaptive clustering method to improve average performance of spatial queries over large collections of multidimensional extended objects (hyper-intervals or hyper-rectangles) and employs a new grouping criterion to group objects in clusters, more efficient than traditional approaches based on minimum bounding in all dimensions. Expand
Fast Retrieval by Spatial Structure in Image Databases
TLDR
The proposed approach extends the existing framework of indexing using SAMs to treat image content in conjunction with two well-known image-matching methods, namely the editing distance on Attributed Relational Graphs (ARGs) and the Hungarian method for graph matching. Expand
An efficient method for the retrieval of objects by topological relations in spatial database systems
  • P. Lin, W. Tan
  • Mathematics, Computer Science
  • Inf. Process. Manag.
  • 2003
TLDR
A new method is presented to improve the performance of query processing in a spatial database by adding internal rectangle to the leaf nodes of the R-tree as additional information for helping objects retrieval. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 391 REFERENCES
Geometric Information Makes Spatial Query Processing More Efficient
TLDR
This paper shows that the availability of such information allows us to decide at an early stage that numerous objects fullll the spatial predicate are needed for the z-ordering method, which leads to signiicant performance improvements for the spatial selection as well as for theatial intersection join. Expand
Storage and Access Structures for Geometric Data Bases
TLDR
A data base system for CAD must manage “in designer real time” large collections not of points, but of spatial objects, in such a way that proximity queries are answered efficiently. Expand
Optimal Redundancy in Spatial Database Systems
TLDR
This paper presents an empirically derived formula to assess the expected redundancy for the z-ordering approximation technique given some simple parameters and shows the applicability of this formula to a large class of different object geometries. Expand
The Fieldtree: A Data Structure for Geographic Information Systems
TLDR
The Fieldtree is described, a data structure that provides one of such access methods for spatial databases and has been designed for GIS and similar applications, where range queries are predominant and spatial nesting and overlaping of objects are common. Expand
Strategies for Optimizing the Use of Redundancy in Spatial Databases
TLDR
Two strategies for obtaining redundancy are compared, one based on recursive partitioning of the space containing the data objects, and the other based on type-specific object partitionings, and experimental results suggest that the former approach is more effective in improving performance. Expand
Redundancy in spatial databases
TLDR
The optimal use of redundancy for z- order is explored through analysis of the z-order search algorithm and through experiments. Expand
A qualitative comparison study of data structures for large line segment databases
A qualitative comparative study is performed of the performance of three popular spatial indexing methods - the R-tree, R+-tree, and the PMR quadtree-in the context of processing spatial queries inExpand
Performance Comparison of Point and Spatial Access Methods
TLDR
A performance comparison of multidimensional point access methods under arbitrary data distributions and under various types of queries and was surprised to see one method to be the clear winner which was the BUDDY hash tree, which exhibits an at least 20 % better average performance than its competitors and is robust under ugly data and queries. Expand
Techniques for Design and Implementation of Efficient Spatial Access Methods
TLDR
This paper presents a classification of existing spatial access methods and shows that they use one of the following three techniques: clipping, overlapping regions, and transformation, and suggests a hybrid method combining the techniques of overlapping regions and transformation. Expand
Spatial query processing in an object-oriented database system
TLDR
This work unifies much of the work on spatial query processing capabilities by identifying common principles and distilling them into a small set of constructs that can be supported with only minor modifications to current DBMS implementations. Expand
...
1
2
3
4
5
...