Parallel data mining for very large relational databases
Freitas A.A., Lavington S.H.
Data mining, or Knowledge Discovery in Databases (KDD), is of little benefit to commercial enterprises unless it can be carried out efficiently on realistic volumes of data. Operational factors also dictate that KDD should be performed within the context of standard DBMS. Fortunately, relational DBMS have a declarative query interface (SQL) that has allowed designers of parallel hardware to exploit data parallelism efficiently. Thus, an effective approach to the problem of efficient KDD consists of arranging that KDD tasks execute on a parallel SQL server. In this paper we devise generic KDD primitives, map these to SQL and present some results of running these primitives on a commercially-available parallel SQL server.
Amazon 
Barnes & Noble 
Bookshop.org 
轉換文件
更多的搜索結果
其他特權 
![Johnson T.D. — [Article] A Bayesian change-point analysis of electromyographic data: detecting muscle activation patterns and associated applications](https://s3proxy.cdn-zlib.se/covers200/collections/genesis/6bb6c4bf305e1db07e7620c50e698b092f2418bdb02dc2c98e720f99ce1340a3.jpg)
![Komarek A. — [Article] A Bayesian analysis of multivariate doubly-interval-censored dental data](https://s3proxy.cdn-zlib.se/covers200/collections/genesis/830856b920ad73e2023148e31e3dbed8436c83e0924b46d50a2088f97fd05827.jpg)
