高技术通讯(英文版)2005,Vol.11Issue(1):51-55,5.
Efficient storage and retrieval of clustering results using relational database
Efficient storage and retrieval of clustering results using relational database
摘要
Abstract
The problem of how to efficiently store and query the clustering results was considered. Three different storage schemas for clustering results using relational database were proposed, namely, full schema (f-schema), partial schema (p-schema) and compressed schema (c-schema). At the same time, a classification for queries issued to the clustering results was also presented. Finally, we empirically studied the performance of proposed queries on different storage schemas. To our knowledge, this is the first work to address the problem.关键词
Clustering/Relational Database/Query Processing/Data MiningKey words
Clustering/Relational Database/Query Processing/Data Mining分类
信息技术与安全科学引用本文复制引用
Deng Shengchun,He Zengyou,Xu Xiaofei,Li Qinzhi..Efficient storage and retrieval of clustering results using relational database[J].高技术通讯(英文版),2005,11(1):51-55,5.基金项目
Supported by the High Technology Research and Development Programme of China (No.2002AA413310) and the IBM SUR Research Fund. (No.2002AA413310)