• Title/Summary/Keyword: Read Database

Search Result 124, Processing Time 0.025 seconds

Flash-Based Two Phase Locking Scheme for Portable Computing Devices (휴대용 정보기기를 위한 플래시 기반 2단계 로킹 기법)

  • Byun Siwoo;Roh Chang-bae;Jung Myunghee
    • Journal of Information Technology Applications and Management
    • /
    • v.12 no.4
    • /
    • pp.59-70
    • /
    • 2005
  • Flash memories are one of best media to support portable computer's storages in mobile computing environment. The features of non-volatility, low power consumption, and fast access time for read operations are sufficient grounds to support flash memory as major database storage components of portable computers. However, we need to improve traditional transaction management scheme due to the relatively slow characteristics of flash operation as compared to RAM memory. in order to achieve this goal, we devise a new scheme called Flash Two Phase Locking (F2PL) scheme for efficient transaction processing. F2Pl improves transaction performance by allowing multi version reads and efficiently handling slow flash write/erase operation in lock management process. We also propose a simulation model to show the performance of F2PL. Based on the results of the performance evaluation, we conclude that F2PL scheme outperforms the traditional scheme.

  • PDF

A GIS, GPS, Database, Internet GIS $software{\copyright}$ The First Arabian GIS $Software\copyright}$

  • El-Shayal, Mohamed El-Sayed
    • Proceedings of the KSRS Conference
    • /
    • v.2
    • /
    • pp.695-697
    • /
    • 2006
  • Elshayal $Smart{\copyright}$ software is an almost First Arabian GIS $software{\copyright}$ which completely developed by Arabian developers team and independent of any commercial software package. The software current Features are View and Edit shape files, build new layers, add existing layers, remove layers, swap layers, save layers, set layer data sources, layer properties, zoom in & zoom out, pan, identify, selecting features, invert selection, show data table, data query builder, location query builder, build network, find shortest path, print map, save map image, copy map image to clipboard, save project map, edit move vertex, edit move features, snap vertexes, set vertex XY, move settings, converting coordinate system, applying VB script, copy selected features to another layer, move selected features to another layer, delete selected features, edit data table, modify table structure, edit map features, drawing new features, GPS tracking, 3D view, etc... The software expected Features are: Viewing raster image and image geo-referencing, read other map formats such as DXF Format and Tiger Line Format.

  • PDF

Flash Memory based Indexing Scheme for Embedded Information Devices (내장형 정보기기를 위한 플래시 메모리 기반 색인 기법)

  • Byun, Si-Woo;Roh, Chang-Bae;Huh, Moon-Haeng
    • Proceedings of the KIEE Conference
    • /
    • 2006.04a
    • /
    • pp.267-269
    • /
    • 2006
  • Recently, flash memories are one of best media to support portable computer's storages in mobile computing environment. The features of non-volatility, low power consumption, and fast access time for read operations are sufficient grounds to support flash memory as major database storage components of portable computers. However, we need to improve traditional Indexing scheme such as B-Tree due to the relatively slow characteristics of flash operation as compared to RAM memory. In order to achieve this goal, we devise a new indexing scheme called F-Tree. F-Tree improves tree operation performance by compressing pointers and keys in tree nodes and rewriting the nodes without a slow erase operation in node insert/delete processes.

  • PDF

F-Tree : Flash Memory based Indexing Scheme for Portable Information Devices (F-Tree : 휴대용 정보기기를 위한 플래시 메모리 기반 색인 기법)

  • Byun, Si-Woo
    • Journal of Information Technology Applications and Management
    • /
    • v.13 no.4
    • /
    • pp.257-271
    • /
    • 2006
  • Recently, flash memories are one of best media to support portable computer's storages in mobile computing environment. The features of non-volatility, low power consumption, and fast access time for read operations are sufficient grounds to support flash memory as major database storage components of portable computers. However, we need to improve traditional Indexing scheme such as B-Tree due to the relatively slow characteristics of flash operation as compared to RAM memory. In order to achieve this goal, we devise a new indexing scheme called F-Tree. F-Tree improves tree operation performance by compressing pointers and keys in tree nodes and rewriting the nodes without a slow erase operation in node insert/delete processes. Based on the results of the performance evaluation, we conclude that F-Tree indexing scheme outperforms the traditional indexing scheme.

  • PDF

Development of NFC Mobile Application for Information on Textile Materials (패션소재 정보 전달을 위한 NFC 모바일 어플리케이션 개발)

  • Park, Sohyun;Kim, Jongjun
    • Journal of Fashion Business
    • /
    • v.20 no.1
    • /
    • pp.142-156
    • /
    • 2016
  • Convergence of IT devices and fashion is enabling the industry to take fully different approaches in various areas including product planning, fabric selecting, distributing, and marketing. At the same time, it also transforms the definition of clothing itself. Convergence of IT technologies in the realm of fashion and textiles industries can create a powerful synergy through connection digital devices, such as mobile phone. In this context, this study attempts to suggest how IT technology can be efficiently harnessed through the usage of mobile devices in the planning stage of fashion materials, where the initial production plan of a clothing item is mapped out. This study ultimately aims to enhance the effectiveness of databases on fashion material information by using mobile devices to utilize NFC, an RFID technology having as much revolutionary power as Internet - which can be the convergence between IT and fashion across the software dimensions. To pursue this research, data on fashion material information regarding 200 woven fabric specimens were provided by textile companies. The information includes elements such as its composition, weight, width, yarn, density and sales report. These pieces of information were organized into a database. Drawing on this data, Android-based applications that allow smart phones to read off fabric information from NFC tags were developed for this study using two methods. The system works as follows: 1. NFC tag stickers are attached onto the hangers where 200 fabric samples are hanging. 2. The NFC tag stickers are tagged, or read off from a smart phone that support NFC functions. 3. Upon tagging, the Smart phone swiftly displays all information available on its screen - not only the aforementioned six elements, but also the image of the clothing item from the fabric in its finalized product form, and the video of the model wearing the item - for convenient view. The method harbors immense potential for the fashion industry in general, and will also be useful in those fields inside the industry that harness NFC technology.

Design of A IoT Platform Based on CQRS Pattern to Accommodate Various Requirements and Improve Data Query Performance (다양한 요구사항 수용 및 데이터 조회 성능 향상을 위한 CQRS 패턴 기반의 사물인터넷 플랫폼 설계)

  • Jeon, Cheol-Ho;Jeon, Hyeon-Sig;Park, Hyun-Ju
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.24 no.11
    • /
    • pp.1539-1545
    • /
    • 2020
  • With the advent of the ubiquitous era due to the development of science and technology in the modern society, interest in data generated in the IoT environment has increased socially. However, the existing IoT platform has difficulties in processing inquiry requests that require large amounts of throughput, such as statistical processing of large amounts of data. Accordingly, in this paper, we propose an IoT platform that can flexibly accommodate requirements for inquiry requests and improve inquiry performance. The platform proposed in this paper showed a performance improvement of about 1200 times in terms of average response time by introducing a separate read database. By separating the object model into a command side and a query side, the complexity of the object is reduced to meet the various demands on the platform. It was made to allow quick acceptance of the matter.

GEDA: New Knowledge Base of Gene Expression in Drug Addiction

  • Suh, Young-Ju;Yang, Moon-Hee;Yoon, Suk-Joon;Park, Jong-Hoon
    • BMB Reports
    • /
    • v.39 no.4
    • /
    • pp.441-447
    • /
    • 2006
  • Abuse of drugs can elicit compulsive drug seeking behaviors upon repeated administration, and ultimately leads to the phenomenon of addiction. We developed a procedure for the standardization of microarray gene expression data of rat brain in drug addiction and stored them in a single integrated database system, focusing on more effective data processing and interpretation. Another characteristic of the present database is that it has a systematic flexibility for statistical analysis and linking with other databases. Basically, we adopt an intelligent SQL querying system, as the foundation of our DB, in order to set up an interactive module which can automatically read the raw gene expression data in the standardized format. We maximize the usability of this DB, helping users study significant gene expression and identify biological function of the genes through integrated up-to-date gene information such as GO annotation and metabolic pathway. For collecting the latest information of selected gene from the database, we also set up the local BLAST search engine and non-redundant sequence database updated by NCBI server on a daily basis. We find that the present database is a useful query interface and data-mining tool, specifically for finding out the genes related to drug addiction. We apply this system to the identification and characterization of methamphetamine-induced genes' behavior in rat brain.

Sentence design for speech recognition database

  • Zu Yiqing
    • Proceedings of the KSPS conference
    • /
    • 1996.10a
    • /
    • pp.472-472
    • /
    • 1996
  • The material of database for speech recognition should include phonetic phenomena as much as possible. At the same time, such material should be phonetically compact with low redundancy[1, 2]. The phonetic phenomena in continuous speech is the key problem in speech recognition. This paper describes the processing of a set of sentences collected from the database of 1993 and 1994 "People's Daily"(Chinese newspaper) which consist of news, politics, economics, arts, sports etc.. In those sentences, both phonetic phenometla and sentence patterns are included. In continuous speech, phonemes always appear in the form of allophones which result in the co-articulary effects. The task of designing a speech database should be concerned with both intra-syllabic and inter-syllabic allophone structures. In our experiments, there are 404 syllables, 415 inter-syllabic diphones, 3050 merged inter-syllabic triphones and 2161 merged final-initial structures in read speech. Statistics on the database from "People's Daily" gives and evaluation to all of the possible phonetic structures. In this sentence set, we first consider the phonetic balances among syllables, inter-syllabic diphones, inter-syllabic triphones and semi-syllables with their junctures. The syllabic balances ensure the intra-syllabic phenomena such as phonemes, initial/final and consonant/vowel. the rest describes the inter-syllabic jucture. The 1560 sentences consist of 96% syllables without tones(the absent syllables are only used in spoken language), 100% inter-syllabic diphones, 67% inter-syllabic triphones(87% of which appears in Peoples' Daily). There are rougWy 17 kinds of sentence patterns which appear in our sentence set. By taking the transitions between syllables into account, the Chinese speech recognition systems have gotten significantly high recognition rates[3, 4]. The following figure shows the process of collecting sentences. [people's Daily Database] -> [segmentation of sentences] -> [segmentation of word group] -> [translate the text in to Pin Yin] -> [statistic phonetic phenomena & select useful paragraph] -> [modify the selected sentences by hand] -> [phonetic compact sentence set]

  • PDF

Flash-Aware Transaction Management Scheme for flash Memory Database (플래시 메모리 데이터베이스를 위한 플래시인지 트랜잭션 관리 기법)

  • Byun Si Woo
    • Journal of Internet Computing and Services
    • /
    • v.6 no.1
    • /
    • pp.65-72
    • /
    • 2005
  • Flash memories are one of best media to support portable computers in mobile computing environment. The features of non-volatility, low power consumption. and fast access time for read operations are sufficient grounds to support flash memory as major database storage components of portable computers. However. we need to Improve traditional transaction management scheme due to the relatively slow characteristics of flash operation as compared to RAM memory. In order to achieve this goal. we devise a new scheme called flash-aware transaction management (FATM). FATM improves transaction performance by exploiting SRAM and W-Cache, We also propose a simulation model to show the performance of FATM. Based on the results of the performance evaluation, we conclude that FATM scheme outperforms the traditional scheme.

  • PDF

Phantom Protection Method for Multi-dimensional Index Structures

  • Lee, Seok-Jae;Song, Seok-Il;Yoo, Jae-Soo
    • International Journal of Contents
    • /
    • v.3 no.2
    • /
    • pp.6-17
    • /
    • 2007
  • Emerging modem database applications require multi-dimensional index structures to provide high performance for data retrieval. In order for a multi-dimensional index structure to be integrated into a commercial database system, efficient techniques that provide transactional access to data through this index structure are necessary. The techniques must support all degrees of isolation offered by the database system. Especially degree 3 isolation, called "no phantom read," protects search ranges from concurrent insertions and the rollbacks of deletions. In this paper, we propose a new phantom protection method for multi-dimensional index structures that uses a multi-level grid technique. The proposed mechanism is independent of the type of the multi-dimensional index structure, i.e., it can be applied to all types of index structures such as tree-based, file-based, and hash-based index structures. In addition, it has a low development cost and achieves high concurrency with a low lock overhead. It is shown through various experiments that the proposed method outperforms existing phantom protection methods for multi-dimensional index structures.