메뉴 건너뛰기




Volumn , Issue , 2003, Pages 98-103

Frequent itemsets mining for database auto-administration

Author keywords

[No Author keywords available]

Indexed keywords

AUTO-ADMINISTRATION; DATA ACCESS TIME; DATABASE ADMINISTRATORS; FREQUENT ITEMSETS MININGS; INDEXING TECHNIQUES; ITEM SETS; PERFORMANCE GAIN; PERFORMANCE OPTIMIZATIONS;

EID: 19944365776     PISSN: 10988068     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IDEAS.2003.1214915     Document Type: Conference Paper
Times cited : (5)

References (22)
  • 1
    • 0027621699 scopus 로고
    • Mining association rules between sets of items in large databases
    • R. Agrawal, T. Imielinski, and A. N. Swami. Mining association rules between sets of items in large databases. SIG-MOD Record, 22(2):207-216, 1993.
    • (1993) SIG-MOD Record , vol.22 , Issue.2 , pp. 207-216
    • Agrawal, R.1    Imielinski, T.2    Swami, A.N.3
  • 6
    • 0001859670 scopus 로고    scopus 로고
    • Data mining and database systems: Where is the intersection?
    • S. Chaudhuri. Data mining and database systems: Where is the intersection? Data Engineering Bulletin, 21(1):4-8, 1998.
    • (1998) Data Engineering Bulletin , vol.21 , Issue.1 , pp. 4-8
    • Chaudhuri, S.1
  • 9
    • 84883798941 scopus 로고    scopus 로고
    • Efficient algorithms for mining inclusion dependencies
    • 8th International Conference on Extending Database Technology (EDBT 2002) Prague, Czech Republic
    • F. De Marchi, S. Lopes, and J.-M. Petit. Efficient algorithms for mining inclusion dependencies. In 8th International Conference on Extending Database Technology (EDBT 2002), Prague, Czech Republic, volume 2287 of LNCS, pages 464-476, 2002.
    • (2002) LNCS , vol.2287 , pp. 464-476
    • De Marchi, F.1    Lopes, S.2    Petit, J.-M.3
  • 10
    • 0023980306 scopus 로고
    • Physical database design for relational databases
    • S. J. Finkelstein, M. Schkolnick, and P. Tiberio. Physical database design for relational databases. TODS, 13(1):91-128, 1988.
    • (1988) TODS , vol.13 , Issue.1 , pp. 91-128
    • Finkelstein, S.J.1    Schkolnick, M.2    Tiberio, P.3
  • 11
    • 84982781755 scopus 로고
    • Adaptive and automated index selection in RDBMS
    • 3rd International Conference on Extending Database Technology (EDBT 1992) Vienna, Austria
    • M. R. Frank, E. Omiecinski, and S. B. Navathe. Adaptive and automated index selection in RDBMS. In 3rd International Conference on Extending Database Technology (EDBT 1992), Vienna, Austria, volume 580 of LNCS, pages 277-292, 1992.
    • (1992) LNCS , vol.580 , pp. 277-292
    • Frank, M.R.1    Omiecinski, E.2    Navathe, S.B.3
  • 13
    • 84937428829 scopus 로고    scopus 로고
    • Efficient discovery of functional dependencies and Armstrong relations
    • 7th International Conference on Extending Database Technology (EDBT 2000) Konstanz, Germany
    • S. Lopes, J.-M. Petit, and L. Lakhal. Efficient discovery of functional dependencies and Armstrong relations. In 7th International Conference on Extending Database Technology (EDBT 2000), Konstanz, Germany, volume 1777 of LNCS, pages 350-364, 2000.
    • (2000) LNCS , vol.1777 , pp. 350-364
    • Lopes, S.1    Petit, J.-M.2    Lakhal, L.3
  • 14
    • 84879125806 scopus 로고    scopus 로고
    • Lumigent Technologies
    • Lumigent Technologies. Log Explorer for SQL Server. http://www.lumigent. com/products/le-sql/le-sql.htm, 2002.
    • (2002) Log Explorer for SQL Server
  • 15
    • 84941188232 scopus 로고
    • Multi-table joins through bitmapped join indices
    • P. O'Neil and G. Graefe. Multi-table joins through bitmapped join indices. SIGMOD Record, 24(3):8-11, 1995.
    • (1995) SIGMOD Record , vol.24 , Issue.3 , pp. 8-11
    • O'Neil, P.1    Graefe, G.2
  • 16
    • 0031165870 scopus 로고    scopus 로고
    • Improved query performance with variant indexes
    • P. O'Neil and D. Quass. Improved query performance with variant indexes. SIGMOD Record, 26(2):38-49, 1997.
    • (1997) SIGMOD Record , vol.26 , Issue.2 , pp. 38-49
    • O'Neil, P.1    Quass, D.2
  • 17
    • 84911977993 scopus 로고    scopus 로고
    • Discovering frequent closed itemsets for association rules
    • 7th International Conference on Database Theory (ICDT1999) 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 (ICDT1999), 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
  • 18
    • 0033096890 scopus 로고    scopus 로고
    • Efficient mining of association rules using closed itemset lattices
    • N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal. Efficient mining of association rules using closed itemset lattices. Information Systems, 24(1):25-46, 1999.
    • (1999) Information Systems , vol.24 , Issue.1 , pp. 25-46
    • Pasquier, N.1    Bastide, Y.2    Taouil, R.3    Lakhal, L.4


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