• Proceedings of the Korea Database Society Conference
• /
• 한국데이타베이스학회 2000년도 추계학술대회 E-Business와 정보보안
• /
• pp.95-100
• /
• 2000

사실 표준 XQL(XML Query Language) 기반의 문서 질의를 이용하여 XML 문서에 대한 구조 검색과 내용 검색을 위한 문서검색 시스템을 구성하였다. 즉 XML 문서를 파징하여 내용 및 구조 정보를 트리구조로 구성하고, 표준 XQL을 이용하여 트리 구조 정보에 질의함으로서 구조 및 내용 검색을 하도록 구현하였다. 이를 이용한 응용분야로는 향후 방대한 크기의 XML문서 검색과 문서 관리, 전자 상거래 등 다양한 분야에 활용될 수 있는 요소기술로서 기대된다.

• Proceedings of the Korean Information Science Society Conference
• /
• 한국정보과학회 2003년도 봄 학술발표논문집 Vol.30 No.1 (A)
• /
• pp.545-547
• /
• 2003

본 논문에서는 Edge-Labeled Graph에 기반하여 XML 인스턴스들을 관계형 데이터베이스(RDB)로 저장하는 모델을 제안하고 구현한다. 저장되는 XML 인스턴스들은 Edge-Libeled Graph에 기반 한 Data Graph로 표현되고 이를 이용하여 데이터 경로(Data Path), 요소(Element), 속성(Attribute), 테이블 인덱스(Table Index) 테이블에 정의된 값들이 추출된 후 Napper를 이용하여 데이터베이스 스키마를 정의하고 추출된 값들을 저장한다. 그리고, RDB 저장 모델은 질의를 지원하기 위해, XPATH를 따르는 질의 언어로 사용되는 XQL을 SQL로 변환하는 변환기를 제공하며, 또한 저장된 XML 인스턴스를 복원하는 DBtoXML 처리기를 갖도록 하였다. 구현 결과, XML 인스턴스들과 RDB 구조로의 저장 관계가 그래프(Graph) 기반의 경로(Path)를 이용한 표현으로 가능했으며, 동시에, 특정 요소 (Element) 또는 속성(Attribute)들의 정보들을 쉽게 검색할 수 있는 가능성을 보였다.

• Journal of KIISE:Software and Applications
• /
• 제33권9호
• /
• pp.810-821
• /
• 2006

As XML is widely used across the computer related fields, and it costs expensive for its compiler, the study on the automatic generation of the compiler is becoming important. In addition, though the XMLSchema became a standard, there have been few works on the automatic compiler generation for XML applications based on the XMLSchema. In this paper, we introduce a method that we can automatically generate a compiler for an XML application based on the XMLSchema. Our XML compiler generator uses data type information in XMLSchema document and semantic information in another file and produces semantic classes and a compiler for the XML application. The compiler parses an XML document, builds a tree in which each node is an instance of semantic class, and processes the document through the traversal of the tree.

• Journal of KIISE:Computing Practices and Letters
• /
• 제14권7호
• /
• pp.680-693
• /
• 2008

Recent studies on XML filtering assume that all data sources follow a single global schema defined in a filtering system. However, beyond this simple assumption, a filtering system can provide a service that allows data publishers to have their own schema; hence, the data sources will become heterogeneous. The number of data sources is expected to be large in a filtering system and the data sources are frequently published, updated, and disappeared, that is, dynamic. In this paper, we introduce implementing a simple and efficient XPath query translation method for such a dynamic environment. The method is especially targeted for a query which is composed based only on users' knowledge and experience without a graphical guidance of the global schema. When a user queries a large number of heterogeneous data, there is a high possibility that the query is not consistent with the same local schema assumed by the user. Our query translation method also supports a function for this problem. Some experimental results for query translation performance have shown that our method has reasonable performance, and is more practical than the existing method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• 제30권8B호
• /
• pp.549-561
• /
• 2005

As Internet and network technologies have been developed, e-commerces are getting more complex and more various. This paper, for meta-data and data exchange between heterogeneous database systems, uses XML schema proposed in W3C, and XML schema can present meta-data and data of relational database system as XML document format which is structural. It supports various primitive data formats, so that it uses the structure which reflects adequately data formats which relational database system offered. However, current e-commerces use heterogeneous platforms, so difficulties that is mutual interchange and management exist. For the solution for these problems, a standard ontology which defines relations of product classifications and the standard of property expression and the location ontology which offers e-commerce's information about products are constructed. Applying these ontology information to search system, by offering information which customers need efficient search is performed. Combining these ontologies and product classification category information, called XMDR, this XMDR is introduced into product search system, so this paper proposes to construct ontology server method for efficient search.

• Journal of Korea Multimedia Society
• /
• 제7권9호
• /
• pp.1208-1218
• /
• 2004

Nowadays the information exchange based on XML such as B2B electronic commerce is spreading. Therefore a systematic and stable management mechanism for storing the exchanged information is needed. For this goal there are many research activities for centering on relational databases the connection between XML application and databases. But when XML data which has hierarchical structure is stored as relational databases which are expressed as relational information, a set of 2-dimensional table, there is a limitation essentially. Accordingly the modeling methodology for storing such structured information in the form of object-relational databases is needed. In order to build good quality application systems, modeling is an important first step. In 1997, the OMG adopted the UML as its standard modeling language. Since industry has warmly embraced UML, its popularity should become more important in the future. So a design methodology based on UML is needed to develop efficient XML applications. In this paper, we propose a unified design methodology for XML applications based on object-relational database using UML. To reach these goals, first we propose a systematic three step methodology to extract UML, second we introduce a XML modeling methodology to design W3C XML schema using UML and third we propose a data modeling methodology for object-relational database schema to store exchanging XML data efficiently.

• The Journal of Korean Association of Computer Education
• /
• 제6권1호
• /
• pp.9-17
• /
• 2003

XML(eXtensible Markup Language), next generation internet standard language has the advantage of easy re-use and re-structure in other computing environment because it has the separate data, presentation and structure. In this paper, we implement the efficient retrieval system for the general user by limiting the XML documents on the multimedia learning contents for the virtual education system. The system design is based on SCO Metadata unit defined in SCORM as the proposed virtual education standard. Each XML documents has three indexes - keyword, element and attribute. Also, it makes possible to retrieve data without previous knowledge of the DTD by making the element retrieval screen structure for the user interface. And it gives the user various result screen formats such as XML and HTML by restructuring the retrieval result through XML-QL and XSL, respectively.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 한국해양정보통신학회 2007년도 추계종합학술대회
• /
• pp.627-630
• /
• 2007

XML is becoming a de facto standard for exchanging data in Internet data processing environments due to the inherent characteristics such as hierarchical self-describing structures. Nowadays the number of 3D VE(Virtural Environment) available on the internet is constantly increasing, most of them focused low-level geometric data that lack any semantic information. VRML is composed of simple science graph. X3D is constructed based on XML and has many advantage. However, previous researches can not apply various advantage of XML. This work proposes an alternate approach for association semantic information to X3D VE based on XML. These information use navigation to VE. Moreover, we study extraction method of sematic information to XML document. In this work, we study saving techniques for navigation processing.

• Journal of KIISE:Databases
• /
• 제31권2호
• /
• pp.183-194
• /
• 2004

As XML is a do facto standard for a data exchange language, there have been several researches on efficient processing XML queries. The most important thing to consider when processing XML queries is how efficiently we can process path expressions in queries. Some previous works make results by performing a sequence of join operations on all records corresponding to labels in the path expression. Others works check the existence of paths in the query using an RDBMS's string comparison operator and make results by extracting the records corresponding to the paths. In this paper we suggested a new query planning algorithm based on path containment relationships and two join operators supporting the planning algorithm. The join operators use only the records related to the paths in a query as input data, scan them only once, and generate result data using a pipelining mechanism. By analysis and experiments, we confirmed that our techniques(a new query planning algorithm and two join operators) achieved significantly higher performance than other previous works.

• The KIPS Transactions:PartD
• /
• 제9D권3호
• /
• pp.355-364
• /
• 2002

Recently, WWW(World Wide Web) has become a source of a large amount of information, and is now recognized not only as an information-sharing tool, but also as an information repository. Currently, the majority of documents on the web were created using HTML(Hypertext Markup Language). Although HTML is simple and easy to learn, its inherent lack of describing document structure makes it difficult to retrieve information effectively. One possible solution would be to convert such HTML documents into XML (extensible Markup Language) documents. This is a standard markup language for exchanging data on the web. It can describe a document structure freely by defining its own DTD (Document Type Definition). This makes it possible to integrate, store, and retrieve data on the web efficiently In this paper, we will propose a converter that automatically converts HTML documents with similar pattern into XML documents by analyzing the document structure and recognizing its path information.