• Journal of the Korea Society of Computer and Information
• /
• v.7 no.4
• /
• pp.83-88
• /
• 2002

Large sets of conceptual schema have been constructed for database design. In recent times, the need of analytic aid for schema reuse is increasing. In this paper, it is presented analysis technique of conceptual schema, and experimented schema analysis for extraction of reference schema. It is desirable for integration of related schema to have been applied in case of similarity value above 0.6. Reference schema which is created through the analysis technique enable to describe concepts of them and can be the way of schema reuse. And a feature analysis can be effective measure to set details of analytic data which is necessary for extraction of reference schema.

• Journal of Computing Science and Engineering
• /
• v.4 no.4
• /
• pp.313-349
• /
• 2010

In this paper, we study the data interoperability problem of web services in terms of XML schema compatibility. When Web Service A sends XML messages to Web Service B, A is interoperable with B if B can accept all messages from A. That is, the XML schema R for B to receive XML instances must be compatible with the XML schema S for A to send XML instances, Le., A is a subschema of B. We propose a formal model called Schema Automaton (SA) to model W3C XML Schema (XSD) and develop several algorithms to perform different XML schema computations. The computations include schema minimization, schema equivalence testing, subschema testing, and subschema extraction. We have conducted experiments on an e-commerce standard XSD called xCBL to demonstrate the practicality of our algorithms. One experiment has refuted the claim that the xCBL 3.5 XSD is backward compatible with the xCBL 3.0 XSD. Another experiment has shown that the xCBL XSDs can be effectively trimmed into small subschemas for specific applications, which has significantly reduced the schema processing time.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.278-278
• /
• 2000

In this paper, we introduce a new genetic reordering operator based on the concept of schema to solve optimization problems such as the Traveling Salesman Problem(TSP) and maximizing or minimizing functions. In particular, because TSP is a well-known combinational optimization problem andbelongs to a NP-complete problem, there is huge solution space to be searched. For robustness to local minima, the operator separates selected strings into two parts to reduce the destructive probability of good building blocks. And it applies inversion to the schema part to prevent the premature convergence. At the same time, it searches new spaces of solutions. Additionally, the non-schema part is applied to inversion for robustness to local minima. By doing so, we can preserve diversity of the distributions in population and make GA be adaptive to the dynamic environment.

• The KIPS Transactions:PartD
• /
• v.9D no.3
• /
• pp.381-388
• /
• 2002

XML documents, which are becoming new standard for expressing and exchanging data in the Internet, don't have defined schema. It is not adequate to directly apply XML documents to the existing SQL or OQL. Research on how to extract Schema for XML documents and query language is going on actively. For users' query, the results could be too tony or too less. It Is important to give the users adequate results. This paper suggests the way to extract many levelized schema according to the frequency of element occurrence in XML documents. The Schema can be reduced or extended to correspond to the users' query more flexibly.

• Journal of Internet Computing and Services
• /
• v.2 no.4
• /
• pp.11-24
• /
• 2001

XML documents found over internet are generally fairly irregular and hove no fixed schema, The SQL and OQL are not suitable for query processing in XML documents, So, there are many researches about schema extraction and query language for XML documents, We propose a schema extraction method using the frequency of label path in XML documents, Our proposed method produces multi-level schemas and those are useful for query processing.

• Proceedings of the Korea Society for Simulation Conference
• /
• 2005.11a
• /
• pp.71-76
• /
• 2005

XML is rapidly becoming one of the most widely adopted technologies for information exchange and representation on the World Wide Web. However, the large part of data is still stored in a relational database. Hence, we need to convert relational data into XML documents. The most important point of the conversion is to reflect referential integrities In relational schema model to XML schema model exactly. Until now, FT, NeT and CoT are suggested as existing approaches for conversion from the relational schema model to the XML schema model but these approaches only reflect referential integrities which are defined explicitly for conversion. In this paper, we suggest an algorithm for automatic extraction of implicit referential integrities such as foreign key constraints which is not defined explicitly in the initial relational schema model. We present translated XML documents by existing algorithms and suggested algorithms as comparison evaluation. We also compare suggested algorithm and conventional algorithms by simluation in accuracy part.

• The KIPS Transactions:PartD
• /
• v.11D no.4
• /
• pp.775-782
• /
• 2004

Recently, most of global enterprises have geographically distributed organization, thus have distributed information systems which have distributed database systems. So, it is difficult for these systems to provide common views for the application programs of end users. One of solutions to solve these difficulties is an MDBS(Multidatabase System) A method to effectively implement MDBS is a schema integration. This paper proposes a methodology for a schema integration through extraction of common similar subschemas Our methodology is consisted of 5 phases : affinity analysis, extraction of similar subschemas, decision of imtegration order, resolution of semantic conflict, and schema integration. To verify the usability of our methodology, a case study is implemented with an object of MDBS. At a result, our approach can effectively be applied to the extraction of common similar subschemas and schema integration.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.6
• /
• pp.77-86
• /
• 2008

The Web information sources can be regarded as the largest distributed database to the users. By virtually integrating the distributed information sources and regarding them as a single huge database, we can query the database to extract information. This capability is important to develop Web application programs. We have to infer a database schema from browsing-oriented Web documents in order to integrate databases. This paper presents a heuristic algorithm to infer the XML Schema fully automatically from semi-structured Web documents. The algorithm first extracts candidate pattern regions based on predefined structure-making tags, and determines a target pattern region using a few heuristic factors, and then derives XML Schema extraction rules from the target pattern region. The schema extraction rule is represented in XQuery, which makes development of various application systems possible using open standard XML tools. We also present the experimental results for several public web sources to show the effectiveness of the algorithm.

• International Journal of Internet, Broadcasting and Communication
• /
• v.9 no.2
• /
• pp.11-19
• /
• 2017

The growing use of XML markup language has made amount of heterogeneous. XML documents are widely available in the Web. As the number of applications that utilize heterogeneous XML documents grow, the importance of XML document extraction increases greatly. In this paper, we propose a XML schema conversion technique that converts reusable XML schema from XML documents. We convert the schema graph and we use the reusability pattern list. The converted XML schema is evaluated in terms of cohesion, coupling, and reusability. The converted XML schema could be used to construct databases for various fields where XML is used as an intermediation of data exchange.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2004.05b
• /
• pp.354-357
• /
• 2004

Data warehouse is subject-oriented, integrated, non-volatiled data, and it used for OLAP(On-Line Analytical Processing) the extraction of information from making decision processing. In the present, lots of study have been devoted to multidimensional modeling between OLAP operator and star schema. In this paper, the design of using the snowflake schema for object-oriented conceptual relation is more extended than using drill-across operator. The object-oriented relation schema which was not applicable has been improved through the design.