Selection and pruning algorithms for bitmap index selection problem using data mining

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

Volumn 4654 LNCS, Issue , 2007, Pages 221-230

  Bellatreche, Ladjel ^a   Missaoui, Rokia ^b   Necir, Hamid ^c   Drias, Habiba ^c  

^a UNIVERSITÉ DE POITIERS   (France)

^b UNIVERSITÉ DU QUÉBEC EN OUTAOUAIS   (Canada)

^c Institut National de Formation en Informatique   (Algeria)

Author keywords

Bitmap join index; Data mining; Physical design; Pruning algorithms

Indexed keywords

ALGORITHMS; DATA MINING; OPTIMIZATION; PROBLEM SOLVING; QUERY PROCESSING;

BITMAP JOIN INDEX; PHYSICAL DESIGN; PRUNING ALGORITHMS;

INDEXING (OF INFORMATION);

EID: 38049071057     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74553-2_20     Document Type: Conference Paper

References (18)

1. Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: 20th International Conference on Very Large Data Bases (VLDB'94), pp. 487-499 (1994)
2. Aouiche, K., Boussaid, O., Bentayeb, F.: Automatic Selection of Bitmap Join Indexes in Data Warehouses. In: Tjoa, A.M., Trujillo, J. (eds.) DaWaK 2005. LNCS, vol. 3589, Springer, Heidelberg (2005)
3. Chaudhuri, S.: Index selection for databases: A hardness study and a principled heuristic solution. IEEE Transactions on Knowledge and Data Engineering 16(11), 1313-1323 (2004)
4. Chaudhuri, S., Narasayya, V.: An efficient cost-driven index selection tool for microsoft sql server. In: Proceedings of the International Conference on Very Large Databases, August 1997, pp. 146-155 (1997)
5. Fung, C.-H., Karlapalem, K., Li, Q.: Cost-driven vertical class partitioning for methods in object oriented databases. VLDB Journal 12(3), 187-210 (2003)
6. Getoor, L., Taskar, B., Koller, D.: Selectivity estimation using probabilistic models. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 461-472 (2001)
7. Golfarelli, M., Rizzi, E., Saltarelli, S.: Index selection for data warehousing. In: Proceedings 4th International Workshop on Design and Management of Data Warehouses (DMDW'2002), Toronto, Canada, pp. 33-42 (2002)
8. Han, J., Pei, J., Yin, Y.: Mining Frequent Patterns without Candidate Generation. In: Proceedings of the ACM-SIGMOD 2000 Conference, Dallas, Texas, USA, pp. 1-12 (2000)
9. Johnson, T.: Performance measurements of compressed bitmap indices. In: Proceedings of the International Conference on Very Large Databases, pp. 278-289 (1999)
10. Labio, W., Quass, D., Adelberg, B.: Physical database design for data warehouses. In: Proceedings of the International Conference on Data Engineering (ICDE) (1997)
11. Oneil, P.: Multi-table joins through bitmapped join indioces. SIGMOD 24(03) (1995)
12. Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Discovering frequent closed itemsets. In: ICDT, pp. 398-416 (1999)
13. Rizzi, S., Saltarelli, E.: View materialization vs. indexing: Balancing space constraints in data warehouse design. In: Eder, J., Missikoff, M. (eds.) CAiSE 2003. LNCS, vol. 2681, Springer, Heidelberg (2003)
14. Stöhr, T., Märtens, H., Rahm, E.: Multi-dimensional database allocation for parallel data warehouses. In: Proceedings of the International Conference on Very Large Databases, pp. 273-284 (2000)
15. Red Brick Systems. Star schema processing for complex queries. White Paper (July 1997)
16. Valduriez, P.: Join indices. ACM Transactions on Database Systems 12(2), 218-246 (1987)
17. Valentin, G., Zuliani, M., Zilio, D.C., Lohman, G.M., Skelley, A.: Db2 advisor: An optimizer smart enough to recommend its own indexes. In: ICDE 00, pp. 101-110 (2000)
18. Zaki, M.J., Hsiao, C.J.: Charm: An efficient algorithm for closed itemset mining. In: Proceeding of the 2nd SIAM International Conference on Data Mining (ICDM 02) (2002)