• Title/Summary/Keyword: Read Database

Search Result 124, Processing Time 0.024 seconds

A Recovery Scheme of SSD-based Databases using Snapshot Log (스냅샷 로그를 사용한 SSD 기반 데이터베이스 복구 기법)

  • Lim, Seong-Chae
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.19 no.4
    • /
    • pp.85-91
    • /
    • 2019
  • In this paper, we propose a new logging and recovery scheme that is suited for the high-performance transaction processing system base on flash memory storage. The proposed scheme is designed by considering flash's I/O characteristic of asymmetric costs between page update/read operations. That is, we substitute the costly update operation with writing and real-time usage of snapshot log, which is for the page-level physical redo. From this, we can avoid costly rewriting of a dirty page when it is evicted form a buffering pool. while supporting efficient revery procedure. The proposed scheme would be not lucrative in the case of HDD-based system. However, the proposed scheme offers the performance advance sush as a reduced number of updates and the fast system recovery time, in the case of flash storage such as SSD (solid state drive). Because the proposed scheme can easily be applied to existing systems by saving our snapshot records and ordinary log records together, our scheme can be used for improving the performance of upcoming SSD-based database systems through a tiny modification to existing REDO algorithms.

Development of Unmanned Payment System based on QR Code optimized for Non-face-to-face (비대면에 최적화된 QR 코드기반 무인 결제 시스템 개발)

  • Kim, Yeon-Woo;Hwang, Seung-Yeon;Shin, Dong-Jin;Kim, Jeong-Joon
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.22 no.4
    • /
    • pp.165-170
    • /
    • 2022
  • By reducing time spent outside, a shopping system was developed for middle-aged and elderly people who mainly use neighborhood marts and neighborhood mart managers. The main functions of this app are direct shopping and online shopping, and it was developed using QR code using Zxing library on Android and Kakao Map using Kakao API. In addition, it provides information such as payment statistics and bulletin board posts that members need through recycler view and graphs in an easy-to-read manner. Through this system, members can efficiently manage by reducing fatigue when using the mart through direct purchase using QR code and delivery through map, and reducing manpower wastage as a mart manager. Also, as a mart manager, more consumers will be able to sell more items.

Development of Daily Life Monitori ng System using RFID (RFID를 이용한 일상생활 모니터링 시스템 개발)

  • Jung, Kyung-Kwon;Park, Hyun-Sik;Choi, Woo-Seung
    • Journal of the Korea Society of Computer and Information
    • /
    • v.14 no.7
    • /
    • pp.49-56
    • /
    • 2009
  • In this paper, we present a daily activity monitoring system by using a wireless sensor network. The proposed system is installed in glove for activity monitoring. The RFID reader, to send data by using sensor network platform and RFID tag are small size, the shape of quadrangle, and operate in the frequency of 13.56 MHz. The sensor node can read RFID tags on the various objects used in daily living such as furniture, medicines, and kitchenwares. The sensor node reads the data of RFID tags, it transmits wireless packets to the sink node. The sink node sends the received packet immediately to a server system. The data from each RFID system is collected into a database, and then the data are processed to visualize the measurement of daily living activities of users. We provide a web-based monitoring system, and can see the number of RFID tag readings per day as bar charts. The result of experiments demonstrates that the way we propose can help to check the situation of life for people who live alone.

Extended Buffer Management with Flash Memory SSDs (플래시메모리 SSD를 이용한 확장형 버퍼 관리)

  • Sim, Do-Yoon;Park, Jang-Woo;Kim, Sung-Tan;Lee, Sang-Won;Moon, Bong-Ki
    • Journal of KIISE:Databases
    • /
    • v.37 no.6
    • /
    • pp.308-314
    • /
    • 2010
  • As the price of flash memory continues to drop and the technology of flash SSD controller innovates, high performance flash SSDs with affordable prices flourish in the storage market. Nevertheless, it is hard to expect that flash SSDs will replace harddisks completely as database storage. Instead, the approach to use flash SSD as a cache for harddisks would be more practical, and, in fact, several hybrid storage architectures for flash memory and harddisk have been suggested in the literature. In this paper, we propose a new approach to use flash SSD as an extended buffer for main buffer in database systems, which stores the pages replaced out from main buffer and returns the pages which are re-referenced in the upper buffer layer, improving the system performance drastically. In contrast to the existing approaches to use flash SSD as a cache in the lower storage layer, our approach, which uses flash SSD as an extended buffer in the upper host, can provide fast random read speed for the warm pages which are being replaced out from the limited main buffer. In fact, for all the pages which are missing from the main buffer in a real TPC-C trace, the hit ratio in the extended buffer could be more than 60%, and this supports our conjecture that our simple extended buffer approach could be very effective as a cache. In terms of performance/price, our extended buffer architecture outperforms two other alternative approaches with the same cost, 1) large main buffer and 2) more harddisks.

A Prosodic Study of Korean Using a Large Database (대용량 데이터베이스를 이용한 한국어 운율 특성에 관한 연구)

  • Kim Jong-Jin;Lee Sook-Hyang
    • The Journal of the Acoustical Society of Korea
    • /
    • v.24 no.2
    • /
    • pp.117-126
    • /
    • 2005
  • This study investigates the prosodic characteristics of Korean through the analysis of a large database. One female and one male speakers each read 650 sentences and they were segmentally and prosodically labeled. Statistical analyses were done on these utterances regarding the tonal pattern and the size of prosodic units, correlation between the size of higher level prosodic units and the number of lower level prosodic units. and the slope and F0 of the falling and rising contours of an accentual phrase. The results showed that the duration and the number of words and syllables of a prosodic unit were significantly different not only between speakers but also between its positions within a higher level prosodic nit. The munber of a prosodic unit showed a high correlation with the duration and the number of syllables of its higher level units. The slope of the falling contour within an accentual phrase was inversely Proportional to the number of its syllables. The slope was different depending on the first tone type of an accentual phrase, which could be explained with the F0 rising and the different amount of rising between tones when an accentual phrase starts with an H tone. The slope of the falling contour across an accentual phrase boundary showed a constant and larger value compared to one within an accentual phrase. The rising contours in the beginning and end of an accentual Phrase were similar in their slopes but they differ in the amount of F0 change : the former showed a larger amount of change. The slope of the rising contour which forms an accentual Phrase on its own was inversely Proportional to the number of its syllables.

Singing Voice Synthesis Using HMM Based TTS and MusicXML (HMM 기반 TTS와 MusicXML을 이용한 노래음 합성)

  • Khan, Najeeb Ullah;Lee, Jung-Chul
    • Journal of the Korea Society of Computer and Information
    • /
    • v.20 no.5
    • /
    • pp.53-63
    • /
    • 2015
  • Singing voice synthesis is the generation of a song using a computer given its lyrics and musical notes. Hidden Markov models (HMM) have been proved to be the models of choice for text to speech synthesis. HMMs have also been used for singing voice synthesis research, however, a huge database is needed for the training of HMMs for singing voice synthesis. And commercially available singing voice synthesis systems which use the piano roll music notation, needs to adopt the easy to read standard music notation which make it suitable for singing learning applications. To overcome this problem, we use a speech database for training context dependent HMMs, to be used for singing voice synthesis. Pitch and duration control methods have been devised to modify the parameters of the HMMs trained on speech, to be used as the synthesis units for the singing voice. This work describes a singing voice synthesis system which uses a MusicXML based music score editor as the front-end interface for entry of the notes and lyrics to be synthesized and a hidden Markov model based text to speech synthesis system as the back-end synthesizer. A perceptual test shows the feasibility of our proposed system.

An Effective Method Guaranteeing Mutual Exclusion of Lock Waiting Information for Deadlock Detection in Main Memory Databases (주기억장치 데이타베이스에서 교착 상태의 검출을 위한 락 대기 정보의 효과적인 상호 배제 기법)

  • Kim, Sang-Wook;Lee, Seung-Sun;Choi, Wan
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.24 no.7B
    • /
    • pp.1313-1321
    • /
    • 1999
  • The two-phase locking protocol(2PL) is the most widely-used concurrency control mechanism for guaranteeing logical consistency of data in a database environment where a number of transactions perform concurrently. The problem inherent in the 2PL protocol is a deadlock, where a set of transactions holding some locks indefinitely wait an additional lock that is already held by other transactions in the set. The deadlock detector is a DBMS sub-component that examines periodically whether a system is in a deadlock state based on lock waiting information of transactions. The deadlock detector and transactions execute concurrently in a DBMS and read and/or write the lock waiting information simultaneously. Since the lock waiting information is a shared one, we need an efficient method guaranteeing its physical consistency by using mutual exclusion. The efficiency of the mutual exclusion method is crucial especially in a main memory DBMS with high performance since it seriously affects the performance of an entire system. In this paper, we propose a new method that effectively guarantees physical consistency of lock waiting information. Two primary goals of our method are to minimize the processing overhead and to maximize system concurrency.

  • PDF

Evaluation Toolkit for K-FPGA Fabric Architectures (K-FPGA 패브릭 구조의 평가 툴킷)

  • Kim, Kyo-Sun
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.49 no.4
    • /
    • pp.15-25
    • /
    • 2012
  • The research on the FPGA CAD tools in academia has been lacking practicality due to the underlying FPGA fabric architecture which is too simple and inefficient to be applied for commercial FPGAs. Recently, the database of placement positions and routing graphs on commercial FPGA architectures has been built, and provided for enabling the academic development of placement and routing tools. To extend the limit of academic CAD tools even further, we have developed the evaluation toolkit for the K-FPGA architecture which is under development. By providing interface for exchanging data with a commercial FPGA toolkit at every step of mapping, packing, placement and routing in the tool chain, the toolkit enables individual tools to be developed without waiting for the results of the preceding step, and with no dependency on the quality of the results, and compared in detail with commercial tools at any step. Also, the fabric primitive library is developed by extracting the prototype from a reporting file of a commercial FPGA, restructuring it, and modeling the behavior of basic gates. This library can be used as the benchmarking target, and a reference design for new FPGA architectures. Since the architecture is described in a standard HDL which is familiar with hardware designers, and read in the tools rather than hard coded, the tools are "data-driven", and tolerable with the architectural changes due to the design space exploration. The experiments confirm that the developed library is correct, and the functional correctness of applications implemented on the FPGA fabric can be validated by simulation. The placement and routing tools are under development. The completion of the toolkit will enable the development of practical FPGA architectures which, in return, will synergically animate the research on optimization CAD tools.

Design and Implementation of the Multi-level Pre-fetch and Deferred-flush in BADA-III for GIS Applications (GIS 응용을 위한 바다-III의 다단계 사전인출과 지연쓰기의 설계 및 구현)

  • Park, Jun-Ho;Park, Sung-Chul;Shim, Kwang-Hoon;Seong, Jun-Hwa;Park, Young-Chul
    • Journal of the Korean Association of Geographic Information Studies
    • /
    • v.1 no.2
    • /
    • pp.67-79
    • /
    • 1998
  • Most GIS applications are read-intensive on a large number of spatial objects and when the spatial objects are composite objects, the contained objects within the composite objects are also accessed. In GIS applications, creation, deletion, and update operations on spatial objects occur very rarely, but once they occur they deal with a large number of spatial objects. This paper proposes the concept of the multi-level pre-fetch query to retrieve a large number of spatial objects efficiently, and the functionality of the deferred-flush on the newly created persistent objects into the database with the optimal performance, and presents the design and implementation details of those ideas into an object-oriented DBMS BADA-III while considering these characteristics of GIS applications. The multi-level pre-fetch query retrieves the objects that satisfy the query and the objects that are contained within the objects up to the level specified by users, and registers the retrieved objects on the client cache. The deferred-flush flushes a large number of composite objects that are created by the application with a minimal overhead of the server and a minimal number of communications between the client and the server. These two functionality are suitable for the applications that search or create a large number of composite objects like GIS applications.

  • PDF

2.5D Mapping Module and 3D Cloth Simulation System (2.5D Mapping 모듈과 3D 의복 시뮬레이션 시스템)

  • Kim Ju-Ri;Kim Young-Un;Joung Suck-Tae;Jung Sung-Tae
    • The KIPS Transactions:PartA
    • /
    • v.13A no.4 s.101
    • /
    • pp.371-380
    • /
    • 2006
  • This paper utilizing model picture of finished clothes in fashion design field various material (textile fabrics) doing Draping directly can invent new design, and do not produce direction sample or poetic theme width and confirm clothes work to simulation. Also, construct database about model and material image and embodied system that can confirm Mapping result by real time. And propose clothes simulation system to dress to 3D human body model of imagination because using several cloth pieces first by process to do so that can do simulation dressing abstracted poetic theme width to 3D model here. Proposed system creates 3D model who put clothes by physical simulation that do fetters to mass-spring model after read 3D human body model file and 2D foundation pattern file. System of this treatise examines collision between triangle that compose human body model for realistic simulation and triangle that compose clothes and achieved reaction processing. Because number of triangle to compose human body is very much, this collision examination and reaction processing need much times. To solve this problem, treatise that see could create realistic picture by method to diminish collision public prosecutor and reaction processing number, and could dress clothes to imagination human body model within water plant taking advantage of Octree space sharing techniques.