Improving Multidimensional Range Queries of Non Rectangular Volumes Specified by a Query Box Set
نویسندگان
چکیده
Standard range queries for multidimensional index structures only allow one restriction per dimension, describing a rectangular range (called query box) of the multidimensional data cube which contains the requested data. This is not sufficient to specify any kind of volume (e.g., non rectangular or disjoint volumes) and a bounding box might not be a good solution either. Additionally common data warehousing queries operating on multidimensional data seldom result in a single query box. This article shows where the problems of sequential processing of a query box set come from and presents an algorithm avoiding them for multidimensional data cubes represented by a space filling curve and a one dimensional index structure. The theoretical improvements are compared with practical measurements based on a prototype implementation of the UB–Tree.
منابع مشابه
An Efficient Indexing Method for Box Queries in NDDS Spaces using BoND-tree
Similarity searches in multidimensional Non-ordered Discrete Data Spaces (NDDS) are becoming increasingly important for application areas such as bioinformatics, biometrics, data mining and E-commerce. Efficient similarity searches require robust indexing techniques. Box queries (or window queries) are a type of query which specifies a set of allowed values in each dimension. Unfortunately, exi...
متن کاملExtending Rectangular Range Reporting with Query Sensitive Analysis
In this paper, we consider the problem of reporting the new points incorporated by on-line sequences of nested rectangular range queries where all queries in a sequence have the same orientation, but the orientation of each sequence may differ. Worst case lower bound results show that time and space efficient solutions to this problem are unlikely. Here we present a linear space solution that p...
متن کاملData Transformation for Improved Query Performance
A database management system stores data in order to facilitate fast and efficient retrieval at a later point of time. The typical queries run on a database can be classified into three broad classes. They are range queries, k-nearest neighbor (k-NN) queries and box queries. Implementation of a box query typically involves simple comparisons among the query objects and index objects, however, i...
متن کاملAnalyzing Range Queries on Spatial Data
Analysis of range queries on spatial (multidimensional) data is both important and challenging. Most previous analysis attempts have made certain simplifying assumptions about the datasets and/or queries to keep the analysis tractable. As a result, they may not be universally applicable. This paper proposes a set of five analysis techniques to estimate the selectivity and number of index nodes ...
متن کاملEfficiency Improvement of Narrow Range Query Processing in R-tree
Indexing methods for efficient processing of multidimensional data are very requested in many fields, like geographical information systems, drawing documentations etc. Well-known R-tree is one of the multidimensional data structures. The R-tree is based on bounding of spatial near points by multidimensional rectangles. This data structure supports various types of queries, e.g. point and range...
متن کامل