메뉴 건너뛰기




Volumn 3589, Issue , 2005, Pages 64-73

Automatic selection of bitmap join indexes in data warehouses

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; DATA MINING; DATA REDUCTION; INDEXING (OF INFORMATION); QUERY LANGUAGES; RESPONSE TIME (COMPUTER SYSTEMS);

EID: 26844579684     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11546849_7     Document Type: Conference Paper
Times cited : (32)

References (20)
  • 4
  • 5
    • 0037411406 scopus 로고    scopus 로고
    • A knowledge-based approach for index selection in relational databases
    • Y. Feldman and J. Reouven. A knowledge-based approach for index selection in relational databases. Expert System with Applications, 25(1): 15-37, 2003.
    • (2003) Expert System with Applications , vol.25 , Issue.1 , pp. 15-37
    • Feldman, Y.1    Reouven, J.2
  • 7
    • 84982781755 scopus 로고
    • Adaptive and automated index selection in RDBMS
    • 3rd International Conference on Extending Database Technology (EDBT 1992), Vienna, Austria
    • M. Frank, E. Omiecinski, and S. Navathe. Adaptive and automated index selection in RDBMS. In 3rd International Conference on Extending Database Technology (EDBT 1992), Vienna, Austria, volume 580 of Lecture Notes in Computer Science, pages 277-292, 1992.
    • (1992) Lecture Notes in Computer Science , vol.580 , pp. 277-292
    • Frank, M.1    Omiecinski, E.2    Navathe, S.3
  • 12
    • 9444246959 scopus 로고    scopus 로고
    • A genetic algorithm for the index selection problem
    • Applications of Evolutionary Computing, Essex, England
    • J. Kratica, I. Ljubić, and D. Tošić. A genetic algorithm for the index selection problem. In Applications of Evolutionary Computing, Essex, England, volume 2611 of LNCS, pages 281-291, 2003.
    • (2003) LNCS , vol.2611 , pp. 281-291
    • Kratica, J.1    Ljubić, I.2    Tošić, D.3
  • 14
    • 0026826969 scopus 로고
    • Join processing in relational databases
    • P. Mishra and M. Eich. Join processing in relational databases. ACM Computing Surveys, 24(1):63-113, 1992.
    • (1992) ACM Computing Surveys , vol.24 , Issue.1 , pp. 63-113
    • Mishra, P.1    Eich, M.2
  • 16
    • 84911977993 scopus 로고    scopus 로고
    • Discovering frequent closed itemsets for association rules
    • 7th International Conference on Database Theory (ICDT 1999), Jerusalem, Israel
    • N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal. Discovering frequent closed itemsets for association rules. In 7th International Conference on Database Theory (ICDT 1999), Jerusalem, Israel, volume 1540 of LNCS, pages 398-416, 1999.
    • (1999) LNCS , vol.1540 , pp. 398-416
    • Pasquier, N.1    Bastide, Y.2    Taouil, R.3    Lakhal, L.4


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.