• Title/Summary/Keyword: ERD(Entity Relationship Diagram)

Search Result 13, Processing Time 0.016 seconds

Design of Network-based Game Using the GoF Design Patterns

  • Kim Jong-Soo;Kim Tai-Suk
    • Journal of Korea Multimedia Society
    • /
    • v.9 no.6
    • /
    • pp.742-749
    • /
    • 2006
  • In the network-based game where it uses the Internet infrastructure, the implementation is possible with the various methods. Such Applications are developed in the multi-tired architecture. There are many cases for the server to be separated from the hardware or the software. In this case, a lot of applications make the distributed process possible and are made as the multi-tiered architecture to develop the reusability of the existing software module. Especially, it is mostly general to separate for the case of a database server to a new tier. One of the important points of multi-tiered server side applications is security and because of this, it is difficult to share the related data about the design skill. Using design patterns, it gives help in reusing the existing written-code for the design of the game that needs a lot of money and time. Design Patterns are related to the software reuse. For the development of more efficient games, if well-defined design patterns are provided to the developers, then it would make more easy advanced game API and make possible the framework for the game development based on the API Through the analysis of the general network-based game currently servicing in the Internet, in this paper, we discuss how to implement a business logic tier using database system among the server side architectures. The main objective of this article is to show an efficient APIs(Application Programming Interfaces) design method which can be used to manage the data that must be saved to the database system among the packets that client/server have to be exchange.

  • PDF

An Algorithm for Finding a Relationship Between Entities: Semi-Automated Schema Integration Approach (엔티티 간의 관계명을 생성하는 알고리즘: 반자동화된 스키마 통합)

  • Kim, Yongchan;Park, Jinsoo;Suh, Jihae
    • Journal of Intelligence and Information Systems
    • /
    • v.24 no.3
    • /
    • pp.243-262
    • /
    • 2018
  • Database schema integration is a significant issue in information systems. Because schema integration is a time-consuming and labor-intensive task, many studies have attempted to automate it. Researchers typically use XML as the source schema and leave much of the work to be done through DBA intervention, e.g., there are various naming conflicts related to relationship names in schema integration. In the past, the DBA had to intervene to resolve the naming-conflict name. In this paper, we introduce an algorithm that automatically generates relationship names to resolve relationship name conflicts that occur during schema integration. This algorithm is based on an Internet collocation and English sentence example dictionary. The relationship between the two entities is generated by analyzing examples extracted based on dictionary data through natural language processing. By building a semi-automated schema integration system and testing this algorithm, we found that it showed about 90% accuracy. Using this algorithm, we can resolve the problems related to naming conflicts that occur at schema integration automatically without DBA intervention.

Multi-threaded Web Crawling Design using Queues (큐를 이용한 다중스레드 방식의 웹 크롤링 설계)

  • Kim, Hyo-Jong;Lee, Jun-Yun;Shin, Seung-Soo
    • Journal of Convergence for Information Technology
    • /
    • v.7 no.2
    • /
    • pp.43-51
    • /
    • 2017
  • Background/Objectives : The purpose of this study is to propose a multi-threaded web crawl using queues that can solve the problem of time delay of single processing method, cost increase of parallel processing method, and waste of manpower by utilizing multiple bots connected by wide area network Design and implement. Methods/Statistical analysis : This study designs and analyzes applications that run on independent systems based on multi-threaded system configuration using queues. Findings : We propose a multi-threaded web crawler design using queues. In addition, the throughput of web documents can be analyzed by dividing by client and thread according to the formula, and the efficiency and the number of optimal clients can be confirmed by checking efficiency of each thread. The proposed system is based on distributed processing. Clients in each independent environment provide fast and reliable web documents using queues and threads. Application/Improvements : There is a need for a system that quickly and efficiently navigates and collects various web sites by applying queues and multiple threads to a general purpose web crawler, rather than a web crawler design that targets a particular site.