• Title/Summary/Keyword: Read Database

Search Result 125, Processing Time 0.031 seconds

Implementation of Location-Based Traffic Information Service System (위치기반 교통정보 서비스 시스템 구현)

  • Kim, Hyeock-Jin;Jean, Byoung-Chan
    • Journal of the Korea Computer Industry Society
    • /
    • v.9 no.3
    • /
    • pp.121-128
    • /
    • 2008
  • This paper suggested a location-based traffic information service system using TPEG and GIS. Measurement technique, location server, applied service technique, and linkage technique with database were used to provide the location-based traffic information service. In particular, TPEG-RTM includes location information and load traffic message. The location information to be included in each message displayed a specific point, section or region limit of the load. Actually, because it was impossible to receive data using TPEG receiver, a proposed program included in this paper was used to produce an arbitrary database and read it, Also, TPEG event happened time was indicated on the map for matching test of a TPEG message and WGS84 coordinate, and finally it was verified with art example of a vehicle approaching to an event happened place.

  • PDF

Implementation of Concurrent Engineering for Large Assembly Design: Part(II) -Developmen of a Digital Mock-Up System for Reducin Design Changes- (부품수가 많은 조립체 설계를 위한 동시공학의 구현: Part (II) -설계 변경을 줄이기 위한 Digital Mocj-Up 시스템의 개발-)

  • 정융호
    • Korean Journal of Computational Design and Engineering
    • /
    • v.2 no.2
    • /
    • pp.103-110
    • /
    • 1997
  • In the development of large complex assembly, most design changes are from the following reasons.: 1) insufficient consideration of assembling sequence of downstream process. 2) interference and fit-up of related parts. 3) initial design changes which are not completely resolved. In order to reduce the first reason of above, the assembly-centric modeling methodology was proposed in the part (1) of the thesis. In this part (2), a Digital Mock-Up system, which is a tool to build a virtual mock-up in design stage, has been developed in order to prevent the other two reasons. The system can build a virtual assembly in various ways as followings.: 1) assembling parts which are located in user defined envelope. 2) assembling parts with the specified disciplines. 3) assembling parts that are selected in the part list. It can also make an assembly by the combination of above methods. In addition to that, it has the functions to read/write the virtual assembly and to explode parts of the assembly in desired direction. With the virtual assembly, engineers can design interference free parts without making physical mock-up. The system has been implemented with Oracle database management system in CATIA environment.

  • PDF

Design and Implementation of an Unified Cursor Considering Synchronization on the Android Mobile Platform (안드로이드 플랫폼 상에서 동기화가 고려된 통합 커서의 설계 및 구현)

  • Kim, Kyung-Hwan;Ha, Jo-Ho;Won, Jong-Pil;Lee, Uee-Song;Kim, Joo-Min;Son, Jin-Ho
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.6 no.3
    • /
    • pp.190-200
    • /
    • 2011
  • Android platform provides a content provider and a cursor mechanism to access the internal SQLite engine. Content providers not only store and retrieve data but also make it accessible to applications. Applications can only share data through content provider, since there's no common storage area that Android packages can access. Cursor is an interface that provides random read-write access to the result set returned by a database query. However, this cursor possesses two major limitations. First, a cursor does not support a join clause among cursors, since the cursor can only access a single table in the content provider. Second, the cursor is not capable of creating user-customized field in the predefined content providers. In this paper, we propose the unified cursor architecture that merges several cursors into a single virtual cursor. Cursor translation look-aside buffer (TLB), column windowing mechanism and virtual data management are the three major techniques we have adopted to implement our structure. And we also propose a delayed synchronization method between an application and a proposed unified cursor. An application can create a user-customized field and sort multiple tables using a unified cursor on Android platform.

An Interconnection Method for Streaming Framework and Multimedia Database (스트리밍 프레임워크와 멀티미디어 데이타베이스와의 연동기법)

  • Lee, Jae-Wook;Lee, Sung-Young;Lee, Jong-Won
    • Journal of KIISE:Software and Applications
    • /
    • v.29 no.7
    • /
    • pp.436-449
    • /
    • 2002
  • This paper describes on our experience of developing the Database Connector as an interconnection method between multimedia database, and the streaming framework. It is possible to support diverse and mature multimedia database services such as retrieval and join operation during the streaming if an interconnection method is provided in between streaming system and multimedia databases. The currently available interconnection schemes, however have mainly used the file systems or the relational databases that are Implemented with separated form of meta data, which deafs with information of multimedia contents, and streaming data which deals with multimedia data itself. Consequently, existing interconnection mechanisms could not come up with many virtues of multimedia database services during the streaming operation. In order to resolve these drawbacks, we propose a novel scheme for an interconnection between streaming framework and multimedia database, called the Inter-Process Communication (IPC) based Database connector, under the assumption that two systems are located in a same host. We define four transaction primitives; Read, Write, Find, Play, as well as define the interface for transactions that are implemented based on the plug-in, which in consequence can extend to other multimedia databases that will come for some later years. Our simulation study show that performance of the proposed IPC based interconnection scheme is not much far behind compared with that of file systems.

A Study for Efficient Transmission Policies using Multimedia Scenarios (멀티미디어 시나리오를 이용한 효율적인 데이터 전송 기법 연구)

  • Suh, Duk-Rok;Lee, Won-Suk
    • The Transactions of the Korea Information Processing Society
    • /
    • v.5 no.11
    • /
    • pp.2797-2808
    • /
    • 1998
  • Multimedia scenario database system is a read-only multimedia-on-demand system which transfers scenarios representing the display ordering of multimedia objects. A scenario is a graph of multimedia objects and it contains spatial, temporal and contextual information of multimedia data. By structuring multimedia objects as a scenario, it is possible to enforce their display order based on their context. Furthermore, it can provide multiple display paths as well as the sharing of objects between different scenarios. As a result, the multimedia scenario database system can perform the pre-scheduling of multimedia objects, which makes it possible to reorder the transmission order of objects in a scenario. Consequently, the overall system resource such as data buffer and network bandwidth can be highly utilized. In this paper, we discuss the requirements of structuring a scenario to design a scenario database that stores and manages multimedia scenario. Furthermore, we devise and analyze several scheduling policies based on the reordering mechanism for the objects in a scenario.

  • PDF

Large-Memory Data Processing on a Remote Memory System using Commodity Hardware (대용량 메모리 데이타 처리를 위한 범용 하드웨어 기반의 원격 메모리 시스템)

  • Jung, Hyung-Soo;Han, Hyuck;Yeom, Heon-Y.
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.34 no.9
    • /
    • pp.445-458
    • /
    • 2007
  • This article presents a novel infrastructure for large-memory database processing using commodity hardware with operating system support. We exploit inexpensive PCs and a high-speed network capable of Remote Direct Memory Access (RDMA) operations to build a new memory hierarchy between fast volatile memory and slow disk storage. The new memory hierarchy guarantees a reasonable response time, and its storage size enables us to run large-memory database systems with little performance degradation. The proposed architecture has two main components: (1) a remote memory system inside the Linux kernel to manage other computers' memory pages efficiently and (2) a remote memory pager responsible for manipulating remote read/write operations on remote memory pages. We insist that the proposed architecture is practical enough to support the rigorous demands of commercial in-memory database systems by demonstrating the performance of publicly available main-memory databases (e.g., MySQL) on our prototyped system. The experimental results show very interesting results from the TPC-C benchmark.

Implementation of Intelligent Medical Image Retrieval System HIPS (지능형 의료영상검색시스템 HIPS 구현)

  • Kim, Jong-Min;Ryu, Gab-Sang
    • Journal of Internet of Things and Convergence
    • /
    • v.2 no.4
    • /
    • pp.15-20
    • /
    • 2016
  • This paper describes the construction of knowledge data retrieval management system based on medical image CT. The developed system is aimed to improve the efficiency of the hospital by reading the medical images using the intelligent retrieval technology and diagnosing the patient 's disease name. In this study, the medical image DICOM file of PACS is read, the image is processed, and feature values are extracted and stored in the database. We have implemented a system that retrieves similarity by comparing new CT images required for medical treatment with the feature values of other CTs stored in the database. After converting 100 CT dicom provided for academic research into JPEG files, Code Book Library was constructed using SIFT, CS-LBP and K-Mean Clustering algorithms. Through the database optimization, the similarity of the new CT image to the existing data is searched and the result is confirmed, so that it can be utilized for the diagnosis and diagnosis of the patient.

Minimization of Security Policies in Database Security System applying Role-Based Access Control (역할기반 접근 제어를 적용한 데이터베이스 보안 시스템에서의 보안 정책 최소화)

  • Jung Min-A;Lee Kwang-Ho
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.9 no.6
    • /
    • pp.1364-1370
    • /
    • 2005
  • There are many security models for database systems using policy-based access control. RBAC (Role-based Access Control) is used for complementing MAC (Mandatory Access Control) and DAC (Discretionary Access Control) and is for performing flexibly security policies meet applied environment. We implemented the database security system that applies DAC, MAC, and RBAC to meet security requirements of users. However, security policies are constructed redundantly whenever security policies are needed to each user in this system. Even though the proposed security system can flexibly control more complicated 'read' access to various data sizes for individual users, it is obvious that there is a possibility that a new policy can be a duplication of existing policies. In this paper, we introduce the problem of policy duplication and propose the policy management module. With this proposed module, constructed policies are checked for duplication and deleted or merged with existing policies.

A Concurrency Control Method for Data Broadcasting in Mobile Computing Environment (이동 컴퓨팅 환경에서 데이타 방송을 위한 동시성 제어 기법)

  • 윤혜숙;김영국
    • Journal of KIISE:Databases
    • /
    • v.31 no.2
    • /
    • pp.140-149
    • /
    • 2004
  • Data broadcast has received much attention as a very efficient method for disseminating data items in mobile environment with large number of mobile clients. In this approach, a database server periodically and continuously broadcasts data items through wireless channels and clients perform read-only transactions by accessing necessary data items from the air. While broadcasting, the server must also process update transactions on the database, which raises an obstacle for client's accessing consistent data. In this research, we propose a new algorithm SCDSC(Serialization Checking with DirtySet on Commit) which is an alternative for solving the concurrency control problem efficiently. The SCDSC is a kind of optimistic concurrency control in that a client checks the consistency of data using a DirtySet as a part of data broadcast when it commits its transaction. In each broadcast cycle, the server updates and disseminates the DirtySet with newly changed data items for last few cycles in the sliding window approach. We perform an analysis and a simulation study to evaluate the performance of our SCDSC algorithm in terms of data consistency and data currency.

Search Performance Improvement of Column-oriented Flash Storages using Segmented Compression Index (분할된 압축 인덱스를 이용한 컬럼-지향 플래시 스토리지의 검색 성능 개선)

  • Byun, Siwoo
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.14 no.1
    • /
    • pp.393-401
    • /
    • 2013
  • Most traditional databases exploit record-oriented storage model where the attributes of a record are placed contiguously in hard disk to achieve high performance writes. However, for search-mostly datawarehouse systems, column-oriented storage has become a proper model because of its superior read performance. Today, flash memory is largely recognized as the preferred storage media for high-speed database systems. In this paper, we introduce fast column-oriented database model and then propose a new column-aware index management scheme for the high-speed column-oriented datawarehouse system. Our index management scheme which is based on enhanced $B^+$-Tree achieves high search performance by embedded flash index and unused space compression in internal and leaf nodes. Based on the results of the performance evaluation, we conclude that our index management scheme outperforms the traditional scheme in the respect of the search throughput and response time.