• Title/Summary/Keyword: database table

Search Result 303, Processing Time 0.029 seconds

Mapping Design between XML and Table in Relation Database (XML과 관계 데이터베이스 자료 간의 매핑 설계)

  • Kim Gil-Choon
    • Journal of Digital Contents Society
    • /
    • v.5 no.3
    • /
    • pp.180-186
    • /
    • 2004
  • XML has an essential funtion of dealing with standardized document to be used in all academic areas and industrial areas as well as e-commerce. The transformation of XML data into Relation Database table is also necessary for data search using SQL language. Mapping relation between XMLand Table in Relation Database is required for transformation of XML. This arti치e studies the mapping relation between XML and Relation Database using DTD which enables to check the unity automatically whenever document is read so that it studied mapping design for the transformation of XML data info Relation Database table.

  • PDF

Research of organized data extraction method for digital investigation in relational database system (데이터베이스 시스템에서 디지털 포렌식 조사를 위한 체계적인 데이터 추출 기법 연구)

  • Lee, Dong-Chan;Lee, Sang-Jin
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.22 no.3
    • /
    • pp.565-573
    • /
    • 2012
  • To investigate the business corruption, the obtainments of the business data such as personnel, manufacture, accounting and distribution etc., is absolutely necessary. Futhermore, the investigator should have the systematic extraction solution from the business data of the enterprise database, because most company manage each business data through the distributed database system, In the general business environment, the database exists in the system with upper layer application and big size file server. Besides, original resource data which input by user are distributed and stored in one or more table following the normalized rule. The earlier researches of the database structure analysis mainly handled the table relation for database's optimization and visualization. But, in the point of the digital forensic, the data, itself analysis is more important than the table relation. This paper suggests the extraction technique from the table relation which already defined in the database. Moreover, by the systematic analysis process based on the domain knowledge, analyzes the original business data structure stored in the database and proposes the solution to extract table which is related incident.

DNA Chip Database for the Korean Functional Genomics Project

  • Kim, Sang-Soo
    • Proceedings of the Korean Society for Bioinformatics Conference
    • /
    • 2001.10a
    • /
    • pp.11-28
    • /
    • 2001
  • The Korean functional Genomics Project focuses on stomach and liver cancers. Specimens collected by six hospital teams are used in BNA microarray experiments. Experimental conditions, spot measurement data, and the associated clinical information are stored in a relational database. Microarray database schema was developed based on EBI's ArrayExpress. A diagrammatic representation of the schema is used to help navigate over marty tables in the database. Field description, table-to-table relationship, and other database features are also stored in the database and these are used by a PERL interface program to generate web-based input forms on the fly. As such, it is rather simple to modify the database definition and implement controlled vocabularies. This PERL program is a general-purpose utility which can be used for inputting and updating data in relational databases. It supports file upload and user-supplied filters of uploaded data. Joining related tables is implemented using JavaScripts, allowing this step to be deferred to a later stage. This feature alleviates the pain of inputting data into a multi-table database and promotes collaborative data input among several teams. Pathological finding, clinical laboratory parameters, demographical information, and environmental factors are also collected and stored in a separate database. The same PERL program facilitated developing this database and its user-interface.

  • PDF

A study on the database structure of medical records - Focusing on Yakazudōmei's medical records - (의안(醫案)의 데이터베이스 구조화 연구 - 시수도명의 의안을 중심으로 -)

  • Kim, Sung-Won;Kim, Ki-Wook;Lee, Byung-Wook
    • Herbal Formula Science
    • /
    • v.25 no.1
    • /
    • pp.39-49
    • /
    • 2017
  • Objectives : The contents of the literature associated with the medical records were entered into the database. We want to find the structure and search methods for efficient utilization of the database. Methods : The contents were entered into the database using the 'Access 2014 of the MS'. The Query Sentences were created and utilized for a search. Results : We could find information about the prescriptions, medical records and patients by the herbs and symptom combinations using the single table named 'Integrated Knowledge' and queries. Integrated Knowledge is a table that gathered patient information, prescription information and symptom information together. Conclusions : If you store patient, prescription and symptom information on a single table, you could search and use the results by various combinations of the various elements included in the table. These results could help curing patients on the basis of evidence-based treatment at the clinics.

Estimating The Number of Hierarchical Distinct Values using Arrays of Attribute Value Intervals (속성값 구간 배열을 이용한 계층 상이값 갯수의 계산 기법)

  • Song, Ha-Joo;Kim, Hyoung-Joo
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.6 no.2
    • /
    • pp.265-273
    • /
    • 2000
  • In relational database management systems(RDBMS), a table consIn relational database management systems(RDBMS), a table consists of sets of records which are composed of a set of attributes. The number of distinct values(NDV) of an attribute denotes the number of distinct attribute values that actually appear in the database records, and is widely used in optimizing queries and supporting statistic queries. Object-relational database management systems(ORBBMSS), however, support the inheritance between tables which enforces an attribute defined in a super-table to be inherited in sub-tables automatically. Hence, in ORDBMSS, not only NDV of an attribute In a single table but also NDV of an attribute in multiple tables(HNDV) is needed. In this paper, we propose a method that calculates HNDV using arrays of attribute value intervals. In this method, an array of attribute value intervals is created for an attribute of interest In each table in a table hierarchy, and HNDV can be calculated or estimated by merging the arrays of attribute value intervals. The proposed method accurately calculates HNDV using small additional storage space and is efficient for an environment where only some of the tables in a table hierarchy are frequently updated.

  • PDF

Document Structure Understanding on Subjects Registration Table

  • Ito, Yuichi;Ohno, Masanaga;Tsuruoka, Shinji;Yoshikawa, Tomohiro;Tsuyoshi, Shinogi
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2003.09a
    • /
    • pp.571-574
    • /
    • 2003
  • This research is aimed to automate the generating process of the database from paper based table forms like this work. The registration table has so complicate table structures, ana in this research we used the registration tables as an example of general table structure understanding. We propose a table structure understanding system for some table types, and it has some steps. The first step is that the document images on paper are read from the image scanner. The second step is that a document image segments into some tables. In the third step, the character strings is extracted using image processing technology and the property of the character strings is determined. And the structured database is generated automatically. The proposed system consists of two systems. "Master document generation system" is used for the table form definition, and it doesn′t include the handwritten characters. "Structure analysis system for complete d table" is used for the written form, and it analyzes the table form filled in the handwritten character. We implemented the system using MS Visual C++ on Windows, and it can get the correct extraction rate 98% among 51 registration tables written by the different students.

  • PDF

An Technique for the Active Rule Condition (능동규칙의 조건부 처리 기법)

  • 이기욱
    • Journal of the Korea Society of Computer and Information
    • /
    • v.3 no.4
    • /
    • pp.49-54
    • /
    • 1998
  • AS it takes a considerable time for database operations for processing the condition part of active rule, the operations have an important effect on the efficiency of active database system. The processing time of operations should be minimized in order to improve the efficiency of system. The previous works are limited to basic database operations and the partial aggregate functions. In this paper, the processing technique using the structuralization and the state table of relations is suggested. The processing time for basic database operations can be reduced with the structuralization of relations to classification tree and the introduction of deletion information table. With the introduction of binary search tree and relation state table, the aggregate function which has a big of processing cost can be processed effectively and the function of the active database system can be maximized.

  • PDF

A Resource Discovery with Data Dissemination over Unstructured Mobile P2P Networks

  • Bok, Kyoung-Soo;Kwak, Dong-Won;Yoo, Jae-Soo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.3
    • /
    • pp.815-834
    • /
    • 2012
  • Recently, along with the innovative development of wireless communication techniques and mobile devices, mobile P2P services in mobile wireless networks have gained a lot of attention. In this paper, we propose a resource discovery scheme with data dissemination over mobile P2P networks. In the proposed scheme, each peer manages a local information table, a resource index table, and a routing table in a local database to enhance the accuracy and cost of resource discovery. The local information table stores the status of a mobile peer, and the resource index table stores the resource information of the neighbor peers via the ranking function. The routing table is used to communicate with the neighbor peers. We use a timestamp message to determine whether or not the resource index table will be changed before the resource information is exchanged. Our ranking function considers the interest and mobility of the mobile peer and prioritizes the resource information transmitted from the neighbor peers. It is shown via various experiments that the proposed scheme outperforms the existing scheme.

A Basic Study of Food Exchange Database Construction and Search System (ENECC/E-Food Exchange) Based on Internet (인터넷 기반의 식품 교환량 데이터베이스 구축과 검색 시스템 (ENECC/E-Food Exchange)에 관한 기초 연구)

  • Hong, Sun-Myeong;Jo, Hui-Seon;Kim, Gon
    • Journal of the Korean Dietetic Association
    • /
    • v.9 no.2
    • /
    • pp.159-171
    • /
    • 2003
  • The food composition tables are frequently used to health and nutrition practices. But it is difficult to find out food exchange lists with food exchange groups in the food composition table. Over 2500 items and many kinds of nutrients are in the food composition table. But now food exchange lists are used a few foods. The internet demands the users needs for obtaining more food exchange lists and nutrient information from food composition. This basic study is to solve the users need and the supply more efficient and effective manipulation system for e-food exchange database construction and search system:ENECC/e-food exchnage(E-Nutrition Education and Couseling Center/e-food exchange). This paper introduces the food exchange database construction and search system(ENECC/e-food exchange) using the formula which calculates the food exchange quantity of 6 food exchange groups and added one extra groups(alcohol) based on the internet. The ENECC/e-food exchange database is basically based on the 6th food composition table(2001) of the National Rural Living Science Institution in Rural Development Administration, Korea. The e-food exchange database are consisted of 2,261 foods in 6 basic food groups and one extra groups by using ENECC calculating formula. Also, the e-food exchange database has the proximate composition, mineral and vitamin content such as energy, moisture, protein, fat, carbohydrate, ash, calcium, phosphorus, iron, sodium, potassium, retinol equivalent, retinol, â-carotene, thiamin, riboflavin, niacin, ascorbic acid, refuse per 100g of each food.

  • PDF

Address Permutation for Privacy-Preserving Searchable Symmetric Encryption

  • Choi, Dae-Seon;Kim, Seung-Hyun;Lee, Youn-Ho
    • ETRI Journal
    • /
    • v.34 no.1
    • /
    • pp.66-75
    • /
    • 2012
  • This paper proposes a privacy-preserving database encryption scheme that provides access pattern hiding against a service provider. The proposed scheme uses a session key to permute indices of database records each time they are accessed. The proposed scheme can achieve access pattern hiding in situations in which an adversary cannot access the inside of the database directly, by separating the entity with an index table and data table and permuting both the index and position where the data are stored. Moreover, it is very efficient since only O(1) server computation and communication cost are required in terms of the number of the data stored. It can be applied to cloud computing, where the intermediate entities such as cloud computing service provider can violate the privacy of users or patients.