The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Multi-table joins through bitmapped join indices
ACM SIGMOD Record
Implementing data cubes efficiently
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Improved query performance with variant indexes
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Multidimensional access methods
ACM Computing Surveys (CSUR)
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Object-Based Selective Materialization for Efficient Implementation of Spatial Data Cubes
IEEE Transactions on Knowledge and Data Engineering
Model 204 Architecture and Performance
Proceedings of the 2nd International Workshop on High Performance Transaction Systems
Efficient OLAP Operations in Spatial Data Warehouses
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
Representing spatiality in a conceptual multidimensional model
Proceedings of the 12th annual ACM international workshop on Geographic information systems
Towards a spatial multidimensional model
Proceedings of the 8th ACM international workshop on Data warehousing and OLAP
Optimizing bitmap indices with efficient compression
ACM Transactions on Database Systems (TODS)
An open source and web based framework for geographic and multidimensional processing
Proceedings of the 2006 ACM symposium on Applied computing
Bitmap Index Design Choices and Their Performance Implications
IDEAS '07 Proceedings of the 11th International Database Engineering and Applications Symposium
Breaking the Curse of Cardinality on Bitmap Indexes
SSDBM '08 Proceedings of the 20th international conference on Scientific and Statistical Database Management
Modelling and querying geographical data warehouses
Information Systems
Benchmarking spatial data warehouses
DaWaK'10 Proceedings of the 12th international conference on Data warehousing and knowledge discovery
Polygon-Based Query Evaluation over Geospatial Data Using Distributed Hash Tables
UCC '13 Proceedings of the 2013 IEEE/ACM 6th International Conference on Utility and Cloud Computing
| Hi-index | 0.00 |
In this paper we propose the Spatial Bitmap Index (SB-index), which is an index based on Bitmap and Minimum Bounding Rectangle (MBR) to provide efficient query processing in Geographical Data Warehouses. The SB-index is built on the primary key of a spatial dimension table, and maintains the MBR of a given spatial attribute. Query processing requires a scan on the index, which compares both the query spatial predicate and the current MBR. This scan supplies a set of candidate solutions to a refinement step that evaluates each candidate. Finally, only the index entries from objects that satisfy the spatial predicate must be accessed, in order to answer the submitted query. Comparisons between the SB-index and the star-join indexed with R-tree and GiST showed significantly improvement of 25% up to 95% with regards to the query processing time. This performance gain occurs since SB-index restricts a set of candidates and avoids the star-join calculation.