• Title/Summary/Keyword: Data schema

Search Result 691, Processing Time 0.266 seconds

Developing a Design Support System for Database Distribution : Relational Schema as an Input (데이터베이스 분산 설계 지원 시스템 개발: 관계형 스키마를 입력으로)

  • Lee, Hui-Seok;Ji, Jeong-Kang;Kim, Tae-Hun;Yeo, Ji-Yeong
    • Asia pacific journal of information systems
    • /
    • v.6 no.1
    • /
    • pp.165-194
    • /
    • 1996
  • Data distribution is one of the most important steps in distributed database design. This paper proposes a methodology for distributing database by using a relational schema as an input. A design support system called DBDD (Database Distribution Design) is implemented within the framework of this methodology. The methodology consists of three phases such as (i) schema analysis, (ii) fragmentation, and (iii) allocation. In the schema analysis phase, all the table names are acquired from a global relational schema. In the fragmentation phase, fragments are generated according to transaction retrieval patterns. Furthermore, DBDD enhances the design quality by allocating fragments in a progressive manner. A real-life case is illustrated to demonstrate the practical usefulness of the DBDD.

  • PDF

An XML Schema-based Semantic Data Integration (XML Schema기반 시맨틱 데이터 통합)

  • Kim Dong-Kwang;Jeong Karp-Joo;Shin Hyo-Seop;Hwang Sun-Tae
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2006.06a
    • /
    • pp.244-246
    • /
    • 2006
  • 최근 들어서 생물학, 건설, 토목, 의학, 화학, 항공 등 다양한 과학 분야에서 효율적인 공동 연구를 돕기 위해서 그리드 기반 데이터 통합을 위한 많은 연구가 진행되고 있다. 하지만 각 분야에서 사용하는 이질적인 형식의 데이터를 원활히 통합하는 것은 매우 어려운 문제이다. 이러한 측면에서, XML은 이질적인 시스템 간 데이터 공유의 수단으로서 광범위하게 사용되고 있으나, 데이터를 의미적으로 통합하는데 에는 한계가 있다. 이 문제를 해결하기 위해서, 본 논문에서는 그리드 환경에서 XML Schema 에 기반을 둔 이질적인 데이터 소스들을 의미적으로 통합하고 검색하는 방법으로서 RDF/RDFS 기반의 온톨리지 매핑을 통한 통합 검색 방안을 제안한다. 우리가 제안하는 방법은 특히 데이터를 XML Schema를 이용해서 표현하기 때문에 원래 데이터소스에 대한 수정 없이도, XML Schema 기반의 구조적 검색뿐 아니라, 온톨로지 기반의 의미적인 데이터 통합 및 검색을 가능하게 한다. 우리는 이 방법을 토목 분야의 시스템에 적용하여 검증하였다.

  • PDF

A Study for the Message Exchange of the EVSE Communication Controller using XML Schema Transformation

  • Un, Koaunghi;Jang, Hyuksoo;Kim, Myongsoo;Kim, Hwimin
    • KEPCO Journal on Electric Power and Energy
    • /
    • v.2 no.1
    • /
    • pp.71-81
    • /
    • 2016
  • An EVSE and the EV exchange XML formatted communication messages with each other, whose structure is described by the V2G CI schema in the ISO/IEC 15118 international standard, and the EVSE and the power grid exchange messages based on SCL file with each other, whose structure is described by SCL schema in the IEC 61850 international standard. Because XML files can be restructured by XSLT, V2G messages can be transformed to/from SCL files using XSLT. In this study, the two schemas are analyzed and compared in order for the restructuring of the two differently structured XML instances. As a result, two XSL scripts can be produced for the transformation between XML files conforming ISO/IEC 15118 V2G CI schema and IEC 61850 SCL schema respectively to avoid manual data mapping which can happen in every application development cases.

An Efficient Technique for Storing XML Data Without DTD (DTD가 없는 XML 데이터의 효율적인 저장 기법)

  • Park, Gyeong-Hyeon;Lee, Gyeong-Hyu;Ryu, Geun-Ho
    • The KIPS Transactions:PartD
    • /
    • v.8D no.5
    • /
    • pp.495-506
    • /
    • 2001
  • XML makes it possible for data to be exchanged regradless of the data model in which it is represented or the platform on which it is stored, serving as a standard for data exchange format on the internet. Especially, it is natural to send XML data without DTD on the internet when XML is data-centric. Therefore it is needed to extract relational schema to store XML data efficiently, to optimize queries, and to publish data which have been stored in the relational database in the XML format. In this paper, we proposed a method to generate relational database in the XML documents without DTD and store XML data using upper/lower bound schema extraction technique for semistructured data. In extracting a lower bound schema, we especially show an efficient technique for creating relational schema by using simulation with is more advanced than the datalog method.

  • PDF

The Database Design for the Management of Bridge Measurement Information (교량 계측 정보 관리를 위한 데이터베이스 설계)

  • 황진하;박종회;조대현
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 2004.10a
    • /
    • pp.126-132
    • /
    • 2004
  • The database design for the management of bridge measurement information is presented in this paper. To express the associated data generated during the whole process of ambient measurement efficiently, requirements analysis for database construction is performed. And to define objects and organize schema conceptual and logical design are performed, which convert data model into logical schema. Finally, physical design is performed using DDL(data defined language). This database is based on the object-relational data modeling approach that has rich expressive power and good reusability in comparison with the traditional entity-relational modeling.

  • PDF

An Extended Dynamic Schema for Storing Semi-structured Data

  • Nakata, Mitsuru;Ge, Qi-Wei;Hochin, Teruhisa;Tsuji, Tatsuo
    • Proceedings of the IEEK Conference
    • /
    • 2002.07a
    • /
    • pp.301-304
    • /
    • 2002
  • Recently, database technologies have been used commonly. But, ordinary technologies aren't suitable to construct a complicated database such as a classical literature database or an archaeological relic's database. Because this kinds of data are semi-structured data that doesn't have regular structures, database schema can't be defined before databases. We have proposed DREAM model for semi-structured databases. In this model, a database consists of five elements and the model has operations similar to operation of set theory. And further we have introduced dynamic schema "shape" showing structure of each element. We have already realized a prototype of DBMS adopting DREAM model (DREAM DBMS) and constructing function of shapes. However, shape is imperfect to describe database structures because it can't explain nested structures of elements. In this paper, we will profuse a "shape graph"that is dynamic schema showing database structures more exactly and extend the DREAM DBMS. Further we will evaluate the performance of constructing function of shapes and shape graphs.

  • PDF

SPaRe: Efficient SQLite Recovery Using Database Schema Patterns

  • Lee, Suchul;Lee, Sungil;Lee, Jun-Rak
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.3
    • /
    • pp.1557-1569
    • /
    • 2017
  • In recent times, the Internet of Things (IoT) has rapidly emerged as one of the most influential information and communication technologies (ICT). The various constituents of the IoT together offer novel technological opportunities by facilitating the so-called "hyper-connected world." The fundamental tasks that need to be performed to provide such a function involve the transceiving, storing, and analyzing of digital data. However, it is challenging to handle voluminous data with IoT devices because such devices generally lack sufficient computational capability. In this study, we examine the IoT from the perspective of security and digital forensics. SQLite is a light-weight database management system (DBMS) used in many IoT applications that stores private information. This information can be used in digital forensics as evidence. However, it is difficult to obtain critical evidence from IoT devices because the digital data stored in these devices is frequently deleted or updated. To address this issue, we propose Schema Pattern-based Recovery (SPaRe), an SQLite recovery scheme that leverages the pattern of a database schema. In particular, SPaRe exhaustively explores an SQLite database file and identifies all schematic patterns of a database record. We implemented SPaRe on an iPhone 6 running iOS 7 in order to test its performance. The results confirmed that SPaRe recovers an SQLite record at a high recovery rate.

Appearance-Order-Based Schema Matching

  • Ding, Guohui;Cao, Keyan;Wang, Guoren;Han, Dong
    • Journal of Computing Science and Engineering
    • /
    • v.8 no.2
    • /
    • pp.94-106
    • /
    • 2014
  • Schema matching is widely used in many applications, such as data integration, ontology merging, data warehouse and dataspaces. In this paper, we propose a novel matching technique that is based on the order of attributes appearing in the schema structure of query results. The appearance order embodies the extent of the importance of an attribute for the user examining the query results. The core idea of our approach is to collect statistics about the appearance order of attributes from the query logs, to find correspondences between attributes in the schemas to be matched. As a first step, we employ a matrix to structure the statistics around the appearance order of attributes. Then, two scoring functions are considered to measure the similarity of the collected statistics. Finally, a traditional algorithm is employed to find the mapping with the highest score. Furthermore, our approach can be seen as a complementary member to the family of the existing matchers, and can also be combined with them to obtain more accurate results. We validate our approach with an experimental study, the results of which demonstrate that our approach is effective, and has good performance.

GS1 EPCIS Event Schema Design and Information operation method for Smart Livestock Barn Sensor Data (스마트축사 센서데이터에 대한 GS1 EPCIS 이벤트 스키마설계 및 정보 운용방법)

  • Woo, Sung-pil;Byun, Jae-wook;Kim, Hyun-seob;Kim, Dae-young
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2017.10a
    • /
    • pp.408-411
    • /
    • 2017
  • This paper deals with how to operate sensor data in smart livestock barn environment through EPCIS event schema design based on GS1 standard. We defines the types of sensors used in the smart livestock barn environment, describes the information using the GS1 standard identifier, standard event / master data structure, and standard interface for operating the sensor information, and stores / shares various sensor information of smart livestock barn defined in the schema structure.

  • PDF

Common XML Structure Extracting Algorithm for Applying Data Mining Techniques (데이터마이닝 기법 적용을 위한 공용 XML 구조 추출 알고리즘)

  • Jang, Min-Seok;Bang, Hyun-Jin
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • v.9 no.1
    • /
    • pp.1072-1076
    • /
    • 2005
  • Importance of XML as a target of Data Mining is growing because XML is used generally as a standard markup language for describing structured data. Especially researches have been done about extracting wanted informations by applying association rules to XML documents. But there are few development about solving the problems of method for efficiently obtaining informations from similar kinds of XML documents. To solve the problem this paper tries to suggest the method by which common XML structure is extracted form the same kinds of XML documents having a various XML schemas. The resulted schema structure is supposed to be important one as a preliminary job because it helps us to acquire the useful informations from various kinds of documents by unifying their structures.

  • PDF