| 注册
首页|期刊导航|高技术通讯(英文版)|Efficient storage and retrieval of clustering results using relational database

Efficient storage and retrieval of clustering results using relational database

Deng Shengchun He Zengyou Xu Xiaofei Li Qinzhi

高技术通讯(英文版)2005,Vol.11Issue(1):51-55,5.
高技术通讯(英文版)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

Deng Shengchun 1He Zengyou 1Xu Xiaofei 1Li Qinzhi2

作者信息

  • 1. Department of Computer Science and Engineering, Harbin Institute of Technology, Harbin 150001, P.R.China
  • 2. Heilongjiang Branch, Civil Aviation Administration of China, Harbin 150079, P.R.China
  • 折叠

摘要

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 Mining

Key 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)

高技术通讯(英文版)

OAEI

1006-6748

访问量0
|
下载量0
段落导航相关论文