• Title/Summary/Keyword: Distributed Data

Search Result 5,976, Processing Time 0.032 seconds

Content-search in Distributed Environment Using Standard Product Model (STEP) (분산환경에서 표준제품모델(STEP)을 이용한 내용검색)

  • 손정모;유상봉;김영호;이수홍
    • Korean Journal of Computational Design and Engineering
    • /
    • v.4 no.4
    • /
    • pp.285-294
    • /
    • 1999
  • This paper presents a content-search system built on distributed environments using the open product model of STEP, The content-search system searches design data for given product descriptions such as part name and features. Distribute object interfaces has been defined by IDL and distributed product data are searched through CORBA protocols. Web interfaces are also provided for interactive user interfaces. Given a user request, a mediator interacts with distributed search servers and sends collected results back to the user. The mediator has such metadata as location, program name, and other information about product data stored on distributed system. The search servers use SDAI interfaces to search STEP files or databases. The content-search system promotes the reuse of previous design within a company and the outsourcing of part designs.

  • 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.

A Synchronizing Agent in Distributed Database using XMDR (XMDR을 이용한 분산 DB의 동기화 에이전트)

  • Kook Youn-Gyou;Jung Gye-Dong;Choi Yung-Geun
    • The KIPS Transactions:PartA
    • /
    • v.12A no.1 s.91
    • /
    • pp.31-40
    • /
    • 2005
  • In this paper, we propose XMDR(XML Metadata Registry) to guarantee the interoperability of data in distributed database, and describe a data synchronizing agent system using it. The proposal of XMDR is to solve the data heterogeneity problem in the sharing and exchanging data. Data heterogeneity problem is generated by different definition or mismatching expression of the same information. Therefore, we define XMDR with XML document by analyzing data elements based on MDR specification. The proposed synchronizing agent system using XMDR not only solves data heterogeneity for data interoperability in synchronizing data but also provides more efficient the agent system by offering errors of low frequency in the number of systems and requests of synchronizing data.

A Secure Healthcare System Using Holochain in a Distributed Environment

  • Jong-Sub Lee;Seok-Jae Moon
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.15 no.4
    • /
    • pp.261-269
    • /
    • 2023
  • We propose to design a Holochain-based security and privacy protection system for resource-constrained IoT healthcare systems. Through analysis and performance evaluation, the proposed system confirmed that these characteristics operate effectively in the IoT healthcare environment. The system proposed in this paper consists of four main layers aimed at secure collection, transmission, storage, and processing of important medical data in IoT healthcare environments. The first PERCEPTION layer consists of various IoT devices, such as wearable devices, sensors, and other medical devices. These devices collect patient health data and pass it on to the network layer. The second network connectivity layer assigns an IP address to the collected data and ensures that the data is transmitted reliably over the network. Transmission takes place via standardized protocols, which ensures data reliability and availability. The third distributed cloud layer is a distributed data storage based on Holochain that stores important medical information collected from resource-limited IoT devices. This layer manages data integrity and access control, and allows users to share data securely. Finally, the fourth application layer provides useful information and services to end users, patients and healthcare professionals. The structuring and presentation of data and interaction between applications are managed at this layer. This structure aims to provide security, privacy, and resource efficiency suitable for IoT healthcare systems, in contrast to traditional centralized or blockchain-based systems. We design and propose a Holochain-based security and privacy protection system through a better IoT healthcare system.

A Study for Algorithm of Safe Transmission in Distributed Network (분산 네트워크에서 안전한 전송을 위한 알고리즘에 관한 연구)

  • Kim, Tae-Kyung;Seo, Hee-Suk;Lee, Dong-Young
    • Journal of the Korea Society for Simulation
    • /
    • v.18 no.1
    • /
    • pp.35-40
    • /
    • 2009
  • The reliability of processing the distributed application becomes more and more important issues in distributed network as the usage of distributed network increases. Because the distributed network applications are processed in the available resources of Internet. It is important factors that the user can efficiently access the available resources and processed results can be delivered to the user of job request. Therefore in this paper, we suggested the survivability factor for sending data safely whether it can be efficiently accessed between the user and available resource which processes the distributed application. And evaluated the performance of the suggested factor using the data transmission time. Also we suggested the transmission algorithm for safe transmission using the survivability factor.

Development of a Privacy-Preserving Big Data Publishing System in Hadoop Distributed Computing Environments (하둡 분산 환경 기반 프라이버시 보호 빅 데이터 배포 시스템 개발)

  • Kim, Dae-Ho;Kim, Jong Wook
    • Journal of Korea Multimedia Society
    • /
    • v.20 no.11
    • /
    • pp.1785-1792
    • /
    • 2017
  • Generally, big data contains sensitive information about individuals, and thus directly releasing it for public use may violate existing privacy requirements. Therefore, privacy-preserving data publishing (PPDP) has been actively researched to share big data containing personal information for public use, while protecting the privacy of individuals with minimal data modification. Recently, with increasing demand for big data sharing in various area, there is also a growing interest in the development of software which supports a privacy-preserving data publishing. Thus, in this paper, we develops the system which aims to effectively and efficiently support privacy-preserving data publishing. In particular, the system developed in this paper enables data owners to select the appropriate anonymization level by providing them the information loss matrix. Furthermore, the developed system is able to achieve a high performance in data anonymization by using distributed Hadoop clusters.

Development of System Architecture and Communication Protocol for Unmanned Ground Vehicle (무인자율주행차량의 시스템 아키텍쳐 및 통신 프로토콜 설계)

  • Moon, Hee-Chang;Woo, Hoon-Je;Kim, Jung-Ha
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.14 no.9
    • /
    • pp.873-880
    • /
    • 2008
  • This paper deals with the peer-to-peer data communication to connect each distributed levels of developed unmanned system according to the JAUS. The JAUS is to support the acquisition of unmanned system by providing a mechanism for reducing system life-cycle costs. Each of distributed levels of the JAUS protocol divides into a system, some of subsystems, nodes and components/instances, each of which may be independent or interdependence. We have to distribute each of the levels because high performance is supported in order to create several sub-processor computing data in one processor with high CPU speed performance. To complement such disadvantage, we must think the concept that a distributed processing agrees with separating each of levels from the JAUS protocol. Therefore, each of distributed independent levels send data to another level and then it has to be able to process the received data in other levels. So, peer-to-peer communication has to control a data flow of distributed levels. In this research, we explain each of levels of the JAUS and peer-to-peer communication structure among the levels using our developed unmanned ground vehicle.

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

Web-Based Distributed Visualization System for Large Scale Geographic Data (대용량 지형 데이터를 위한 웹 기반 분산 가시화 시스템)

  • Hwang, Gyu-Hyun;Yun, Seong-Min;Park, Sang-Hun
    • Journal of Korea Multimedia Society
    • /
    • v.14 no.6
    • /
    • pp.835-848
    • /
    • 2011
  • In this paper, we propose a client server based distributed/parallel system to effectively visualize huge geographic data. The system consists of a web-based client GUI program and a distributed/parallel server program which runs on multiple PC clusters. To make the client program run on mobile devices as well as PCs, the graphical user interface has been designed by using JOGL, the java-based OpenGL graphics library, and sending the information about current available memory space and maximum display resolution the server can minimize the amount of tasks. PC clusters used to play the role of the server access requested geographic data from distributed disks, and properly re-sample them, then send the results back to the client. To minimize the latency happened in repeatedly access the distributed stored geography data, cache data structures have been maintained in both every nodes of the server and the client.

An Efficient Cache Management Scheme for Load Balancing in Distributed Environments with Different Memory Sizes (상이한 메모리 크기를 가지는 분산 환경에서 부하 분산을 위한 캐시 관리 기법)

  • Choi, Kitae;Yoon, Sangwon;Park, Jaeyeol;Lim, Jongtae;Lee, Seokhee;Bok, Kyoungsoo;Yoo, Jaesoo
    • KIISE Transactions on Computing Practices
    • /
    • v.21 no.8
    • /
    • pp.543-548
    • /
    • 2015
  • Recently, volume of data has been growing dramatically along with the growth of social media and digital devices. However, the existing disk-based distributed file systems have limits to their performance of data processing or data access, due to I/O processing costs and bottlenecks. To solve this problem, the caching technique is being used to manage data in the memory. In this paper, we propose a cache management scheme to handle load balancing in a distributed memory environment. The proposed scheme distributes the data according to the memory size, n distributed environments with different memory sizes. If overloaded nodes occur, it redistributes the the access time of the caching data. In order to show the superiority of the proposed scheme, we compare it with an existing distributed cache management scheme through performance evaluation.