An efficient OLAP query processing technique using measure attribute indexes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3306, Issue , 2004, Pages 218-228

  Jung, T S ^a   Ahn, M S ^a   Cho, W S ^a  

^a Chungbuk National University   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

OBJECT-ORIENTED DATABASES; STARS;

CRITICAL ISSUES; EFFICIENT QUERY EVALUATION; OBJECT DATABASE; OBJECT-RELATIONAL DBMS; ORDERS OF MAGNITUDE; PERFORMANCE ANALYSIS; QUERY EVALUATION; QUERY PROCESSING TECHNIQUES;

QUERY PROCESSING;

EID: 35048885163     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30480-7_24     Document Type: Article

References (20)

1. Y. Zhao, et al., "Array-based evaluation of multi-dimensional queries in object-relational database system," In Proc. Int'l Conf. ICDE, 1998.
2. C. Y. Chan and Y. Ioannidis, "Bitmap index design and evaluation," In Proc. ACM SIGMOD Conference, pp. 355-366, 1998.
3. G. Colliat, "OLAP, relational and multidimensional database system," In Proc. ACM SIGMOD Record, 25(3), 1996.
4. B. D. Czejdo, et al., "Design of a data warehouse over object-oriented and dynamically evolving data sources," DEXA Workshop, pp. 128-132, 2001.
5. R. Elmasri and S. B. Navathe, Fundamentals of database Systems, Addison-wesley, 2000.
6. V. Gopalkrishnan, et al, "Star/snow-flake schema driven object-relational data warehouse design and query processing strategies," DaWaK, pp. 11-22, 1999.
7. J. Gu, et al., "OLAP++: Powerful and easy-to-use federations of OLAP and object databases," In Proc. Int'I Conf. on VLDB, pp. 599-602, 2000.
8. T. Johnson, "Performance measurements of compressed bitmap indices," In Proc. Int'I Conf. on VLDB, pp. 278-289, 1999.
9. M, Jurgens and H. J. Lenz, "Tree based indexes vs. bitmap indexes : a performance study," In Proc, Int'I Workshop on DMDW, 1999.
10. L. Do, et al., "Issues in developing very large data warehouse," In Proc. Int'I. Conf. on VLDB, pp.633-640, 1998.
11. C. Mohan, et al., "Single Table Access Using Multiple Indexes: Optimization, Execution, and Concurrency Control Techniques," In Proc. EDBT, pp. 29-43, 1990.3
12. P. O'neil and G Graefe, "Multi-table joins through bitmapped join indies," In Proc. ACM SIGMOD Record, 24(3), pp. 8-11, Sept, 1995.
13. P. O'neil and D. Quass, "Improved query performance with variant indexes," In Proc. ACM SIGMOD, pp. 38-49, 1997.
14. F. Ravat and O. Teste, "A temporal object-oriented data warehouse model," In Proc. DEXA Workshop, pp. 583-592, 2000.
15. Stanford Technology Group, "Designing the data warehouse on relational database," White Paper.
16. TPC-D, http://www.tpc.org, 2002
17. P. Valduriez, "Join indices," ACM Trans, on Database Systems, 12(2), pp.218-246, 1987.
18. K. L. Wu and P. S. Yu, Range-based bitmap indexing for high cardinality attributes with skew, Research Report, IBM Waston Research Center, May, 1996.
19. M. C. Wu and A. P. Buchmann, "Encoded bitmap indexing for data warehouses," In Proc. Int'I Conf. ICDE, 1998.
20. S. B. Yao., "Approximating block accesses in database organizations," Comm. of the ACM, 20(4), pp. 260-261, 1977.