메뉴 건너뛰기




Volumn , Issue , 2006, Pages 503-512

Vector and matrix operations programmed with UDFs in a relational DBMS

Author keywords

Matrix; SQL; UDF; Vector

Indexed keywords

DATA MINING; LEARNING SYSTEMS; MATRIX ALGEBRA; STATISTICAL METHODS; USER INTERFACES; VECTORS;

EID: 34547629569     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1183614.1183687     Document Type: Conference Paper
Times cited : (21)

References (18)
  • 1
    • 0039253822 scopus 로고    scopus 로고
    • Finding generalized projected clusters in high dimensional spaces
    • C. Aggarwal and P. Yu. Finding generalized projected clusters in high dimensional spaces. In A CM SIGMOD Conference,pages 70-81, 2000.
    • (2000) A CM SIGMOD Conference , pp. 70-81
    • Aggarwal, C.1    Yu, P.2
  • 2
    • 0027621699 scopus 로고
    • Mining association rules between sets of items in large databases
    • R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. In ACM SIGMOD Conference,pages 207-216, 1993.
    • (1993) ACM SIGMOD Conference , pp. 207-216
    • Agrawal, R.1    Imielinski, T.2    Swami, A.3
  • 3
    • 0002550768 scopus 로고    scopus 로고
    • Scaling clustering algorithms to large databases. In ACM
    • P. Bradley, U. Fayyad, and C. Reina. Scaling clustering algorithms to large databases. In ACM KDD Conference,pages 9-15, 1998.
    • (1998) KDD Conference , pp. 9-15
    • Bradley, P.1    Fayyad, U.2    Reina, C.3
  • 5
    • 34547634319 scopus 로고    scopus 로고
    • R. Elmasri and S.B. Navathe. Fundamentals of Database Systems.Addison-Wesley, 4th edition, 2003.
    • R. Elmasri and S.B. Navathe. Fundamentals of Database Systems.Addison-Wesley, 4th edition, 2003.
  • 7
    • 85166339449 scopus 로고    scopus 로고
    • On the efficient gathering of sufficient statistics for classification from large SQL databases
    • G. Graefe, U. Fayyad, and S. Chaudhuri. On the efficient gathering of sufficient statistics for classification from large SQL databases. In ACM KDD Conference,pages 204-208, 1998.
    • (1998) ACM KDD Conference , pp. 204-208
    • Graefe, G.1    Fayyad, U.2    Chaudhuri, S.3
  • 8
    • 34547632478 scopus 로고    scopus 로고
    • T. Hastie, R. Tibshirani, and J.H. Friedman. The Elements of Statistical Learning.Springer, New York, 1st edition, 2001.
    • T. Hastie, R. Tibshirani, and J.H. Friedman. The Elements of Statistical Learning.Springer, New York, 1st edition, 2001.
  • 9
    • 0036649950 scopus 로고    scopus 로고
    • Optimizing main-memory join on modern hardware
    • S. Manegold, P.A. Boncz, and M.L. Kersten. Optimizing main-memory join on modern hardware. TKDE,14(4):709-730, 2002.
    • (2002) TKDE , vol.14 , Issue.4 , pp. 709-730
    • Manegold, S.1    Boncz, P.A.2    Kersten, M.L.3
  • 11
    • 77953991692 scopus 로고    scopus 로고
    • Horizontal aggregations for building tabular data sets
    • C. Ordonez. Horizontal aggregations for building tabular data sets. In ACM DMKD Conference,pages 35-42, 2004.
    • (2004) ACM DMKD Conference , pp. 35-42
    • Ordonez, C.1
  • 12
    • 12244284903 scopus 로고    scopus 로고
    • Programming the K-means clustering algorithm in SQL
    • C. Ordonez. Programming the K-means clustering algorithm in SQL. In ACM KDD Conference,pages 823-828, 2004.
    • (2004) ACM KDD Conference , pp. 823-828
    • Ordonez, C.1
  • 13
    • 3142729310 scopus 로고    scopus 로고
    • Vertical and horizontal percentage aggregations
    • C. Ordonez. Vertical and horizontal percentage aggregations. In A CM SIGMOD Conference,pages 866-871, 2004.
    • (2004) A CM SIGMOD Conference , pp. 866-871
    • Ordonez, C.1
  • 14
    • 0039845361 scopus 로고    scopus 로고
    • SQLEM: Fast clustering in SQL using the EM algorithm
    • C. Ordonez and P. Cereghini. SQLEM: Fast clustering in SQL using the EM algorithm. In ACM SIGMOD Conference,pages 559-570, 2000.
    • (2000) ACM SIGMOD Conference , pp. 559-570
    • Ordonez, C.1    Cereghini, P.2
  • 15
    • 0037664294 scopus 로고    scopus 로고
    • FREM: Fast and robust EM clustering for large data sets
    • C. Ordonez and E. Omiecinski. FREM: Fast and robust EM clustering for large data sets. In ACM CIKM Conference,pages 590-599, 2002.
    • (2002) ACM CIKM Conference , pp. 590-599
    • Ordonez, C.1    Omiecinski, E.2
  • 16
    • 0032094477 scopus 로고    scopus 로고
    • Integrating association rule mining with relational database systems: Alternatives and implications
    • S. Sarawagi, S. Thomas, and R. Agrawal. Integrating association rule mining with relational database systems: Alternatives and implications. In ACM SIGMOD Conference,pages 343-354, 1998.
    • (1998) ACM SIGMOD Conference , pp. 343-354
    • Sarawagi, S.1    Thomas, S.2    Agrawal, R.3
  • 17
    • 0035755681 scopus 로고    scopus 로고
    • SQL database primitives for decision tree classifiers
    • K. Sattler and O. Dunemann. SQL database primitives for decision tree classifiers. In ACM CIKM Conference,pages 379-386, 2001.
    • (2001) ACM CIKM Conference , pp. 379-386
    • Sattler, K.1    Dunemann, O.2


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