• Title/Summary/Keyword: Distributed Database

Search Result 598, Processing Time 0.022 seconds

Performance of Distributed Database System built on Multicore Systems

  • Kim, Kangseok
    • Journal of Internet Computing and Services
    • /
    • v.18 no.6
    • /
    • pp.47-53
    • /
    • 2017
  • Recently, huge datasets have been generating rapidly in a variety of fields. Then, there is an urgent need for technologies that will allow efficient and effective processing of huge datasets. Therefore the problems of partitioning a huge dataset effectively and alleviating the processing overhead of the partitioned data efficiently have been a critical factor for scalability and performance in distributed database system. In our work we utilized multicore servers to provide scalable service to our distributed system. The partitioning of database over multicore servers have emerged from a need for new architectural design of distributed database system from scalability and performance concerns in today's data deluge. The system allows uniform access through a web service interface to concurrently distributed databases over multicore servers, using SQMD (Single Query Multiple Database) mechanism based on publish/subscribe paradigm. We will present performance results with the distributed database system built on multicore server, which is time intensive with traditional architectures. We will also discuss future works.

Discovery Temporal Association Rules in Distributed Database (분산데이터베이스 환경하의 시간연관규칙 적용)

  • Yan Zhao;Kim, Long;Sungbo Seo;Ryu, Keun-Ho
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2004.04b
    • /
    • pp.115-117
    • /
    • 2004
  • Recently, mining far association rules in distributed database environments is a central problem in knowledge discovery area. While the data are located in different share-nothing machines, and each data site grows by time. Mining global frequent itemsets is hard and not efficient in large number of distributed sewen. In many distributed databases. time component(which is usually attached to transactions in database), contains meaningful time-related rules. In this paper, we design a new DTA(distributed temporal association) algorithm that combines temporal concepts inside distributed association rules. The algorithm confirms the time interval for applying association rules in distributed databases. The experiment results show that DTA can generate interesting correlation frequent itemsets related with time periods.

  • PDF

A simulation system for distributed database design

  • Rho, Sangkyu
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 1995.09a
    • /
    • pp.46-58
    • /
    • 1995
  • Although numerous distributed database design models and solution algorithms have been developed, very few have been validated. Validation is critical to the successful application of such models to distributed database design. In this paper, we develop a simulation system for distributed database design. We then analyze and validate an average response time model using simulation. The simulation results demonstrate that the average response time model is reasonably accurate.

  • PDF

A CALS Integrated Database Design Utilizing CORBA (CORBA 기반의 CALS 통합 데이터베이스 설계)

  • 우훈식;정석찬
    • The Journal of Society for e-Business Studies
    • /
    • v.2 no.2
    • /
    • pp.155-169
    • /
    • 1997
  • The CALS integrated database is a key information technology in which CALS implements an information sharing system to enable digital data transfers for technical and non-technical information in distributed and heterogeneous environments. Such heterogeneously distributed CALS information needs to be systematically incorporated so that it can provide a global data view for CALS users. In this paper, we investigated the technologies of CALS integrated database, and proposed a system prototype to implement an integrated data environment (IDE) utilizing distributed object environments CORBA (Common Object Request Broker Architecture).

  • PDF

Database and knowledge-base for supporting distributed intelligent product design

  • Nguyen Congdu;Ha Sungdo
    • Proceedings of the IEEK Conference
    • /
    • summer
    • /
    • pp.87-91
    • /
    • 2004
  • This research presents distributed database and knowledge-base modeling approach for intelligent product design system. The product design information in this study is described by a collection of rules and design knowledge that are utilized according to the product development procedures. In this work, a network-based architecture has been developed to enable dispersed designers to simultaneously accomplish remote design tasks. A client/server communication diagram has also been proposed to facilitate consistent primary information modeling for multi-user access and reuse of designed results. An intelligent product design system has been studied with the concepts of distributed database and network-based architecture in order to support concurrent engineering design and automatic design part assembly. The system provides the capability of composing new designs from proper design elements stored in the database and knowledge-base. The distributed intelligent product design is applied to the design of an automobile part as an example.

  • PDF

A Simulated Distributed Database System for Response Time Evaluation (응답시간평가를 위한 분산데이터베이스 시뮬레이션시스템)

  • Rho, Sang-Kyu
    • Asia pacific journal of information systems
    • /
    • v.7 no.3
    • /
    • pp.23-37
    • /
    • 1997
  • Although numerous models and solution algorithms to design efficient distributed databases have been developed, very few have been validated for their effectiveness. In this paper, we develop a simulation system which can be used to analyze and validate the average response time of distributed database designs. Our simulation system models comprehensive query processing strategies such as semijoin as well as a concurrency control mechanism We analyze and validate an average response time distributed database design model using our simulation system.

  • PDF

An Enhanced University Registration Model Using Distributed Database Schema

  • Maabreh, Khaled Saleh
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.7
    • /
    • pp.3533-3549
    • /
    • 2019
  • A big database utilizes the establishing network technology, and it became an emerging trend in the computing field. Therefore, there is a necessity for an optimal and effective data distribution approach to deal with this trend. This research presents the practical perspective of designing and implementing distributed database features. The proposed system has been establishing the satisfying, reliable, scalable, and standardized use of information. Furthermore, the proposed scheme reduces the vast and recurring efforts for designing an individual system for each university, as well as it is effectively participating in solving the course equivalence problem. The empirical finding in this study shows the superiority of the distributed system performance based on the average response time and the average waiting time than the centralized system. The system throughput also overcomes the centralized system because of data distribution and replication. Therefore, the analyzed data shows that the centralized system thrashes when the workload exceeds 60%, while the distributed system becomes thrashes after 81% workload.

Design and Implementation of Distributed In-Memory DBMS-based Parallel K-Means as In-database Analytics Function (분산 인 메모리 DBMS 기반 병렬 K-Means의 In-database 분석 함수로의 설계와 구현)

  • Kou, Heymo;Nam, Changmin;Lee, Woohyun;Lee, Yongjae;Kim, HyoungJoo
    • KIISE Transactions on Computing Practices
    • /
    • v.24 no.3
    • /
    • pp.105-112
    • /
    • 2018
  • As data size increase, a single database is not enough to serve current volume of tasks. Since data is partitioned and stored into multiple databases, analysis should also support parallelism in order to increase efficiency. However, traditional analysis requires data to be transferred out of database into nodes where analytic service is performed and user is required to know both database and analytic framework. In this paper, we propose an efficient way to perform K-means clustering algorithm inside the distributed column-based database and relational database. We also suggest an efficient way to optimize K-means algorithm within relational database.

Data Resource Management under Distributed Computing Environment (분산 컴퓨팅 환경하에서의 데이타 자원 관리)

  • 조희경;안중호
    • Proceedings of the Korea Database Society Conference
    • /
    • 1994.09a
    • /
    • pp.105-129
    • /
    • 1994
  • The information system of corporations are facing a new environment expressed by miniaturization, decentralization and Open System. It is therefore of utmost importance for corporations to adapt flexibly th such new environment by providing for corresponding changes to their existing information systems. The objectives of this study are to identify this new environment faced by today′s information system and develop effective methods for data resource management under this new environment. In this study, it is assumed that the new environment faced by information systems can be specified as Distributed Computing Environment, and in order to achieve such system, presents Client/server architecture as its representative computing structure, This study defines Client/server architecture as a computing architecture which specialize the fuctionality of the client system and the server system in order to have an application distribute and perform cooperative processing at the best platform. Furthermore, from among the five structures utilized in Client/server architecture for distribution and cooperative processing of application between server and client this study presents two different data management methods under the Client/server environment; one is "Remote Data Management Method" which uses file server or database server and. the other is "Distributed Data Management Method" using distributed database management system. The result of this study leads to the conclusion that in the client/server environment although distributed application is assumed, the data could become centralized (in the case of file server or database server) or decentralized (in the case of distributed database system) and the data management method through a distributed database system where complete responsibility and powers with respect to control of data used by the user are given not only is it more adaptable to modern flexible corporate environment, but in terms of system operation, it presents a more efficient data management alternative compared to existing data management methods in terms of cutting costs.

  • PDF

Resiliency Design of a Loosely-Coupled Database System

  • Park, Jae-Hwa;Kim, Sung-Eon
    • The Journal of Information Systems
    • /
    • v.4
    • /
    • pp.85-104
    • /
    • 1995
  • In a loosely-coupled distributed database server system, a server failure and/or a communication failure can be masked by a resiliency mechanism. Recognizing that a distributed transaction executes at several servers during its lifetime, we propose a resiliency mechanism which allows continuous transaction processing in distributed database server systems in the presence of a server failure. The resiliency mechanism for transaction processing is achieved by keeping redundant information using a primary/backup approach. The purpose of this paper is to analyze the performance improvement opportunities with the resiliency mechanism and to present the design of the proposed system.

  • PDF