Search

Very few research works have been done on XML security over relational databases despite that XML became the de facto standard for the data representation and exchange on the internet and a lot of XML documents are stored in RDBMS. In [14], the author proposed an access control model for schema-based storage of XML documents in relational storage and translating XML access control rules to relational access control rules. However, the proposed algorithms had performance drawbacks. In this paper, we will use the same access control model of [14] and try to overcome the drawbacks of [14] by proposing an efficient technique to store the XML access control rules in a relational storage of XML DTD. The mapping of the XML DTD to relational schema is proposed in [7]. We also propose an algorithm to translate XPath queries to SQL queries based on the mapping algorithm in [7].

This document defines the Extensible Binary Meta Language (EBML) format as a generalized file format for any type of data in a hierarchical form. EBML is designed as a binary equivalent to XML and uses a storage-efficient approach to build nested Elements with identifiers, lengths, and values. Similar to how an XML Schema defines the structure and semantics of an XML Document, this document defines how EBML Schemas are created to convey the semantics of an EBML Document.

Since the boom in new proposals on techniques for efficient querying of XML data is now over and the research world has shifted its attention toward new types of data formats, we believe that it is crucial to review what has been done in the area to help users choose an appropriate strategy and scientists exploit the contributions in new areas of data processing. The aim of this work is to provide a comprehensive study of the state-of-the-art of approaches for the structural querying of XML data. In particular, we start with a description of labeling schemas to capture the structure of the data and the respective storage strategies. Then we deal with the key part of every XML query processing: a twig query join, XML query algebras, optimizations of query plans, and selectivity estimation of XML queries. To the best of our knowledge, this is the first work that provides such a detailed description of XML query processing techniques that are related to structural aspects and that contains information about their theoretical and practical features as well as about their mutual compatibility and general usability.

While the migration from DTD to XML Schema was driven by a need for increased expressivity and flexibility, the latter was also significantly more complex to use and understand. Whereas DTDs are characterized by their simplicity, XML Schema Documents are notoriously difficult. In this article, we introduce the XML specification language BonXai, which incorporates many features of XML Schema but is arguably almost as easy to use as DTDs. In brief, the latter is achieved by sacrificing the explicit use of types in favor of simple patterns expressing contexts for elements. The goal of BonXai is not to replace XML Schema but rather to provide a simpler alternative for users who want to go beyond the expressiveness and features of DTD but do not need the explicit use of types. Furthermore, XML Schema processing tools can be used as a back-end for BonXai, since BonXai can be automatically converted into XML Schema. A particularly strong point of BonXai is its solid foundation rooted in a decade of theoretical work around pattern-based schemas. We present a formal model for a core fragment of BonXai and the translation algorithms to and from a core fragment of XML Schema. We prove that BonXai and XML Schema can be converted back-and-forth on the level of tree languages and we formally study the size trade-offs between the two languages. We acknowledge the financial support of grant number MA 4938/2-1 from the Deutsche Forschungsgemeinschaft (Emmy Noether Nachwuchsgruppe). We further acknowledge the financial support of the Future and Emerging Technologies (FET) programme within the Seventh Framework Programme for Research of the European Commission, under the FET-Open grant agreement FOX, number FP7-ICT-233599.

In the building industry, building data such as objects and processes are described in Industry Foundation Classes (IFC) data model schema to support a neutral data exchange format for BIM tools interoperability. While IFC specification has been encoded in ifcXML format by buildingSMART to support XML-based data transmission, there is a lack of studies on the implementation of IFC specification using JavaScript Object Notation (JSON) serialization. JSON is a key-value style lightweight data exchange format that has higher parsing efficiency than XML and due to the inadequacies of XML, JSON has been widely used in Web applications, specifically in Asynchronous JavaScript and XML (AJAX) Web services. This paper highlights the need for JSON implementation of IFC specification and introduces ifcJSON Schema and its data content. The main objective of this study is to outline how IFC specification can be represented in JSON format. Therefore, the study explains the implementation of the IFC standard as a JSON schema to guide the creation of JSON documents. The ifcJSON documents can be used for web-based data transfer as an alternative to XML documents. Since current IFC specification release is IFC4 Add1, the implementation of ifcJSON4 schema is specified and guidelines for generating and validating ifcJSON documents are described. Additionally, this paper implements ifcJSON4 schema in a use case within the precast concrete domain by indicating the data content for a precast building element with its corresponding geometry representation, product placement, and owner history data. The analysis of results indicates that ifcJSON4 schema developed in this paper is a valid JSON schema that can guide the creation of valid ifcJSON documents to be used for web-based data transfer and to improve interoperability of Cloud-based BIM applications.

Dealing with heterogeneous data underlying fuzzy XML databases is challenging for any task of document management and knowledge discovery, since the structural heterogeneity and uncertainty of the large number of XML data sources make it difficult to effectively answer the structured query, especially the tree-pattern query. To address this issue, we propose a novel framework for managing fuzzy XML queries in a heterogeneous environment in this paper. In particular, we devise a holistic algorithm for matching tree-patterns over heterogeneous fuzzy XML data. Our approach adopts a compact stack technique and generates the matches by one scan on the relevant data associated with the tree-pattern, which eliminates re-scanning unnecessary portions of XML documents and redundant intermediate results. Finally, a comprehensive experimental evaluation conducted on real and synthetic data sets is carried out to show the significance of our approach as a solution for querying heterogeneous data in fuzzy XML documents.

A new structure for streaming the XML data is proposed which guarantees confidentiality of the XML data over the wireless stream.An access mechanism is proposed to efficiently process XML queries over the encrypted XML stream. Recently, the use of XML for data broadcasting in mobile wireless networks has gained many attentions. One of the most essential requirements for such networks is data confidentiality. In order to secure XML data broadcast in mobile wireless networks, mobile clients should obey a set of access authorizations specified on the original XML document. In such environments, mobile clients can only access authorized parts of encrypted XML stream based on their access authorizations. Several indexing methods have been proposed in order to have selective access to XML data over the XML stream. However, these indexing methods cannot be used for encrypted XML data. In this paper, we define a new structure for XML stream which supports data confidentiality of XML data over the wireless broadcast channel. We also define an access mechanism for our proposed structure to efficiently process XML queries over the encrypted XML stream. The experimental results demonstrate that the use of our proposed structure and access mechanism for XML data broadcast efficiently disseminates XML data in mobile wireless networks.

In spite of its popularity, XML provides poor user experience and a lot of domain-specific languages can be improved by introducing custom, more humanfriendly notation. This paper presents an approach for design and development of the custom notation for existing XML-based language together with a translator between the new notation and XML. The approach supports iterative design of the language concrete syntax, allowing its modification based on users feedback. The translator is developed using a model-driven approach. It is based on explicit representation of language abstract syntax (metamodel) that can be augmented with mappings to both XML and the custom notation. We provide recommendations for application of the approach and demonstrate them on a case study of a language for definition of graphs.

The Extensible Markup Language (XML) data model has recently gained huge popularity because of its ability to represent a wide variety of structured (relational) and semi-structured (document) data. Several query languages have been proposed for the XML model, the most-widely used one is the XQuery. An important component of an XQuery is its XPath expression which retrieves a set of XML documents to be manipulated by the associated XQuery. An XPath expression can be of several types, among which are the containment queries. Traditional research of processing containment queries has concentrated on data retrieval from independent XML documents; not much research has been directed towards interlinked XML documents. This paper reviews this area of research and shows the adequacy and correctness of one of the reviewed algorithms when applied to independent XML documents. However, the direct application of this algorithm to process queries against interlinked XML documents is shown to generate incorrect results. To remedy such a situation, two new algorithms and the associated indexing structures are developed and shown to perform correctly in processing both independent and/or inter-linked XML documents. In addition, one of the new algorithms is shown to minimize the storage requirement of the intermediate lists generated throughout its execution and therefore improving further the algorithm's space and time performance.

Since XML has become a standard for information exchange over the Internet, more and more data are represented as XML. XML keyword search has been attracted a lot of interests because it provides a simple and user-friendly interface to query XML documents. This paper provides a survey on keyword search over XML document. We mainly focus on the topics of defining semantics for XML keyword search and the corresponding algorithms to find answers based on these semantics. We classify existing works for XML keyword search into three main types, which are tree-based approaches, graph-based approaches and semantics-based approaches. For each type of approaches, we further classify works into sub-classes and especially we summarize, make comparison and point out the relationships among sub-classes. In addition, for each type of approach, we point out the common problems they suffer

The eXtensible Markup Language (XML) has been widely adopted in many financial institutions in their daily transactions. This adoption was due to the flexible nature of XML providing a common syntax for systems messaging in general and in financial messaging in specific. Excessive use of XML in financial transactions messaging created an aligned interest in security protocols integrated into XML solutions in order to protect exchanged XML messages in an efficient yet powerful mechanism. However, financial institutions (i.e. banks) perform large volume of transactions on daily basis which require securing XML messages on large scale. Securing large volume of messages will result performance and resource issues. Therefore, an approach is needed to secure specified portions of an XML document, syntax and processing rules for representing secured parts. In this research we have developed a smart approach for securing financial XML transactions using effective and intelligent fuzzy classification techniques. Our approach defines the process of classifying XML content using a set of fuzzy variables. Upon fuzzy classification phase, a unique value is assigned to a defined attribute named “Importance Level”. Assigned value indicates the data sensitivity for each XML tag. The research also defines the process of securing classified financial XML message content by performing element-wise XML encryption on selected parts defined in fuzzy classification phase. Element-wise encryption is performed using symmetric encryption using AES algorithm with different key sizes. Key size of 128-bit is being used on tags classified with “Medium” importance level; a key size of 256-bit is being used on tags classified with “High” importance level. An implementation has been performed on a real-life environment using online banking system in Jordan Ahli Bank one of the leading banks in Jordan to demonstrate its flexibility, feasibility, and efficiency. Our experimental results of the system verified tangible enhancements in encryption efficiency, processing-time reduction, and resulting XML message sizes. Finally, our proposed system was designed, developed, and evaluated using a live data extracted from an internet banking service in one of the leading banks in Jordan. The results obtained from our experiments are promising, showing that our model can provide an effective yet resilient support for financial systems to secure exchanged financial XML messages.

SAX can parse XML documents but cannot create them. In contrast, DOM can parse and create XML documents. This chapter introduces you to DOM.

As XML files are less redundant and readily reorganized, it is really difficult to design a XML watermarking scheme which can get a trade-off between robust and invisible. However, this trade-off can be achieved by the Zero-Watermark method. In this paper, two Zero-Watermark methods are designed and tested for XML documents. One is XSLT-related method which is designed with embedding extra codes in XSLT file to serve as sort of copyright function. Another uses the functional dependency of XML file as feature for Zero-Watermark. Experiment results show that both methods have good real-time performances. Experiment results show that Zero-Watermark algorithm with functional dependency can resist selection attacks, alteration attacks, reorganization attacks and compression attacks.

Recent advances in web and information technologies have resulted in many Engineering Enterprises. There is an emerging requirement to share, manage and reuse relevant resources together to achieve on-demand resource management in the internet like environment. Ontologies have become a key technology for enabling semantic-driven resource management. Achieving this interoperability is a necessary element of realizing the enterprises vision of interoperability across all the enterprise services. This paper describes PDM-string matching approach for Extensible Markup Language (XML) of STandard for Exchange of Product (STEP) model data, invented to capture data structure, content, and semantics in a targeted engineering industry design domain. The ontology was created using the World Wide Web (WWW) consortium emerging standard called XML Schema using JAVA based Product Data Management (PDM)-string matching process which increases the potentiality. The resulting STEP-PDM ontology could become a standard, shared data vocabulary as a step toward achieving data interoperability for engineering domains.

XML emerged as a de-facto standard for data representation and information exchange over the World Wide Web. By utilizing document object model (DOM), XML document can be viewed as XML DOM tree. Nodes of an XML tree are labeled to uniquely identify every node by following a labeling scheme. This paper proposes a method to efficiently identify the two structural relationships namely document order (DO) and sibling relationship that exist between the XML nodes using two secure labeling schemes specifically enhanced Dewey coding (EDC) and secure Dewey coding (SDC). These structural relationships influence the performance of XML queries so they need to be identified in efficient time. This paper implements the method to identify DO and sibling relationship using EDC and SDC labels for various real-time XML documents. Experiment results show the identification of DO and sibling relationship using SDC labels performs better than EDC labels for processing XML queries.

XML is a popular choice for development of domain-specific languages. In spite of its popularity, XML is a poor user interface and a lot of languages can be improved by introducing custom notation. This paper presents an approach for development of custom human-friendly notation for existing XML-based language together with a translator between the new notation and XML. This approach is based on explicit representation of language abstract syntax that can be decorated with mappings to both XML and the custom notation. The approach supports iterative design and development of the language concrete syntax, allowing its modification based on users feedback. Development process is demonstrated on a case study of language for definition of graphical user interface layout.

Implementing the INSPIRE directive involves transforming various data themes into the structure and content given by Data Specifications published by the Joint Research Center of the European Commission. The data is to be published in the GML format, which is the standard for the Open Geospatial Consortium. The validity of the data structure is ensured by validation against XML schemas. These schemas are usually also provided by JRC, though not necessarily for all application schemas. Six application schemas are defined for the currently implemented Buildings theme, but XML schemas are available for only three of them. All application schemas have been analyzed, and it has been found that the most suitable data model corresponds most closely to the BuildingsExtended2D application schema. No XML schema has been provided by JRC in the current version. The BuildingsExtendedBase abstract XML schema was also needed when using the previous schemas. There is now a need to create these missing XML schemas.

Keyword search is a user-friendly approach that enables inexperienced users to easily retrieve information from XML data with no specific knowledge of complex structured query language. Since an XML document can have a large size and contain a lot of information, an XML keyword search result should be a fragment of an XML document dynamically constructed at query time, which is achievable due to the structuredness of XML. Processing keyword searches on XML has several challenges, e.g., what are the elements in the XML document that are relevant to the query? How to generate the results efficiently and rank the results meaningfully? How to present the results to the user in a way such that the user can quickly find the desired information? In this survey, the authors review the papers in the literature that attempted to address these problems. The authors divide the existing approaches into several classes based on the problem they tackled, and perform a comprehensive analysis of these works.

Since the last two decades, XML has gained momentum as the standard for web information management and complex data representation. Also, collaboratively built semi-structured information resources, such as Wikipedia, have become prevalent on the Web and can be inherently encoded in XML. Yet most methods for processing XML and semi-structured information handle mainly the syntactic properties of the data, while ignoring the semantics involved. To devise more intelligent applications, one needs to augment syntactic features with machine-readable semantic meaning. This can be achieved through the computational identification of the meaning of data in context, also known as (a.k.a.) automated semantic analysis and disambiguation, which is nowadays one of the main challenges at the core of the Semantic Web. This survey paper provides a concise and comprehensive review of the methods related to XML-based semi-structured semantic analysis and disambiguation. It is made of four logical parts. First, we briefly cover traditional word sense disambiguation methods for processing flat textual data. Second, we describe and categorize disambiguation techniques developed and extended to handle semi-structured and XML data. Third, we describe current and potential application scenarios that can benefit from XML semantic analysis, including: data clustering and semantic-aware indexing, data integration and selective dissemination, semantic-aware and temporal querying, web and mobile services matching and composition, blog and social semantic network analysis, and ontology learning. Fourth, we describe and discuss ongoing challenges and future directions, including: the quantification of semantic ambiguity, expanding XML disambiguation context, combining structure and content, using collaborative/social information sources, integrating explicit and implicit semantic analysis, emphasizing user involvement, and reducing computational complexity.

The gap between storing data in relational databases and transferring data in form of XML has been closed e.g. by SQL/XML queries that generate XML data out of relational data sources. However, only few relational database systems support the evaluation of SQL/XML queries. And even in those systems supporting SQL/XML, the evaluation of such queries is quite slow compared to the evaluation of SQL queries. In this paper, we present S2CX, an approach that allows to efficiently evaluate SQL/XML queries on any relational database system, no matter whether it supports SQL/XML or not. As a result to an SQL/XML query, S2CX supports different output formats ranging from plain XML to different compressed XML representations including a succinct encoding of XML data, schema-aware compressed XML to grammar compressed XML. In many cases, S2CX produces compressed XML as a result to an SQL/XML query even faster than the evaluation of SQL/XML queries into non-compressed XML as provided by Oracle 11 g and by DB2. Furthermore, our approach to query evaluation scales better, i.e., the larger the dataset, the faster is our approach compared to SQL/XML query evaluation in Oracle 11 g and in DB2.

The number of electronic archives holding image documents such as posters, in addition to textual materials, is increasing. For digitized poster collections the use of metadata is essential for their operation; with the help of metadata, these electronic documents can be efficiently sorted and retrieved. The research study presents the main characteristics of posters, summarizes the difficulties in their technical processing, and describes the XML-based schema for storing the metadata of posters.

Driven by the emerging network data exchange and storage, XML documents classification has become increasingly important. Most existing representation model and conventional learning algorithm are defined on certain XML documents. However, in many real-world applications, XML datasets contain inherent uncertainty, which brings greater challenges to classification problem. In this paper, we propose a novel solution to classify uncertain XML documents, including uncertain XML documents representation and two uncertain learning algorithms based on Extreme Learning Machine. Experimental results show that our approaches exhibit prominent performance for uncertain XML documents classification problem.

JDBC, Java Database Connectivity, is a well-known and mature technology for a Java based client to connect to a relational database on a server, execute SQL commands, and process results of queries that reside on the server. Likewise, there are a few technologies such as XQJ, IBM Cognos to support such connectivity to XML. But these technologies require the whole document to be stored in memory before it can be processed. As a result, such technologies cannot handle large XML documents. Canonical Storage for XML (abbreviated CanStoreX and also Csx), is a suite of technologies that are under varying stages of development at our lab. CsxPagination paginates an XML document of any size and stores it in ready to consume pages that are loaded into main memory as needed. CsxDOM, is a Javabased DOM API for processing XML documents and CsxXQuery, built on the top of CsxDOM is for query of XML documents. Under the research reported here, we have developed CsxJBCX, Csx Java Based Connectivity for XML, built on the top of CanStoreX, CsxDOM, and CsxXQuery. It provides API to allow a client to access the XML on a server, submit an XQuery query for execution on the server, and use CsxDOM from the client to process the result residing on the server. We have also done some testing of JBCX on CyDIW (Cyclone Database Implementation Workbench) – a command-based software development environment in our lab.

Everyday a huge number of new information resources are linked to the web. This way the web is growing very fast, making search tasks more and more difficult with worse results. To solve the problem several initiatives were undertaken and a new area of research and development emerged: the one called Semantic Web.When we refer to the semantic web we are thinking about a network of concepts. Each concept has a group of related resources and can be related to other concepts; we can then use this concept network to navigate among web resources or simply among information resources. From the undertaken initiatives one became an ISO standard: Topic Maps ISO 13250. The aim of this paper is to introduce a Topic Map (TM) Builder, that is a processor that extracts topics and relations from instances of a family of XML documents.A TM-Builder is strongly dependent on the resources structure. So, to extract a topic map for different collections of information resources (sets of documents with different structures) we have to implement several TM-Builders, one for each collection. This is not very easy! To overcome this inconvenient we have created an XML abstraction layer for TM-Builders that enables us to specify the topic map we want to build from a concrete family of resources, in order to generate automatically the intended extractor. To describe that process, i.e. the extraction of knowledge from XML documents to produce a TM, we present a language to specify topic maps for a class of XML documents, that we call XSTM (XML Specification for Topic Maps). We also discuss a XSL processor that automatically generates the Extractor from its formal specification written in XSTM, the XSTM-P.

International audience; In this paper we present Andromeda, a system for processing queries and updates on large XML documents. The system is based on the idea of statically and dynamically partitioning the input document, so as to distribute the computing load among the machines of a MapReduce cluster.

Definition XML access control refers to the practice of limiting access to (parts of) XML data to only authorized users. Similar to access control over other types of data and resources, XML access control is centered around two key problems: (i) the development of formal models for the specification of access control policies over XML data; and (ii) techniques for efficient enforcement of access control policies over XML data.

However XML languages can logically define the type of structure with their`s own grammar, it is inadequate to use them as a tool for conceptual model that represents the semantics of data and the relationships between the data in the real world. In this paper, we propose conceptual modeling techniques, called CMXML, for modeling the XML schema at the conceptual level. For this purpose, we define the model formally, and provide a way to represent the model in a graphical and text form. We also propose an mapping methodology providing transformation from CMXML to XML schema to show the feasibility of the proposed model.

XML has become the de facto standard for data exchange and transformation on the World Wide Web and is widely used in many applications of various fields, so it is urgent to develop some efficient methods to manage, store, query, and update XML data. There are two main methods to do this: the first method is a native approach which uses native XML databases to store XML data, and the second method use other mature commercial databases approaches to store and manage XML data considering the advantages of mature technologies of the commercial databases, especially use relational databases to store, query, and update XML data. For relational databases approach, although it can take advantage of mature technologies of relational databases, it needs to map XML data to relational data. In this paper, we research the problem of how to store XML data so that storing and updating of original XML data can be efficient than relational approach. We proposed a method to store XML data into linked lists with inverted index, in which the relationships between nodes of XML data tree are preserved by the links in linked lists. Inverted index are created for linked lists for efficiently querying and updating XML data tree. Two kinds of updates are considered including inserting a new node in or deleted an existed old node from XML data tree. Theoretical analysis of our algorithms shows that the methods proposed in the paper are efficient.

Purpose – The purpose of this paper is to extract appropriate terms to summarize the current results in terms of the contents of textual facets. Faceted search on XML data helps users find necessary information from XML data by giving attribute–content pairs (called facet-value pair) about the current search results. However, if most of the contents of a facet have longer texts in average (such facets are called textual facets), it is not easy to overview the current results. Design/methodology/approach – The proposed approach is based upon subsumption relationships of terms among the contents of a facet. The subsumption relationship can be extracted using co-occurrences of terms among a number of documents (in this paper, a content of a facet is considered as a document). Subsumption relationships compose hierarchies, and the authors utilize the hierarchies to extract facet-values from textual facets. In the faceted search context, users have ambiguous search demands, they expect broader terms. Thus, we extract high-level terms in the hierarchies as facet-values. Findings – The main findings of this paper are the extracted terms improve users’ search experiences, especially in cases when the search demands are ambiguous. Originality/value – An originality of this paper is the way to utilize the textual contents of XML data for improving users’ search experiences on faceted search. The other originality is how to design the tasks to evaluate exploratory search like faceted search.

XML has become the dominant standard for data exchange and representation on the Web. The Relational Database (RDB) possesses is widely used as a storage and retrieval medium in the business field. With the expanding utilization of XML data on the Web, the size of this data type has increased rapidly, and more complicated queries are issued by users through this data. This expansion has prompted numerous researchers to propose various approaches in managing XML data through RDB. In this study, the most cited and the latest model-mapping approaches are reviewed in terms of the description, the technique used and the RDB schema produced using each approach. The limitations of these approaches are discussed, in terms of the storage space and query response time. At the end of this study, a solution to these limitations is proposed. It is hoped that this paper will give some insight into storing XML documents in RDB schema and contribute to the XML community.

The eXtensible Markup Language (XML) is a meta language that is widely used to provide a non-proprietary universal format for sharing hierarchical data among different software systems and application domains. Many organizations and content providers have been publishing and sharing their information through XML and its standard schemas. With the increased popularity of cloud application deployment, it is a common practice to share data and its schemas, which underpins integrated applications within the cloud environment. Cloud environment fosters collaboration more than in the traditional distributed system, through i) a direct access and update of shared files using a web-based collaboration packages and ii) a seamless access by new technologies such as smartphones and tablet devices. Since the heterogeneous schemas stored in the cloud tend to evolve across time, there is a need to handle their versions adequately. In this paper, we propose a central framework the can be deployed in a cloud environment to aid schema developers and standard groups to track XML Schema changes, maintain versions compatibility, and help in the enhancement of a particular schema version. The framework is prototyped as a tool (called XSM) to store and retrieve versioned XSDs and evaluate them based on the quality indicators defined for this purpose. The versioning correctness and functionality of the proposed indicators are examined through a set of XSDs.

Wide Web Consortium recommendation for XML Schema illustrates the structure and data types of XML document. tXSchema could be a framework for the creation and validation of time variable documents. All parts of tXSchema changes over time to replicate changes reference world of information. tXSchema could be a model for making temporal Schema from base Schema, logical and Physical Annotations. We also describe how the validator can be extended (temporal validator) to validate documents in this seeming uncertain situation of data that vary across time while its corresponding schema and even its representation are also varies. Since many applications require to keep tracks of the Schema, data evaluation, which suggested a need of versioning. When system is working with huge versions of schema as well as xml data files here we are specially focusing on how to minimize processing time by using SAX parser's partial involvement with conventional DOM parser. In this paper we deal with versioning in tXSchema model, more precisely here we propose a set of Schema change primitive for the maintenance of logical and physical annotations and define their operational perspectives and also minimizes processing time.

Preserving data quality is an important issue in data collection management. One of the crucial issues hereby is the detection of duplicate objects (called coreferent objects) which describe the same entity, but in different ways. In this paper we present a method for detecting coreferent objects in metadata, in particular in XML schemas. Our approach consists in comparing the paths from a root element to a given element in the schema. Each path precisely defines the context and location of a specific element in the schema. Path matching is based on the comparison of the different steps of which paths are composed. The uncertainty about the matching of steps is expressed with possibilistic truth values and aggregated using the Sugeno integral. The discovered coreference of paths can help for establishing a mapping between two different XML schemas. In other words, a novel approach for schema matching problem based on paths comparison only is proposed.

In this paper, we study the ramification problem in the setting of spatial xml data. Standard solutions from the literature on reasoning about action are inadequate because they cannot capture integrity constraints in spatial data. In this paper, we provide a solution to the ramification problem based on situation calculus. We present a tool that connects the theoretical results with the practical considerations, by producing the User Interface in C# in order to address the ramification problem in spatial XML file in specific time period. a

XML has become one of the most influential standard language for representing and exchanging data on internet. However, XML itself has a ability to represent a logical structure for storing and managing data, it is inadequate to use as a conceptual modeling tool because of its complexity for representing the document structures. In this paper, we propose the graphical form of conceptual modeling techniques for representing the structure of the XML schema documents using an extended entity relationship diagram. For this, extended entity relationship model is presented for representing the XML schema structure, transformation rules are presented for transforming extended entity relationship model into XML schema document to show the completeness of the proposed model. Key Words : XML Schema, Diagrammatical Representation, Extended Entity Relationship Diagram Ⅰ. 서 론 일반적으로 다이어그램은 기호, 선, 점 등을 사용해 각종 사상의 상호 관계나 과정, 구조 등의 의미를 빠르고 정확하게 전달하는 시각 언어로써 개념적 설계 단계에서 개발환경에 독립적으로 실세계의 현상을 분석하고, 설계하는데 유용한 수단으로 사용되고 있다. 개념적 설계 단계에서는 관리 대상의 객체, 그 객체들의 특성, 그들 간의 관계 등 현실 세계가 내포하는 의미들을 모두 포함한다. 대표적인 개념적 데이터 모델인 개체관계 모델(Entity-Relationship Model)은 기본적으로 개체집합(entity set), 개체의 속성들(attributes), 개체 간의 관계집

A significant amount of data on the Web is in the XML format or may easily be converted to XML or to its variations. XML is still the most appropriate language for data interchange and serialization. In this paper, a new framework which can integrate any heterogeneous XML data sources is presented. Each data source is translated into semantically meaningful regular expressions without changing original data source. Proposed framework has two major phases for data preparation. In the first phase, each data source is processed to obtain regular expressions which accommodate with the design choices that made in target by utilizing known global semantic vocabulary as an input. The second phase combines these regular expressions to get a global schema by preserving the original source data. A regular expression generator tool which produces regular expressions by regarding vocabulary and an integrator tool box which integrates and processes regular expressions, are also introduced.

XML documents are generated from heterogeneous resources. They may share the same data but in different Schema, which make it difficult to retrieve information from them. In this paper we propose a new technique that first; minimizes the size of the XML documents by reducing the redundancy of the structure part and generate the repository for these documents, and second; relaxes and decomposes the XPath query in two stages to determine the relevant documents and the relevant part within these documents. The results show significant precision and recall comparing with the exact XPath queries.

Automatic extraction of information from old printed documents which have been digitised injudiciously will end up with a lot human corrections. To overcome the problem, one possible solution is to annotate the documents with some markups. This paper presents the encoding of the digitised sample of Sarawak Gazette published from 1903 until 1939 using the standard TEI XML schema. The output of the work is a set of six TEI XML templates that is considered to represent the different layout structures found in the studied samples.

Recently, the sizes of XML documents have rapidly been increasing. Distributed XML is a novel form of XML document, in which an XML document is partitioned into fragments and managed separately in plural sites. Distributed XML documents can often be managed more easily than a single large document, due to geographical and/or administrative factors. In this paper, we propose a method for performing XSLT transformation efficiently for distributed XML documents. We assume that the expressive power of XSLT is restricted to an extended version of unranked top-down tree transducer. Our basic strategy is to transform all the XML fragments in parallel. We implemented our method in Ruby and made evaluation experiments. This result suggests that our method is more efficient than a centralized approach.

Data modelling is not only important to visualise the structural schema of data, but also to show the intended integrity constraints. In this paper, we propose a modelling approach called XML Static Dynamic Modelling (XSDyM). While a text-based schema definition is often the most common method used to describe XML, graphical modelling is more accepted as it is capable of visualising the schema definition more effectively for the reader. Conveying the dynamic constraints on XML graphical model requires a special treatment as the constraints basically comprehend the state transitions. It is important for an XML modelling to keep the basis as precise as possible to satisfy the nature of XML and at the same time be able to represent the constraints in an effective way. Using the XML tree-based modelling as the basis of the work, we proposed our own approach to convey the state transitions of the constraints, where it is inspired from the well-known state diagram and adopt some useful features of ORM modelling. We evaluate the correctness of our proposed modelling using a model which involves the checking of model transformations between the modelling and the equivalent XML schema languages.

Mining the web data is one of the emerging researches in data mining. The HTML can be used for maintaining the web data but it is hard to achieve the accurate web mining results from HTML documents. The XML documents make more convenient for finding the properties in web mining. Association rule based mining discovers the temporal associations among XML documents. But this kind of data mining is not sufficient to retrieve the properties of every XML document. Finding the properties for set of similar documents is better idea rather than to find the property of a single document. Hence, the key contribution of the work is to find the meaningful clustered based associations by association rule based clustering. Therefore, this paper proposes a hybrid approach which discovers the frequent XML documents by association rule mining and then find the clustering of XML documents by classical k-means algorithm. The proposed approach was tested with real data of Wikipedia. The comparative study and result analysis are discussed in the paper for knowing the importance of the proposed work.

In this paper, gives the concept of functional dependency for XML based on Tree Tuples, furthermore, infers a inference rules set of functional dependency by using Armstrong axiom-system of database system.

eXtensible Markup Language (XML) is data exchange format for representation data in Web based system. XML is used by many organizations for e-commerce and internet based applications such as online shopping, digital library, and electronic devices and so on. XML data is not sufficient to analyze on the Web. So XML is required to systematically analyze by industrial organizations to enable enhanced decision making. On the other hand, Data Warehouses are used by the most of the organizations for analyzing large data on their business. Conversion of XML schema and Data Warehouse schema has emerged as a continuous research area. This paper proposes a hierarchical design framework conversion of XML schema into the various Data Warehouse schema based on ROLAP. In this paper, we describe an automatic approach to support this conversion process. Our approach is based on the source of data that are XML schema and conforming XML document for designing Data Warehouse. We define more than one Data Warehouse schemas from the given XML schema using the Schema Graph has been proposed in the conversion process.