• Asia pacific journal of information systems
• /
• v.14 no.1
• /
• pp.79-100
• /
• 2004

As a part of ebXML(Electronic Business using eXtensible Markup Language) framework, BPSS(Business Process Specification Schema) has been provided to support the direct specification of the set of elements required to configure a runtime system in order to execute a set of ebXML business transactions. The BPS,' is available in two stand-alone representations, a UML version and an XML version. Due to the limitations of UML notations and XML syntax, however, current ebXML BPSS specification fails to specify formal semantic constraints completely. In this study, we propose a constraint classification scheme for the BPSS specification and describe how to formally represent those semantic constraints using OCL(Object Constraint Language). As a way to validate p Business Process Specification(BPS) with the formal semantic constraints, we suggest a rule-based approach to represent the formal constraints and demonstrate its detailed mechanism for applying the rule-based constraints to the BPS with a prototype implementation.

• Proceedings of the CALSEC Conference
• /
• 2004.02a
• /
• pp.318-326
• /
• 2004

The ebXML (Electronic Business using eXtensible Markup Language) Specification Schema is to provide nominal set of specification elements necessary to specify a collaboration between business partners based on XML. As a part of ebXML Specification Schema, BPSS (Business Process Specification Schema) has been provided to support the direct specification of the set of elements required to configure a runtime system in order to execute a set of ebXML business transactions. The BPSS is available in two stand-alone representations, a UML version and an XML version. Due to the limitations of UML notations and XML syntax, however, current ebXML BPSS specification is insufficient to specify formal semantic constraints of modeling elements completely. In this study, we propose a classification schema for the BPSS semantic constraints and describe how to represent those semantic constraints formally using OCL (Object Constraint Language). As a way to verify a Business Process Specification (BPS) with the formal semantic constraint modeling, we suggest a rule-based approach to represent the formal constraints and to use the rule-based constraints specification to verify BPSs in a CLIPS prototype implementation.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.3
• /
• pp.53-63
• /
• 2011

Many techniques have been proposed to store and query XML data efficiently. One way achieving this goal is using relational database by transforming XML data into relational format. It is important to transform schema to preserve the content, the structure and the constraints of the semantics information of the XML document. Especially, key constraints are an important part of database theory. Therefore, the proposal technique has considered the semantics of XML as expressed by primary keys and foreign keys. And, the proposal technique can preserve not only XML data constraints but also the content and the structure and the semantics of XML data thru transformation process. Transforming information is the content and the structure of the document(the parent-child relationship), the functional dependencies, semantics of the document as captured by XML key and keyref constraints. Because of XML schema transformation ensures that preserving semantic constraints, the advantages of these transformation techniques do not need to use the stored procedure or trigger which these data ensures data integrity in the relational database. In this paper, there is not chosen the ID/IDREF key which supported in DTD, the inheritance relationship, the implicit referential integrity.

• The Journal of Society for e-Business Studies
• /
• v.10 no.4
• /
• pp.1-18
• /
• 2005

In ebXML, a representative framework for electronic commerce, a BPS (Business Process Specification) should be finally defined as an instance of XML-version BPSS for the configuration of B2B (Business to Business) runtime systems . In order to define the instance more complete and consistent, it is required to validate all the semantic constraints on the instance . Due to the limitations of XML Schema constructs, however, current XML-version BPSS fails to specify formal semantic constraints completely. This paper presents how to find, express and reuse BPSS semantic constraints that could not be explicitly defined in the XML-version BPSS. The method facilitates the validation of XML-version BPSS instances easily with some useful guides for fixing violations of semantic constraints. Furthermore, B2B business processes can be standardized and applied more efficiently and effectively.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.1482-1485
• /
• 2005

An equivalent schema matching among several different source schemas is very important for information integration or mining on the XML based World Wide Web. Finding most similar source schema corresponding mediated schema is a major bottleneck because of the arbitrary nesting property and hierarchical structures of XML DTD schemas. It is complex and both very labor intensive and error prune job. In this paper, we present the first complex matching of XML schema, i.e. XML DTD, inlining two dimensional DTD graph into flat feature values. The proposed method captures not only schematic information but also integrity constraints information of DTD to match different structured DTD. We show the integrity constraints based hierarchical schema matching is more semantic than the schema matching only to use schematic information and stored data.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.5B
• /
• pp.482-490
• /
• 2004

Recently, XML has been emerging as a standard for storing and exchanging of data for various distributed applications based on the Internet. Since there are increasing demands to store and manage XML documents, a lot of research works are going on this area to develop new took and techniques based on the XHL. However, most of the researches are concentrated on mapping techniques based on instance or DTD, and the main focus is on structural transformation. Current trend of research is toward the usage of XML documents based on XML schema, and demands not only conversion of structure but also preservation of the semantic constraints. This paper sets up the using of DIDL standing on the basis of XML schema from MPEG-21 as an application domain, and proposes the mapping model that can preserve semantic constraints in addition. We expand previous research techniques in the preprocessing step for the specific domain, and then, apply various new mapping methods in the postprocessing step. We present and discuss the system architecture for implementation, and introduce the algorithms and present implementation environment and semantic extension methodology in detail. Finally we show actual table and query processing based on our proposal.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.5
• /
• pp.1-9
• /
• 2009

Many techniques have been proposed to store efficiently and query XML data. One way achieving this goal is using relational database by transforming XML data into relational format. But most researches only transformed content and structure of XML schema. Although they transformed semantic constrainment of XML schema, they did not all of semantics. In this paper, we propose a systematic technique for extracting semantic constrainment from XML schema and storing method when the extracting result is transformed into relational schema without any lost of semantic constrainment. The transforming algorithm is used for extracting and storing semantic constrainment from XML schema and it shows how extracted information is stored according to schema notation. Also it provides semantic knowledges that are needed to be confirmed during the transformation to ensure a correct relation schema. The technique can reduce storage redundancy and can keep up content and structure with integrity constraints.

• The Journal of the Korea Contents Association
• /
• v.8 no.8
• /
• pp.274-284
• /
• 2008

XBRL is an XML-based language, actively used for diverse business reporting applications including financial reporting. It can be flexibly applied to each application by defining concepts and their relationships existing within the application. In these business reporting processes, it is very important for senders and receivers to validate the consistency and completeness of reporting contents in the syntatic and semantic levels. The basic method is to directly represent and validate the semantic constraints using application program codes. However, the method makes it difficult to represent, change, share semantic constraints. While XML constraint languages for XML documents such as XSLT and Schemantron support explicit representation and sharing of semantic constraints, they are limited in the efficiency and effectiveness of representing XBRL semantic constraints. This paper reviews XBRL formula, actively being discussed recently for standardization, and discusses the representation capability and limitations through a case analysis, which applies XBRL formula to business documents in the area of financial reporting.

• Journal of the Korean Society for information Management
• /
• v.24 no.1 s.63
• /
• pp.209-226
• /
• 2007

XML documents format on the Web provides a mechanism to impose their content and logical structure information. Therefore, an XML processor provides access to their content and structure. The purpose of this study is to investigate the usefulness of structural hints in the leaf node language model-based XML document retrieval. In order to this purpose, this experiment tested the performances of the leaf node language model-based XML retrieval system to compare the queries for a topic containing only content-only constraints and both content constrains and structure constraints. A newly designed and implemented leaf node language model-based XML retrieval system was used. And we participated in the ad-hoc track of INEX 2005 and conducted an experiment using a large-scale XML test collection provided by INEX 2005.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.3 no.1
• /
• pp.32-36
• /
• 2003

An equivalent schema matching among several different source schemas is very important for information integration or mining on the XML based World Wide Web. Finding most similar source schema corresponding mediated schema is a major bottleneck because of the arbitrary nesting property and hierarchical structures of XML DTD schemas. It is complex and both very labor intensive and error prune job. In this paper, we present the first complex matching of XML schema, i.e. XML DTD. The proposed method captures not only schematic information but also integrity constraints information of DTD to match different structured DTD. We show the integrity constraints based hierarchical schema matching is more semantic than the schema matching only to use schematic information and stored data.