• The KIPS Transactions:PartD
• /
• v.8D no.6
• /
• pp.799-812
• /
• 2001

As XML become more popular for encoding data and exchanging format on the web, recent work on processing XML Document in DBMS has been performed. However, there is no formal data model for XML, and there is lack of research on XML algebra for processing complex XML query and even the mediators have many restrictions. Therefore, this paper proposes formal data model and algebra based on directed edge labeled graph for XML query. To implement algebra, not only algorithms of operation for algebra are presented, but also they are implemented using access method and path index based on RDBMS or ORDBMS. In particular, experiments to show the effectiveness of the implemented algebra are performed on XML documents on EST data which are semistructured data.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.3
• /
• pp.251-258
• /
• 2007

With the increase of a web service technology, a new access control mechanism has developed for XML documents. As a result, as legacy access control systems, access control systems has become an active research topic. In this paper, we propose a methodology to translate access control policies for XML documents into formal specification language CSP. To do this, first, we introduce a method to translate a hierarchical access to XML documents using XPath language into CSP process algebra. Second, we explain a method to represent a XML schema as a formal model like automata. Third, we present a method for representing the semantics of access control policies such as the scope of rules and confliction resolution into a process algebra language. Finally, a CSP specification example of an XML schema and path expressions aye shown to illustrate the validity of our approach.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.05a
• /
• pp.238-240
• /
• 2014

A cloud computing include a SaaS frameworks be able to use a software as a service. Despite the existing service depending on the difference of the tenant and the use, if the service provider re-establish a service, they are required resources In terms of costs and managerial. So we propose a technique for analysis software structure using the process algebra to reuse existing software. A process algebra analyze the structure of the software, express in business process or different languages and verify that it can be reused. As CCS in a process algebra is useful to convert the business process or XML, by using this, we structure a process and propose meta storage for comparison and management a structured document.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.6
• /
• pp.1375-1380
• /
• 2014

SaaS at a cloud computing is a framework to provide a software as a service. Depending on the difference of the tenant and the use, if the service provider re-establish a service, they are required resources In terms of costs and managerial. So we propose a technique for analysis of software structure using the process algebra to reuse existing software. A process algebra analyze the structure of the software, express in different languages and verify that it can be reused. CCS in a process algebra is useful to convert the business process or XML, by using this, we structure a process as process view and propose meta storage for comparison and management a structured document.

• Journal of KIISE
• /
• v.43 no.4
• /
• pp.489-496
• /
• 2016

XML can effectively express structured or semi-structured data as well as relational databases. XQuery is a query language for retrieving information for such an XML document. In this paper, an XQuery composer is designed and implemented, with an API provided for XQuery processors, and a proper processor is registered. This composer shows query results immediately processed by the processor. As this composer contains a parser for XQuery, it can compose XQuery effectively using a diverse dialog box designed for XQuery grammar. A dialog box is affiliated with a clause region, which is a region that algebra operates from the parsing tree. It can compose path expressions for an XML document easily as it shows an element tree from DTD graphically. Path expressions are composed automatically by marking elements in the structural hierarchy and by specifying the predicate of an element partially.

• Journal of KIISE:Databases
• /
• v.32 no.4
• /
• pp.383-393
• /
• 2005

Retrieval of images from image databases by spatial relationship can be effectively performed through visual interface systems. In these systems, the representation of image with 2D strings, which are derived from symbolic projections, provides an efficient and natural way to construct image index and is also an ideal representation for the visual query. With this approach, retrieval is reduced to matching two symbolic strings. However, using 2D-string representations, spatial relationships between the objects in the image might not be exactly specified. Ambiguities arise for the retrieval of images of 3D scenes. In order to remove ambiguous description of object spatial relationships, in this paper, images are referred by considering spatial relationships using the spatial location algebra for the 3D image scene. Also, we remove the repetitive spatial relationships using the several reduction rules. A reduction mechanism using these rules can be used in query processing systems that retrieve images by content. This could give better precision and flexibility in image retrieval.

• The KIPS Transactions:PartD
• /
• v.11D no.1
• /
• pp.39-50
• /
• 2004

GML proposed to offer interoperability of geography information is specifying various dynamic object schema for application in the wireless environment. These GML dynamic object schema supports the expression of moving objects that the position and shape change consecutively over time, so practical use of GML is increased in location-based service that provides various application services based on location information of moving objects. In particular, the conventional query languages about GML have been studied with priority given to the integration of geographic information, the support of spatial operations, and etc. However, it lacks the support for moving objects queries. Therefore, in this paper, we propose the moving objects query language that supports moving objects queries for GML documents by extension of XQuery that is standard in query language. Also, data model, algebra operation and various moving objects operators for the proposed query language are designed, and we apply the proposed query language to tornado government organization system to show that the proposed query language can be used effectively in various location-based service.