A spatial bitmap-based index for geographical data warehouses

Proceedings of the ACM Symposium on Applied Computing

Volumn , Issue , 2009, Pages 1336-1342

  Lopes Siqueira, Thiago Luís ^a   Ciferri, Ricardo Rodrigues ^a   Times, Valéria Cesário ^b   De Aguiar Ciferri, Cristina Dutra ^c  

^a FEDERAL UNIVERSITY OF SÃO CARLOS   (Brazil)

^b FEDERAL UNIVERSITY OF PERNAMBUCO   (Brazil)

^c UNIVERSITY OF SÃO PAULO   (Brazil)

Author keywords

Bitmap index; Geographical data warehouse; Projection index

Indexed keywords

BITMAP INDEXES; CANDIDATE SOLUTION; GEOGRAPHICAL DATA; MINIMUM BOUNDING RECTANGLE; PERFORMANCE GAIN; PRIMARY KEYS; PROJECTION INDICES; REFINEMENT STEP; SPATIAL ATTRIBUTE; SPATIAL DIMENSION; SPATIAL PREDICATES;

COMPUTER SCIENCE; DATA PROCESSING; DECISION TREES; QUERY PROCESSING;

DATA WAREHOUSES;

EID: 70349707621     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1529282.1529582     Document Type: Conference Paper

References (20)

1. Beckmann, N. et al. The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles. In: ACM SIGMOD 1990. p.322-331.
2. Bimonte, S., Tchounikine, A. and Miquel, M. Spatial OLAP: Open Issues and a Web Based Prototype. In: 10th AGILE International Conference on Geographic Information Science, 2007. 11p.
3. Bimonte, S., Tchounikine, A. and Miquel, M. Towards a Spatial Multidimensional Model. In: DOLAP 2005, p. 39-46.
4. th DaWak, 2004. p. 26-37.
5. Gaede, V., Günther, O. Multidimensional Access Methods. ACM Computing Surveys, v.30, n.2, p.170-231, 1998.
6. Guttman, A. R-Trees: A Dynamic Index Structure for Spatial Searching. ACM SIGMOD Record, v.14, n.2, p.47-57, 1984.
7. Harinarayan, V., Rajaraman, A. and Ullman, J. D. Implementing Data Cubes Efficiently. ACM SIGMOD Record, v.25, n.2, p.205-216, 1996.
8. nd Ed. Wiley, 2002.
9. th ACM GIS, 2004. p.12-22.
10. O'Neil, E., O'Neil, P., and Wu, K. Bitmap Index Design Choices and Their Performance Implications. In: 11th IDEAS, 2007. p. 72-84.
11. O'Neil, P. Model 204 Architecture and Performance. Springer LNCS 359, 1989, p. 40-57.
12. O'Neil, P., and Graefe, G. Multi-Table Joins Through Bitmapped Join Indices. ACM SIGMOD Record, v.24, n.3, p.8-11, 1995.
13. O'Neil, P., O'Neil, E. and Chen, X. The Star Schema Benchmark. 2007. http://www.cs.umb.edu/~poneil/starschemab.pdf
14. O'Neil, P. and Quass, D. Improved Query Performance with Variant Indexes, In: ACM SIGMOD, 1997. p.38-49.
15. th SSTD, 2001. p. 443-459.
16. Stefanovic, N., Han, J. and Koperski, K. Object-Based Selective Materialization for Efficient Implementation of Spatial Data Cubes. IEEE TKDE, v.12, n.6, p.938-958, 2000.
17. Silva, J., Times, V. C., Salgado, A. C. An open source and web based framework for geographic and multidimensional processing. 21st ACM SAC, 2006. p.63-67.
18. Stockinger, K. and Wu, K. Bitmap Indices for Data Warehouses. Data Warehouses and OLAP: Concepts, Architectures and Solutions. IRM Press, 2007. p.157-178.
19. Wu, K., Otoo, E. J. and Shoshani, A. Optimizing Bitmap Indices with Efficient Compression. ACM TODS v.31, p.1-38, 2006.
20. Wu, K., Stockinger, K. and Shosani, A. Breaking the Curse of Cardinality on Bitmap Indexes. Report LBNL-173E. 2008. http://crd.lbl.gov/ ~kewu/ps/LBNL-173E.pdf.