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)
An efficient bitmap encoding scheme for selection queries
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Characterization of hierarchies and some operators in OLAP environment
Proceedings of the 2nd ACM international workshop on Data warehousing and OLAP
The Data Warehouse Toolkit: The Complete Guide to Dimensional Modeling
The Data Warehouse Toolkit: The Complete Guide to Dimensional Modeling
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
Generalizing "Search'' in Generalized Search Trees (Extended Abstract)
ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
Efficient OLAP Operations in Spatial Data Warehouses
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
Indexing Spatio-Temporal Data Warehouses
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Spatial hierarchy and OLAP-favored search in spatial data warehouse
DOLAP '03 Proceedings of the 6th ACM international workshop on Data warehousing and OLAP
Materialization of fragmented views in multidimensional databases
Data & Knowledge Engineering
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)
Balanced Spatio-Temporal Data Warehouse with R-MVB, STCAT and BITMAP Indexes
PARELEC '06 Proceedings of the international symposium on Parallel Computing in Electrical Engineering
Towards a logical multidimensional model for spatial data warehousing and OLAP
DOLAP '06 Proceedings of the 9th ACM international workshop on Data warehousing and OLAP
Horizontal fragmentation as a technique to improve the performance of drill-down and roll-up queries
Proceedings of the 2007 ACM symposium on Applied computing
AINA '07 Proceedings of the 21st International Conference on Advanced Networking and Applications
Bitmap Index Design Choices and Their Performance Implications
IDEAS '07 Proceedings of the 11th International Database Engineering and Applications Symposium
Advanced Data Warehouse Design: From Conventional to Spatial and Temporal Applications (Data-Centric Systems and Applications)
Breaking the Curse of Cardinality on Bitmap Indexes
SSDBM '08 Proceedings of the 20th international conference on Scientific and Statistical Database Management
Should SDBMS support a join index?: a case study from CrimeStat
Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
A spatial bitmap-based index for geographical data warehouses
Proceedings of the 2009 ACM symposium on Applied Computing
HOBI: Hierarchically Organized Bitmap Index for Indexing Dimensional Data
DaWaK '09 Proceedings of the 11th International Conference on Data Warehousing and Knowledge Discovery
Dimension table driven approach to referential partition relational data warehouses
Proceedings of the ACM twelfth international workshop on Data warehousing and OLAP
View usability and safety for the answering of top-k queries via materialized views
Proceedings of the ACM twelfth international workshop on Data warehousing and OLAP
The Star Schema Benchmark and Augmented Fact Table Indexing
Performance Evaluation and Benchmarking
Yet another algorithms for selecting bitmap join indexes
DaWaK'10 Proceedings of the 12th international conference on Data warehousing and knowledge discovery
Spatial hierarchies and topological relationships in the spatial MultiDimER model
BNCOD'05 Proceedings of the 22nd British National conference on Databases: enterprise, Skills and Innovation
Efficient processing of drill-across queries over geographic data warehouses
DaWaK'11 Proceedings of the 13th international conference on Data warehousing and knowledge discovery
High-performance online spatial and temporal aggregations on multi-core CPUs and many-core GPUs
Proceedings of the fifteenth international workshop on Data warehousing and OLAP
| Hi-index | 0.00 |
Spatial data warehouses (SDWs) allow for spatial analysis together with analytical multidimensional queries over huge volumes of data. The challenge is to retrieve data related to ad hoc spatial query windows according to spatial predicates, avoiding the high cost of joining large tables. Therefore, mechanisms to provide efficient query processing over SDWs are essential. In this paper, we propose two efficient indices for SDW: the SB-index and the HSB-index. The proposed indices share the following characteristics. They enable multidimensional queries with spatial predicate for SDW and also support predefined spatial hierarchies. Furthermore, they compute the spatial predicate and transform it into a conventional one, which can be evaluated together with other conventional predicates by accessing a star-join Bitmap index. While the SB-index has a sequential data structure, the HSB-index uses a hierarchical data structure to enable spatial objects clustering and a specialized buffer-pool to decrease the number of disk accesses. The advantages of the SB-index and the HSB-index over the DBMS resources for SDW indexing (i.e. star-join computation and materialized views) were investigated through performance tests, which issued roll-up operations extended with containment and intersection range queries. The performance results showed that improvements ranged from 68% up to 99% over both the star-join computation and the materialized view. Furthermore, the proposed indices proved to be very compact, adding only less than 1% to the storage requirements. Therefore, both the SB-index and the HSB-index are excellent choices for SDW indexing. Choosing between the SB-index and the HSB-index mainly depends on the query selectivity of spatial predicates. While low query selectivity benefits the HSB-index, the SB-index provides better performance for higher query selectivity.