• Title/Summary/Keyword: Game Database

Search Result 116, Processing Time 0.024 seconds

A study on Modular Efficiency of game database using Excel (엑셀을 이용한 게임데이터베이스의 모듈화 효율성에 대한 연구)

  • Kim, In;Park, Chan-il
    • Proceedings of the Korean Society of Computer Information Conference
    • /
    • 2021.07a
    • /
    • pp.573-574
    • /
    • 2021
  • 본 논문에서는 게임 개발의 효율성을 증대하기 위한 데이터베이스 툴을 제안한다. 이 데이터베이스 툴은 엑셀을 기반으로 데이터의 모듈화와 VBA를 통한 자동화를 진행하여 데이터베이스 입력을 간략화 한다. 또한 별도의 스프레드시트를 통한 백업, 불러오기와 csv추출을 통해 관리적인 측면에서도 효율성을 보이게 된다. 해당 작업을 통해 실제 개발 환경에서의 실용성과 이점을 파악함과 동시에 문제파악을 통한 개선안을 낼 수 있도록 하였다. 본 논문에서는 데이터베이스 툴 설계과정에서의 이점과 전반적인 툴의 효율성에 대해 게임 개발의 관점으로 연구가 진행되었다.

  • PDF

A Design of General Communication Protocol for Online Game (온라인 게임을 위한 범용 통신 프로토콜 설계)

  • 두길수;정성종;안동언
    • Proceedings of the IEEK Conference
    • /
    • 2001.06c
    • /
    • pp.233-236
    • /
    • 2001
  • When we execute a online game in the network, a lots of game informations and user informations are transfered between game server and game clients. This information has deferent data structure and communication protocol. So, game developers will be design the communication protocols and packet structures after analyze the game. And, they will be design the database for user management. It will be lots of overload to the game developers. From a user point of view, they must be register to each game server to use several games. It is a undesible operation for the game users. This problems are solved by using the communication server which operates commonly with several game servers. Game providers can get the benefit of multiple access of users and get freedom from user management. Game users can access the several games which connected to communication server by register the communication server only. In this paper we design the communication packet and propose a communication protocol which operates on the communication server described previous.

  • PDF

A MMORPG Game Scenario Development with Script DB (스크립트 DB를 이용한 MMORPG의 게임 시나리오 개발)

  • Song, Hyun-Joo;Rhee, Dae-Woong
    • Journal of Korea Game Society
    • /
    • v.6 no.4
    • /
    • pp.89-95
    • /
    • 2006
  • The game has both directionalities that users are to choose and act accordingly. In this regard, the game scenario goes beyond just conveying the story, and trains users and guide them in playing the Same. However, this Same scenario is huge in size and every event is linked with each other so that it was rather difficult to have it made in practice. A study proposes that a script, the minimum unit, is built into a database, and based on which, quests are made, then the resulting quests are built back into a database. Scripts are classified into text, graphic and sound type and these are positioned in accordance with the quest structure. With this method, one can re-use the existing scenarios and can overcome the negatives of irregular qualities of scenarios.

  • PDF

Asymmetric distributed multi server architecture for efficient method of client connection process at online game servers (온라인게임 서버에서의 효율적인 클라이언트 접속 처리를 위한 비대칭 분산형 다중 서버 구조)

  • Hwang Doh-Yeun;Lee Nam-Jae;Kwak Hoon-Sung
    • The KIPS Transactions:PartB
    • /
    • v.12B no.4 s.100
    • /
    • pp.459-464
    • /
    • 2005
  • The online game system could be largely divided into two parts: servers and clients. Clients accesses to a game server and analyzes the packets transmitted from a server. A game server manages users information and database. U a game server allows a new client to access the server to execute a game, it should accept the access request of the new client maintaining the online connection of the existing users. In this paper, we compare Process method and Thread method within the multiple jobs process methods of a server. Then we propose an asymmetric distributed multi server architecture that is adequate to asymmetric distributed architecture that is widely applied to most game servers. The proposed asymmetric distributed multi server architecture includes login server, game server, communication server and database server to perform its own feature independently. Comparing its other architectures, it shows better performance economically and technically. Especially it improves the stability and expandability of a server.

Development of Mobile Social Network Game by using Web Service

  • An, Syoungog;Kang, ManJe;Kim, Soo Kyun
    • Journal of the Korea Society of Computer and Information
    • /
    • v.23 no.10
    • /
    • pp.81-86
    • /
    • 2018
  • In the field of mobile games, social network games are steadily increasing in market scale and public interest every year. This paper proposes a method to design a social network game, which is one of the most successful genres in mobile games. The method uses Unity3D, the most commonly used engine for mobile game development. NGUI, a versatile developmental tool of Unity3D, is used to create shops and battle UIs. This paper particularly focuses on how to use the web hosting service to search and operate the necessary data from the database in the server. In addition, the proposed social network game is easy to implement real-time battle using Animator and Raycast, and is characterized by efficient battle implementation through time delay using Coroutine function.

Multiplatform Game Development using Wire and Wireless Communication (멀티플랫폼 유무선 연동게임 개발)

  • Kang, Youn-Jun;Park, Dong-Gyu
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.4
    • /
    • pp.828-834
    • /
    • 2009
  • To get a better profit, standalone mobile game market shifts network-based mobile game. Currently, most of the game platform are separated into mobile to mobile, desktop to desktop, and console to console. Multi platform network game has a diverse problems including consistency control, object management technique, and bandwidth inconsistency. n this paper, we will introduce a multi-platform arcade game "Push-Push", which is played on desktop to mobile environment. The game guarantees realtime play between heterogeneous machine users and game item sharing between two platforms. e will focus n the issues of the 3rd generation multi platform games and propose some techniques or solving these problems. Our server database is implemented on MS SQL database, also the desktop programming tool is Visual Basic, and WIPI(Wireless Internet Platform or Interoperability) as a mobile platform.

A Study on the Influence of the Flow by the Presence and Satisfaction Factors - Focused on Online Game - (실재감요인과 만족감요인이 몰입에 미치는 영향에 관한 연구 - 온라인게임을 중심으로 -)

  • Jo, Jin-Wan;Lee, Jong-Ho
    • Proceedings of the Korea Database Society Conference
    • /
    • 2008.05a
    • /
    • pp.87-106
    • /
    • 2008
  • This study identified the properties of online game, and analyzed existing studies on the impact of the properties of online game on flow. As a result, graphics, sounds, scenarios, game speed, manipulability, and item difficulty were identified as properties of online game, which were influential factors to flow. As a result, the hypotheses on scenarios, game speed, and item difficulty were adopted as significantly influential factors to flow, Attribute of online game. Meanwhile, the hypotheses on graphics, sounds, and manipulability, which were expected to significantly impact flow, were rejected.

  • PDF

A Database Creation and Retrival Method of Feature Descriptors for Markerless Tracking (마커리스 트래킹을 위한 특징 서술자의 데이터베이스 생성 및 검색방법)

  • Yun, Yo-Seop;Kim, Tae-Young
    • Journal of Korea Game Society
    • /
    • v.11 no.3
    • /
    • pp.63-72
    • /
    • 2011
  • In this paper, we propose a novel database creation and retrieval method of feature descriptors to support real-time marker-less tracking in the augmented reality environments. Each feature descriptor is encoded by integer and multi-level database is created in order to retrieve a feature descriptor efficiently. The retrieval of a feature descriptor is performed as follows: Firstly, candidate feature descriptors are searched by traversing the multi-level database. Secondly, the euclidean distance between input feature descriptor and each candidate one is compared. The shortest one is retrieved. The proposed method is 16 ms faster than previous KD-Tree method for each feature descriptor.