• Journal of the Korean Data and Information Science Society
• /
• v.18 no.1
• /
• pp.161-174
• /
• 2007

In this paper, we propose a high performance database cluster system called HyperDB to process OLAP queries efficiently. HyperDB is a virtual database system running on top of internet-connected PCs; the PCs are used for their own purpose at ordinary times, but they are able to participate in the database cluster system at non-office hours. We propose fully logical replication technique and optimal parallel intra-query routing technique for extensibility and performance. Experiment for TPC-R benchmark shows significant performance upgrade compared with conventional approaches.

• Proceedings of the KSRS Conference
• /
• 2007.10a
• /
• pp.591-593
• /
• 2007

This paper is to cluster the AMR (Automatic Meter Reading) data. The load survey system has been applied to record the power consumption of sampling the contract assortment in KEPRI AMR. The effect of the contract assortment change to the customer power consumption is determined by executing the clustering on the load survey results. We can supply the power to customer according to usage to the analysis cluster. The Korea a class of the electricity supply type is less than other country. Because of the Korea electricity markets exists one electricity provider. Need to further divide of electricity supply type for more efficient supply. We are found pattern that is different from supplied type to customer. Out experiment use the Clementine which data mining tools.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.2
• /
• pp.415-420
• /
• 2010

This paper describes the design overview of shared file system $SANique^{TM}$ and analyzes the performance evaluation results of I/O intensive stress test based on various cluster file system architectures. Especially, we illustrate the performance analysis for the comparison results between the $SANique^{TM}$ and the Linux file system EXT3 system that is used to generally in Unix world. In order to perform our evaluation, Oracle 10g database system is operated on the top of cluster file system, and we developed the various kinds of testing tools which are compiled by ESQL/C from Oracle. Three types of architectures are used in this performance evaluation. Those are the cluster file system $SANique^{TM}$, EXT3 and the combined architecture of $SANique^{TM}$ and EXT3. In this paper, we present that the results of $SANique^{TM}$ outperforms other cluster file systems in the overhead for providing the true sharing over the connecting server nodes.

• The KIPS Transactions:PartD
• /
• v.9D no.5
• /
• pp.801-812
• /
• 2002

On-line reorganization in a shared nothing database cluster is crucial to the performance of the database system in a dynamic environment like WWW where the number of users grows rapidly and changing access patterns may exhibit high skew. In the existing method of on-line reorganization have a drawback that needs excessive data migrations in case more than two nodes within a cluster have overload at the same time. In this paper, we propose an advanced B$^{+}$ tree based on-line reorganization method that solves data skew on multi-nodes. Our method facilitates fast and efficient data migration by including spare nodes that are added to cluster through on-line scaling. Also we apply CSB$^{+}$ tree (Cache Sensitive B$^{+}$ tree) to our method instead of B$^{+}$ tree for fast select and update queries. We conducted performance study and implemented the method on Ultra Fault-Tolerant Database Cluster developed for high scalability and availability. Empirical results demonstrate that our proposed method is indeed effective and fast than the existing method. method.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2000.11a
• /
• pp.205-208
• /
• 2000

Conventional database retrieval system have problems of being able to select data out of database only if the data exactly equal to retrieval conditions offered by users. If there are no data in database which exactly equal to users retrieval conditionals, the system can not provide adequate data. To solve these problems, cluster increase of FCM and re-initialization of algorithm were suggested in this study. And by interlocking knowledge-based database, built with FCM, to image database, new retrieval system was built to provide the data which are most appropriate for the requirement of users. We applied this new retrieval system to gift selection database system in pamphlet of mail order, and confirmed its effectiveness.

• Journal of The Korean Astronomical Society
• /
• v.29 no.spc1
• /
• pp.55-56
• /
• 1996

In order to investigate the spatial orientation of the spin vectors of galaxies in the Virgo cluster, we carried out a detailed identification of all the certain and possible member disk galaxies with four UK Schmidt Telescope (UKST) III a-j direct plates digitized by the Automated Plate Measuring System (APM). As a result, a relatively large and complete database with no selection effect of the member galaxies has been established. We provide the APM measured values of the position angle (P.A.) and diameters at the isophotal level of 24.5 $m_j / arcsec^2$. Based on this newly generated database, an initial study on the spatial orientation of the spin vectors of galaxies in the Virgo cluster is shown.

• The KIPS Transactions:PartD
• /
• v.10D no.4
• /
• pp.591-602
• /
• 2003

Delay and discontinuance phenomenon of service are cause by sudden increase of the network communication amount and the quantity consumed of resources when Internet users are driven excessively to a conventional single large database sewer. To solve these problems, spatial database cluster consisted of several single nodes on high-speed network to offer high-performance is risen. But, research about spatial join operation that can reduce the performance of whole system in case process at single node is not achieved. So, in this paper, we propose efficient parallel spatial join processing method in a spatial database cluster system that uses data partitions and replications method that considers the characteristics of space data. Since proposed method does not need the creation step and the assignment step of tasks, and does not occur additional message transmission between cluster nodes that appear in existent parallel spatial join method, it shows performance improvement of 23% than the conventional parallel R-tree spatial join for a shared-nothing architecture about expensive spatial join queries. Also, It can minimize the response time to user because it removes redundant refinement operation at each cluster node.

• Journal of KIISE:Databases
• /
• v.32 no.2
• /
• pp.142-150
• /
• 2005

A shared disks (SD) cluster couples multiple computing nodes, and every node shares a common database at the disk level. A great deal of research indicates that the SD cluster is suitable to high performance transaction processing, but the aggregation of SD cluster with real-time processing has not been investigated at all. A real-time transaction has not only ACID properties of traditional transactions but also time constraints. By adopting cluster technology, the real-time services will be highly available and can exploit inter-node parallelism. In this paper, we first develop an experiment model of an SD-based real-time database system (SD-RTDBS). Then we investigate the feasibility of real-time transaction processing in the SD cluster using the experiment model. We also evaluate the cross effect of real-time transaction processing algorithms and SD cluster algorithms under a wide variety of database workloads.

• Journal of Integrative Natural Science
• /
• v.7 no.1
• /
• pp.57-61
• /
• 2014

This study measured the stream data from the several sensors, and stores the database in MapReduce framework environment, and it aims to design system with the small performance and cluster analysis error rate through the KMSVM algorithm. Through the KM-SVM algorithm, the cluster analysis effective data was used for U-health system. In the results of experiment by using 2003 data sets obtained from 52 test subjects, the k-NN algorithm showed 79.29% cluster analysis accuracy, K-means algorithm showed 87.15 cluster analysis accuracy, and SVM algorithm showed 83.72%, KM-SVM showed 90.72%. As a result, the process speed and cluster analysis effective ratio of KM-SVM algorithm was better.

• Journal of Korea Spatial Information System Society
• /
• v.6 no.1 s.11
• /
• pp.3-17
• /
• 2004

With the rapid growth of the Internet geographic information services through the WWW such as a location-based service and so on. Web GISs (Geographic Information Systems) have also come to be a cluster-based architecture like most other information systems. That is, in order to guarntee high quality of geographic information service without regard to the rapid growth of the number of users, web GISs need cluster-based architecture that will be cost-effective and have high availability and scalability. This paper proposes the design of the cluster-based web GIS with high availability and scalability. For this, each node within a cluster-based web GIS consists of main memory spatial databases which accomplish role of caching by using data declustering and the locality of spatial query. Not only simple region queries but also the proposed system processed spatial join queries effectively. Compare to the existing method. Parallel R-tree spatial join for a shared-Nothing architecture, the result of simulation experiments represents that the proposed spatial join method achieves improvement of performance respectively 23% and 30% as data quantity and nodes of cluster become large.