• Title/Summary/Keyword: Database tables

Search Result 178, Processing Time 0.075 seconds

Development of Theme Park Management Automation System Using RFID (RFID를 이용한 공원관리 자동화 시스템 개발 연구)

  • Lee, Yang-Weon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.9 no.4
    • /
    • pp.871-876
    • /
    • 2005
  • Theme park automation system is developed by using the RFID sensor reader, IIS web server, ASP.NET and MSSQL database in this paper. Its operation is that park entrance people checked automatically when he who possessed the ta8 passed the reader acquisition bound and its tag information is sent to the host computer through the RS-232 data acquisition system. Tag information and time data will be stored in the RFID database tables and reused to extract and distribute the entrance people for the purpose of each arrangement of each entertainment devices. First of all, we developed interface program between host and reader and then, programmed the related web site and database connection function using ASP.NET with $C\#$ and MSSQ. We also design and make an production of external Ant. to extend the acquisition range up to $30\~40$ cm using copper PCB plate. We confirmed the performance through the RFID test bed site.

A Design of Metadata Registry Database based on Object-Relational Transformation Methodology (객체-관계 변환 방법론 기반 메타데이터 레지스트리 데이터베이스 설계)

  • Cha, Sooyoung;Lee, Sukhoon;Jeong, Dongwon;Baik, Doo-Kwon
    • Journal of KIISE
    • /
    • v.42 no.9
    • /
    • pp.1147-1161
    • /
    • 2015
  • The ISO/IEC 11179 Metadata registry (MDR) is an international standard that was developed to register and share metadata. ISO/IEC 11179 represents an MDR as a metamodel that is an object model. However, it is difficult to develop an MDR based on ISO/IEC 11179 because the standard has no clear criteria to transform the metamodel into a database. In this paper, we suggest the design of an MDR data model that is based on object-relational transformation methodology (ORTM) for the MDR implementation. Hence, we classify the transformation methods of ORTM according to the corresponding relationships. After classification, we propose modeling rules by defining the standard use of the transformation. This paper builds the relational database tables as an implementation result of an MDR data model. Through experiments and evaluation, we verify the proposed modeling rules and evaluate the suitability of the created table structures. As the result, the proposed method shows that the table structures preserve classes and relationships of the standard metamodel well.

Development of a Zinc Database to Estimate the Zinc Intake Levels in the Korean Toddlers and Preschool Children (한국 유아의 아연 섭취 수준 평가를 위한 데이터베이스 구축)

  • Yoon, Su-In;Shim, Jae Eun
    • Korean Journal of Community Nutrition
    • /
    • v.26 no.2
    • /
    • pp.103-110
    • /
    • 2021
  • Objectives: The objective of this study was to develop a zinc database (DB) to estimate the intake levels of zinc in Korean toddlers and preschool children using the data from the Korea National Health and Nutrition Examination Survey (KNHANES). Methods: A total of 3,361 food items for the DB representing the usual diet of Korean toddlers and preschool children were selected based on KNHANES (2009~2013) and the food composition table of Rural Development Administration (RDA). The existing values of zinc in foods were collected from the latest food composition tables of RDA (9th revision) and the US Department of Agriculture (legacy release). The zinc contents were filled preferentially with these collected values. The missing values were replaced with the calculated values or imputed values using the existing values of similar food items from the data source. The zinc intake levels of Korean toddlers and preschool children were estimated using KNHANES and zinc DB Results: A total of 1,188 existing values, 412 calculated values, and 1,727 imputed values were included in the zinc DB. The mean intake levels of zinc for 1-2-year-old children and 3-5-year-olds were 5.17 ± 2.94 mg/day and 6.30 ± 2.84 mg/day, respectively. There was no significant difference in the zinc intake levels between boys and girls in each group. Conclusions: This newly developed zinc DB would be helpful to assess the zinc nutritional status and investigate the association between the zinc intakes and related health concerns in Korean toddlers and preschool children.

Damage detection in plate structures using frequency response function and 2D-PCA

  • Khoshnoudian, Faramarz;Bokaeian, Vahid
    • Smart Structures and Systems
    • /
    • v.20 no.4
    • /
    • pp.427-440
    • /
    • 2017
  • One of the suitable structural damage detection methods using vibrational characteristics are damage-index-based methods. In this study, a damage index for identifying damages in plate structures using frequency response function (FRF) data has been provided. One of the significant challenges of identifying the damages in plate structures is high number of degrees of freedom resulting in decreased damage identifying accuracy. On the other hand, FRF data are of high volume and this dramatically decreases the computing speed and increases the memory necessary to store the data, which makes the use of this method difficult. In this study, FRF data are compressed using two-dimensional principal component analysis (2D-PCA), and then converted into damage index vectors. The damage indices, each of which represents a specific condition of intact or damaged structures are stored in a database. After computing damage index of structure with unknown damage and using algorithm of lookup tables, the structural damage including the severity and location of the damage will be identified. In this study, damage detection accuracy using the proposed damage index in square-shaped structural plates with dimensions of 3, 7 and 10 meters and with boundary conditions of four simply supported edges (4S), three clamped edges (3C), and four clamped edges (4C) under various single and multiple-element damage scenarios have been studied. Furthermore, in order to model uncertainties of measurement, insensitivity of this method to noises in the data measured by applying values of 5, 10, 15 and 20 percent of normal Gaussian noise to FRF values is discussed.

A Study on Reducing Duplication Responses of Chatbot Based on Multiple Tables (다중 테이블을 활용한 챗봇의 중복 응답 감소 연구)

  • Gwon, Hyuck-Moo;Seo, Yeong-Seok
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.7 no.10
    • /
    • pp.397-404
    • /
    • 2018
  • Various applications are widely developed for smartphones to meet customer's needs. In many companies, messenger's typed interactive systems have been studied for business marketing, advertising and promotion to provide useful services for the customers. Such interactive systems are usually called as "Chatbot". In Chatbot, duplicated responses from Chatbot could occur frequently, and these make one lose interest. In this paper, we define a case that the response of Chatbot is duplicated according to the user's input, and propose a method to reduce duplicated responses of Chatbot. In the proposed method, we try to reduce duplication responses through a new duplication avoidance algorithm by building multiple tables in a database and by making combinations of user's input and its response in each table. In our experiments, the proposed method shows that duplicated responses are reduced by an average of 70%, compared with the existing method.

Developing a Dynamic Materialized View Index for Efficiently Discovering Usable Views for Progressive Queries

  • Zhu, Chao;Zhu, Qiang;Zuzarte, Calisto;Ma, Wenbin
    • Journal of Information Processing Systems
    • /
    • v.9 no.4
    • /
    • pp.511-537
    • /
    • 2013
  • Numerous data intensive applications demand the efficient processing of a new type of query, which is called a progressive query (PQ). A PQ consists of a set of unpredictable but inter-related step-queries (SQ) that are specified by its user in a sequence of steps. A conventional DBMS was not designed to efficiently process such PQs. In our earlier work, we introduced a materialized view based approach for efficiently processing PQs, where the focus was on selecting promising views for materialization. The problem of how to efficiently find usable views from the materialized set in order to answer the SQs for a PQ remains open. In this paper, we present a new index technique, called the Dynamic Materialized View Index (DMVI), to rapidly discover usable views for answering a given SQ. The structure of the proposed index is a special ordered tree where the SQ domain tables are used as search keys and some bitmaps are kept at the leaf nodes for refined filtering. A two-level priority rule is adopted to order domain tables in the tree, which facilitates the efficient maintenance of the tree by taking into account the dynamic characteristics of various types of materialized views for PQs. The bitmap encoding methods and the strategies/algorithms to construct, search, and maintain the DMVI are suggested. The extensive experimental results demonstrate that our index technique is quite promising in improving the performance of the materialized view based query processing approach for PQs.

A PIVOT based Query Optimization Technique for Horizontal View Tables in Relational Databases (관계 데이터베이스에서 수평 뷰 테이블에 대한 PIVOT 기반의 질의 최적화 방법)

  • Shin, Sung-Hyun;Moon, Yang-Sae;Kim, Jin-Ho;Kang, Gong-Mi
    • The KIPS Transactions:PartD
    • /
    • v.14D no.2
    • /
    • pp.157-168
    • /
    • 2007
  • For effective analyses in various business applications, OLAP(On-Line Analytical Processing) systems represent the multidimensional data as the horizontal format of tables whose columns are corresponding to values of dimension attributes. Because the traditional RDBMSs have the limitation on the maximum number of attributes in table columns(MS SQLServer and Oracle permit each table to have up to 1,024 columns), horizontal tables cannot be directly stored into relational database systems. In this paper, we propose various efficient optimization strategies in transforming horizontal queries to equivalent vertical queries. To achieve this goral, we first store a horizontal table using an equivalent vertical table, and then develop various query transformation rules for horizontal table queries using the PIVOT operator. In particular, we propose various alternative query transformation rules for the basic relational operators, selection, projection, and join. Here, we note that the transformed queries can be executed in several ways, and their execution times will differ from each other. Thus, we propose various optimization strategies that transform the horizontal queries to the equivalent vertical queries when using the PIVOT operator. Finally, we evaluate these methods through extensive experiments and identify the optimal transformation strategy when using the PIVOT operator.

An Online Scaling Method for Improving the Availability of a Database Cluster (데이터베이스 클러스터의 가용성 향상을 위한 온라인 확장 기법)

  • Lee, Chung-Ho;Jang, Yong-Il;Bae, Hae-Yeong
    • The KIPS Transactions:PartD
    • /
    • v.10D no.6
    • /
    • pp.935-948
    • /
    • 2003
  • An online scaling method adds new nodes to the shared-nothing database cluster and makes tables be reorganized while the system is running. The objective is to share the workload with many nodes and increase the capacity of cluster systems. The existing online scaling method, however, has two problems. One is the degradation of response time and transactions throughput due to the additional overheads of data transfer and replica's condidtency. The other is and inefficient recovery mechanism in which the overall scaling transaction is aborted by a fault. These problems deteriorate the availability of shared-nothing database cluster. To avoid the additional overheads throughout the scaling period, our scalingmethod consists of twophases : a parallel data transfer phase and a combination phase. The parallel data transferred datausing reduces the size of data transfer by dividing the data into the number of replicas. The combination phase combines the transferred datausing resources of spare nodes. Also, our method reduces the possibility of failure throughout the scaling period and improves the availability of the database cluster.

Technique for extracting reusable XML Schema from schema-less XML Documents (스키마가 없는 XML 문서에서의 재사용 가능한 XML Schema 추출 기법)

  • Cho, Jung-Gil;Koo, Yeon-Seol
    • The KIPS Transactions:PartD
    • /
    • v.10D no.4
    • /
    • pp.603-612
    • /
    • 2003
  • According to development of Web, an amount of XML documents has been increasing. So, many researches are proceeding to verify XML data coming from clients and to store or query efficiently database. In order to verify, store and query, DTD or XML Schema of XML documents is necessary. However, Schemaless XML documents couldn't be operated since they do not have either DTD or in Schema. In this paper, we extract XML schema in order to verify XML data and store or query efficiently database from either well-formed XML or XML Schemaless documents. XML Schema extracting technique which is proposed in this paper extract Schema graph using simulation and dataguide that is a extracting technique for semistructured characteristics of XML data. Also, we propose extracting technique for XML Schema using pattern tables that are considerated with Schema graph and reusability.

Evaluation of the Korean National Food Composition Tables

  • Park, Hong-Ju;Chun, Hye-Kyung;Lee, Sung-Hyeon
    • Preventive Nutrition and Food Science
    • /
    • v.9 no.2
    • /
    • pp.190-193
    • /
    • 2004
  • This review was conducted to evaluate the 'Korean Food Composition Table' and establish it as an internationally accepted database by examining its contents and evolution over time. The food composition table has been published by National Rural Living Science Institute, every 5 years, listing the nutrient content for each food, as both the raw agricultural product and processed foods, since the 1$^{st}$ edition in 1979 by RDA (Rural Development Administration). This is the basic data applied to the evaluation of the nutritional value of foods in Korea. The data is used as a useful tool in many fields, not only for the establishment of the National Food Supply Plan but also for nutritional research, the draft of National Food Policy, and in clinical and epidemiological research. The database is also utilized by food service providers and food processors, etc. Consumers and the international society have been interested in the quality and safety of foods and raw agricultural products. As these data expand in volume, the type of foods included in the composition table is expanded to cover new additions for the convenience of users of the 'Nutrient Data Base' as judged by the publishers. The form of these reports varies, according to the current information, from a simple booklet to CD-ROM and to the Web service. We expect to continue to make improvements in the National Standard Table for food composition through expanding both the quantity and quality of data in an orderly manner. This effort can help food composition data to be comprehensively developed systematically and gradually at the national level.l.