Search

Along with SAX, DOM, StAX, and XPath, Java includes the XSLT API, for transforming XML documents. This chapter introduces you to XSLT.

As the fuzzy data management has become one of the main research topics and directions, the question of how to obtain the useful information by means of keyword query from fuzzy XML documents is becoming a subject of an increasing needed investigation. Considering the keyword query methods on crisp XML documents, smallest lowest common ancestor (SLCA) semantics is one of the most widely accepted semantics. When users propose the keyword query on fuzzy XML documents with the SLCA semantics, the query results are always incomplate, with low precision, and with no possibilities values returned. Most of keyword query semantics on XML documents only consider query results matching all keywords, yet users may also be interested in the query results matching partial keywords. To overcome these limitations, in this paper, we investigate how to obtain more comprehensive and meaningful results of keyword querying on fuzzy XML documents. We propose a semantics of object-oriented keyword querying on fuzzy XML documents. First, we introduce the concept of "object tree", analyze different types of matching result object trees and find the "minimum result object trees" which contain all keywords and "result object trees" which contain partial keywords. Then an object-oriented keyword query algorithm ROstack is proposed to obtain the root nodes of these matching result object trees, together with their possibilities. At last, experiments are conducted to verify the effectiveness and efficiency of our proposed algorithm.

Appreciate the power of self-defining data. Know when to use different types of compression. Read simple XML documents. Make simple queries in a relational database. Appreciate the demands of efficiency on a DBMS. Understand the purpose of data warehousing and mining.

Twig pattern minimization is an important aspect of XML query optimization. During the minimizing process, it usually needs to take advantage of the constraints of XML Schema. The traditional methods for identifying constraints is to develop corresponding algorithms based on the type of constraints. It is inflexible because the constraints may be changed as new Twig pattern optimizing rules are found. Since the constraints of XML Schema mainly depict the sequence relationship of nodes, it is natural to be described by temporal logic. Based on the recognition, this paper proposes a method of identifying XML Schema constraints using temporal logic. Concretely, an XML Schema is modeled as a graph. In order to easily represent constraints related to parent and ancestor nodes, we made some modifications to Computational Tree Logic(CTL) with backward temporal operators, and developed model checking algorithms for automatically identifying XML Schema constraints. Compared with traditional methods, our method is more flexibility.

As a theoretical foundation of relational database, integrity constraints such as functional dependency play very important role in the design of relational data schema. Moreover, the wide application of XML data requires relevant integrity constraints to normalize the design of XML documents and the design of XML database. Because XML data is a semi-structure data, we find that data redundancy in an XML document results not only from functional dependencies between the data values of different data items, but also from the dependencies between the structure of some polymorphic data and values of its members in XML Documents. As a new class of XML constraint, we propose the concept of XML type dependency (XTD), to indicate the type/value dependencies in XML documents. We give the formal definitions of the XML type dependency and its instance constraint and its satisfaction checking algorithms. We also propose a XTD-based normal form and a normalization algorithm for well-designed XML documents. We have also proved that the redundancy caused by the XTDs can be eliminated by this normalization.

Focusing on only one type of structural component in the process of clustering XML documents may produce clusters with a certain extent of inner structural inhomogeneity, due either to uncaught differences in the overall logical structures of the available XML documents or to inappropriate choices of the targeted structural component. To overcome these limitations, two approaches to clustering XML documents by multiple heterogeneous structures are proposed. An approach looks at the simultaneous occurrences of such structures across the individual XML documents. The other approach instead combines multiple clusterings of the XML documents, separately performed with respect to the individual types of structures in isolation. A comparative evaluation over both real and synthetic XML data proved that the effectiveness of the devised approaches is at least on a par and even superior with respect to the effectiveness of state-of-the-art competitors. Additionally, the empirical evidence also reveals that the proposed approaches outperform such competitors in terms of time efficiency.

We describe an XML file format for storing data from computations in algebra and geometry. We also present a formal specification based on a RELAX-NG schema.

An XML schema specifies the structural properties of XML documents generated from the schema and, thus, is useful to manage XML data efficiently. However, there are often XML documents without a valid schema or with an incorrect schema in practice. This leads us to study the problem of inferring a Relax NG schema from a set of XML documents that are presumably generated from a specific XML schema. Relax NG is an XML schema language developed for the next generation of XML schema languages such as document type definitions (DTDs) and XML Schema Definitions (XSDs). Regular hedge grammars accept regular tree languages and the design of Relax NG is closely related with regular hedge grammars. We develop an XML schema inference system using hedge grammars. We employ a genetic algorithm and state elimination heuristics in the process of retrieving a concise Relax NG schema. We present experimental results using real-world benchmark.

For distributed environments including Web Services, data and application integration, and personalized content delivery, XML is becoming the common wire format for data. In this emerging distributed infrastructure, XML message brokers will play a key role as central exchange points for messages sent between applications and/or users. Users (equivalently, applications, or organizations) subscribe to the message broker by providing profiles expressing their data interests. After arriving at the message broker, these profiles become “standing queries,” which are executed on all incoming data. Data sources publish their data by pushing streams of XML messages to the broker. The broker delivers to each user the messages that match his data interests; these messages are presented in the required format of the user. We have developed “YFilter”, an XML filtering system aimed at providing efficient filtering for large numbers (e.g., 10’s or 100’s of thousands) of path queries. The key innovation in YFilter is a Nondeterministic Finite Automaton (NFA)-based representation of path expressions which combines all queries into a single machine. YFilter exploits commonality among path queries by merging the common prefixes of the paths so that they are processed at most once. The NFA-based implementation also provides additional benefits including a relatively small machine size, flexibility in dealing with diverse characteristics of data and queries, incremental machine construction, and ease of maintenance.

For data migration, management, restructuring, and reorganizing operations, there is a growing demand of XML schema matching techniques. Most of the XML schemas are heterogeneous as they are independently designed by schema designers for individual customer requirements. Schema matching becomes a difficult task when schemas are large and hence there is a need for automated and accurate XML schema matching solutions to ease the process of mapping and migration. Considerable research has been done for XML schema matching automation. However, fully-automated solution is yet to be achieved. This paper makes an attempt in the direction by presenting an automated tool to match heterogeneous XML schemas with better results as compared to a standard tool COMA++.

We discuss three well-known languages for querying and manipulating XML documents: XQuery, XPath and XSLT. They are considered to be the standard languages for processing XML documents. However, specifying their complete semantics in a formal way seems almost impossible. Indeed, an attempt by the W3C XML Query Working Group to do so for XQuery was ultimately abandoned. We introduce three sublanguages, called MiXPath, MiXQuery and MiXSLT, and describe their syntax and formal semantics. The syntax and semantics of these languages are chosen such that they are consistent with the ones given in the related W3C recommendations. As such this provides a practical foundation for research and teaching of XML languages. For this purpose the sublanguages are chosen such that they contain the most crucial features, constructs and expressions of each of these three languages.

We are living in a world full of information. Businesses are constantly collecting large amounts of data from multiple sources, processing it, and exchanging it with other systems. XML and its popular alternative JSON have become the de-facto standards for information exchange. They work across different platforms and are supported in every development platform that exists today.

Java provides several APIs for parsing XML documents. The most basic of these APIs is SAX, which is the focus of this chapter.

Patients taking medical treatment in distinct healthcare institutions have their information deeply fragmented between very different locations. All this information --- probably with different formats --- may be used or exchanged to deliver professional healthcare services. As the exchange of information/ interoperability is a key requirement for the success of healthcare process, various predefined e-health standards have been developed. Such standards are designed to facilitate information interoperability in common formats. Fast Healthcare Interoperability Resources (FHIR) is a newly open healthcare data standard that aims to providing electronic healthcare interoperability. FHIR was coined in 2014 to address limitations caused by the ad-hoc implementation and the distributed nature of modern medical care information systems. Patient’s data or resources are structured and standard in FHIR through a highly readable format such as XML or JSON. However, despite the unique features of FHIR, it is not a security protocol, nor does it provide any security-related functionality. In this paper, we propose a security specification model (SecFHIR) to support the development of intuitive policy schemes that are mapping directly to the healthcare environment. The formal semantics for SecFHIR are based on the well-established typing and the independent platform properties of XML. Specifically, patients’ data are modeled in FHIR using XML documents. In our model, we assume that these XML resources are defined by a set of schemes. Since XML Schema is a well-formed XML document, the permission specification can be easily integrated to the schema itself, then the specified permissions are applied to instance objects without any change. In other words, our security model (SecFHIR) defines permissions on XML schemes level, which implicitly specify the permissions on XML resources. Using these schemes, SecFHIR can combine them to support complex constraints over XML resources. This will result in reusable permissions, which efficiently simplify the security administration and achieve fine-grained access control. We also discuss the core elements of the proposed model, as well as the integration with the FHIR framework

PurposeDesigning efficient XML schemas is essential for XML applications which manage semi‐structured data. On generating XML schemas, there are two opposite goals: to avoid redundancy and to provide connected structures in order to achieve good performance on queries. In general, highly connected XML structures allow data redundancy, and redundancy‐free schemas generate disconnected XML structures. The purpose of this paper is to describe and evaluate by experiments an approach which balances such trade‐off through a workload analysis. Additionally, it aims to identify the most accessed data based on the workload and suggest indexes to improve access performance.Design/methodology/approachThe paper applies and evaluates a workload‐aware methodology to provide indexing and highly connected structures for data which are intensively accessed through paths traversed by the workload.FindingsThe paper presents benchmarking results on a set of design approaches for XML schemas and demonstrates that the XML schemas generated by the approach provide high query performance and low cost of data redundancy on balancing the trade‐off on XML schema design.Research limitations/implicationsAlthough an XML benchmark is applied in these experiments, further experiments are expected in a real‐world application.Practical implicationsThe approach proposed may be applied in a real‐world process for designing new XML databases as well as in reverse engineering process to improve XML schemas from legacy databases.Originality/valueUnlike related work, the reported approach integrates the two opposite goal in the XML schema design, and generates suitable schemas according to a workload. An experimental evaluation shows that the proposed methodology is promising.

Database systems employ physical structures such as indexes and materialized views to improve query performance, potentially by orders of magnitude. It is therefore important for a database administrator to choose the appropriate configuration of these physical structures for a given database. XML database systems are increasingly being used to manage semi-structured data, and XML support has been added to commercial database systems. In this paper, we address the problem of automatic physical design for XML databases, which is the process of automatically selecting the best set of physical structures for a database and a query workload. We focus on recommending two types of physical structures: XML indexes and relational materialized views of XML data. We present a design advisor for recommending XML indexes, one for recommending materialized views, and an integrated design advisor that recommends both indexes and materialized views. A key characteristic of our advisors is that they are tightly coupled with the query optimizer of the database system, and they rely on the optimizer for enumerating and evaluating physical designs. We have implemented our advisors in a prototype version of IBM DB2 V9, and we experimentally demonstrate the effectiveness of their recommendations using this implementation.

XML databases have been widely used for web applications to facility data exchanges through internet. Traditional database systems, including XML systems, usually handle precise and well-defined data. In the real world, there exist data that is uncertain and ambiguous. Fuzzy logic reflects human nature to express and evaluate the world in a vague manner. This paper describes our approach of incorporating fuzzy logic into XML database systems. Our system is built on top of an existing XML database management system, which allows the definition and storage of fuzzy data in addition to crisp information. We defined a query language based on the XQuery standard that allows users to query the underlying database using fuzzy expressions. Another important issue in a database system is integrity constraint management. Active rules, also named Event-Condition-Active rules, have mainly been used in relational database systems for integrity control, which are promising features for XML databases. Our fuzzy system includes an active rule-based subsystem that supports the specification and execution of active rules. Users can use fuzzy expressions in the rule definition to declaratively define business logic. The system supports different types of events, including temporal events and composite events, in addition to traditional mutation events.

Enterprise Information, especially in the manufacturing process, material information management is a key technology. If some companies or individuals need to communicate or exchange the material information between them and they use incompatible systems, what style of data file will be chosen to exchange? Converting the data to XML can greatly reduce this complexity and create data that can be read by many different types of applications. This paper describes basic principle about XML(Extensible Markup Language) and its security, then analyzes an application of its security.

Most healthcare data are available in XML format, which mainly focuses on the structure level and lacks support for data representation. Therefore, a variety of medical applications and medical semantic search engines have difficulty understanding and integrating healthcare data in a highly heterogeneous environment. OWL (Web Ontology Language) and Semantic Web technologies provide an infrastructure that can solve these problems. The aim of our study is to present a mechanism to ease the interpretation and automate the semantic transformation of XML healthcare data into the OWL ontology (S-Trans), which allows an easier and better semantic communication among hospital information systems. On the basis of the XML schemas (XSD or DTD), we extract the document structure and add more descriptions for XML elements. Moreover, to classify the semantic level of duplicate elements in an XML schema, we propose novel metrics to measure the similarity between them. Experimental results show that the proposed method reliably predicts semantic similarity of duplicates and produces a better-quality OWL ontology.

Since semi-structured documents (e.g., XML) could benefit greatly from database support and more specifically from object-oriented (OO) database management systems, we study the methodology of reengineering XML to object-oriented databases when database migration occurs in this paper. In particular, considering the need of processing the imprecise and uncertain information existing in practical applications, we investigate the problem of migrating fuzzy XML to fuzzy object-oriented databases. To find the object-oriented schema that best describes the existing fuzzy XML schema (DTD), we devise a comprehensive approach centering on a set of mapping rules. Such reengineering practices could not only provide a significant consolidation of the interoperability between fuzzy OO and fuzzy XML modeling techniques, but also develop the practical design methodology for fuzzy OO databases.

One of the prominent characteristics of XML applications is their dynamic nature. Changes in user requirements cause changes in schemas used in the systems and changes in the schemas subsequently make existing documents invalid. In this work, we study two tightly coupled problems--schema evolution and document adaptation. The presented approach extends an existing conceptual model for evolution of XML applications towards document adaptation, by introducing a formal framework for detecting changes between two versions of a schema. From the detected changes it is possible to create a script that transforms documents valid against the old version of the schema to documents valid against its new version.

When some companies or individuals rent the virtual host as their own servers, there is a problem: how to ensure the security of their networked database? This paper discusses security of exchanging information between virtual host and clients using XML(Extensible Markup Language). This paper also provides a safe way based on RSA algorithm and XML security suite applied in estate company

Data exchange is one of the important components of all kinds of computer network applications, is the main method to remove the “information isolated island” and is also the difficulty during the development of informalization. This paper presents a method which converts the relational database to XML(Extensible Markup Language). The method can be used to dump data between Heterogeneous Databases using XML. This paper also explains a program for implementing exchange between heterogeneous databases with PHP Programming Language by XML. The program dumps and backups between MySQL and MSSQL using XML as intermediate storage. Both ADODB and native function of PHP are used to connect the databases, and there is a comparison and evaluation about pros and cons between them. SimpleXML class of PHP is used for reading and writing.

XML is widely used nearly everywhere in modern information technology. However, traditional XML semantic constraints expression and validation is still an open issue since grammar-based or rule-based schema languages have built-in limitations in some syntax constraints expression, and the combined ones with more than two languages to check a XML putting a considerable burden on users. A domain-oriented XML expression and validation approach is proposed, which takes high level business concepts to capture the advanced XML constraints in a compact and easy understand way. Some implementation techniques and advantages are also demonstrated to show the lightweight and pragmatic of this approach.

Extracting information from semistructured documents is a very hard task, and is going to become more and more critical as the amount of digital information available on the Internet grows. Indeed, documents are often so large that the data set returned as answer to a query may be too big to convey interpretable knowledge. In this paper, we describe an approach based on Tree-Based Association Rules (TARs): mined rules, which provide approximate, intensional information on both the structure and the contents of Extensible Markup Language (XML) documents, and can be stored in XML format as well. This mined knowledge is later used to provide: 1) a concise idea-the gist-of both the structure and the content of the XML document and 2) quick, approximate answers to queries. In this paper, we focus on the second feature. A prototype system and experimental results demonstrate the effectiveness of the approach.

BonXai is a versatile schema specification language expressively equivalent to XML Schema. It is not intended as a replacement for XML Schema but it can serve as an additional, user-friendly front-end. It offers a simple way and a lightweight syntax to specify the context of elements based on regular expressions rather than on types. In this demo we show the front-end capabilities of BonXai and exemplify its potential to offer a novel way to view existing XML Schema Definitions. In particular, we present several usage scenarios specifically targeted to showcase the ease of specifying, modifying, and understanding XML Schema Definitions through BonXai.

Currently, a lot of recent electronic health records are based on XML documents. In order to integrate these heterogeneous XML medical documents efficiently, studies on finding structure and semantic similarity between XML Schemas have been exploited. The main problem is how to harvest the most appropriate relatedness to combine two schemas as a global XML Schema for reusing and referring purposes. In this paper, we propose the novel resemblance measure that concurrently considers both structural and semantic information of two specific healthcare XML Schemas. Specifically, we introduce new metrics to compute the datatype and cardinality constraint similarities, which improve the quality of the semantic assessment. On the basis of the similarity between each element pair, we put forward an algorithm to calculate the similarity between XML Schema trees. Experimental results lead to the conclusion that our methodology provides better similarity values than the others with regard to the accuracy of semantic and structure similarities.

This article is in view of the model data storage the problems in the process of interaction, through the XML data intermediate storage method, of the hydraulic press for each model will be stored in the characteristic dimensions in the XML document, according to the predetermined XML Schema (XML Schema Definition, XSD), more articulate products of various kinds of CAD model design information. In this way the data exchange, this model of data kept the way to avoid inconsistencies, transfer of data volume is small, and not in the different between platform to transmit documents appear data loss, data distortion phenomenon, for the follow-up of CAE/CAM analysis with good books.

The growing use of XML data format in global information needs an effective XML data management system. With the rapid growth of XML data in internet, we are confronted with big data issues; it's becoming a new research direction for managing massive XML data now. Conventional centralized data management technologies are limited in the aspects of efficiency, throughout and maintenance cost. This ability coupled with the increase use of XML data in different areas have triggered the need for a better method to structure a large data in order to improve query performance. Issues concerning the ways to efficiently partition large XML documents into a more manageable form are yet to be addressed. At the same time, it is essential to ensure that the partitioning method maintains the preservation of XML data hierarchical structure. Effective data management system for storing and querying large document repositories is required. Managing large XML repositories are storing and querying XML data sets within either an Enabled XML database or a Native XML database. This limitation related to xml database is resolved in this project using partition algorithm- Object Based Data Partition Algorithm. It structures large XML data logically by partitioning them into object based XML components.

This webinar introduces an approach to data access across heterogeneous data sources and Web service integration based on XML and XQuery. The webinar covers: using XML to create logical views of a variety of physical data sources, aggregating XML documents with relational data, consuming Web services in XQuery, and exposing XQuery as data services while writing, testing and deploying real XML and XQuery-based solutions. The paper conducts web service and analyzes Modern Manufacturing Enterprises heterogeneous data source and proposes a heterogeneous data integration system based Web Services. The system provides a possible approach to share and interactive enterprise data.

The importance of incorporating time in databases has been well realized by the research community. Accordingly, temporal databases have been extensively studied by researchers. The main idea is to add a time or temporal dimension to the model and then tag data elements with time in order to keep all values instead of only the last one, and hence allow for time driven queries. This way it becomes possible to retrieve various values of the same element. This leads for better knowledge discovery and trend analysis by looking back into the history to predict for the future. Unfortunately, one disadvantage of the temporal database management system is that it has not been commercialized. The work described in this paper reflects our effort to demonstrate the power and effectiveness of the temporal dimension once it is well integrated into databases. We decided on XML (eXtensible Markup Language) as the underlying data model. The motivation is twofold. First XML is a defacto standard for data exchange; we have already demonstrated the power of XML in our other work described in the literature. Second, nested bitemporal databases form one interesting type of temporal databases. Thus, our purpose is to suggest an automated system that converts a nested bitemporal database to a corresponding fuzzy XML database. Fuzzy query model has been implemented as part of the proposed framework in order to provide flexibility to a wide rang of end users willing to access the database. The implemented temporal operators are database content independent. Fuzzy elements are capable of having different membership functions and varying number of linguistic variables. We have proposed a scheme for determining membership function parameters.

This paper is about the system to process XML-based EDI e-document. This system does not use the script file when translating EDI e-document into the XML-based EDI-document. We design and implement the scanner and mapper which are the e-document processors with binary format used when reading and writing the documents. Also, we design and implement the mapping tools that graphically define the translation rules among e-documents. Therefore, the proposed XML-based EDI e-document processing system has characteristics advantages of XML and more benefits than the previous EDI e-document processing system such as faster speed, convenience, and better adaptability. Due to these advantages, this system will be widely used as the B2B gateway system.

Dataspace systems have been proposed recently as an alternative to the traditional data integration approach. They offer reduced setup time and costs by allowing cooperation among the data sources based on the knowledge gained gradually through user interaction. A dataspace is a collection of heterogeneous and beforehand unfamiliar but interrelated data sources. In this article, we consider dataspaces composed of XML-based data sources. The XML query and analysis systems designed to satisfy the user’s sophisticated information needs presuppose that they are familiar with the contents, structures and semantics of the underlying data sources. In order to provide this information, we introduce and specify a schemaless XML dataspace profiling system that assists the user in selecting data sources relevant to him/her and in validating their consistency by detecting the potential data conflicts among them. We also demonstrate how our approach affords the possibility of utilizing an advanced XML query system.

Data warehouses are systems that provide useful information to support the decision making process, thus improving organizations' business processes. These systems integrate heterogeneous sources which are not only limited to their internal business data but also include data from the Web, the latter of which have become increasingly more important in the decision making process in recent years. This has motivated the extensive use of XML in the implementation of data warehouses, in a manner which facilitates data and metadata interchange among the heterogeneous data sources from the Web and the data warehouse. However, the business information that data warehouses manage is crucial and highly sensitive, and must be carefully protected. Security is thus a key issue in the design of data warehouses, regardless of the implementation technology used. It is important to note that the data available on the Web requires particular security considerations which have been specifically tailored to these systems in order to permit their particularities to be captured correctly. Unfortunately, although security issues have been considered in the development of traditional data warehouses, current research lacks approaches with which to consider security when the target platform is based on XML technology. In order to deal with this situation, in this paper we propose a methodological approach for the model driven development of secure XML data warehouses. We also specify a set of transformation rules that are able to automatically generate not only the corresponding XML structure of the data warehouse from secure conceptual data warehouse models, but also the security rules specified within the data warehouse XML structure, thus allowing both aspects to be implemented simultaneously. We additionally introduce our secure XML DW development approach, in which the secure conceptual DW data model, the PIM, is transformed into a secure XML DW, as a PSM, by applying a set of transformation rules. Our proposal is validated through the practical application of our model driven development approach for Modeling Secure XML Data Warehouses to a case study, which is based on a central Airport DW. We first describe the transformation rules defined, then use a step by step illustration to show how they will be applied to the secure conceptual model of the case study to obtain the Secure XML Data Warehouse, thus demonstrating the benefits of our proposal, and finally we analyze how to achieve the secure implementation into commercial database management systems, providing details of the secure implementation in Oracle XML DB 11g.

XML is de-facto a standard language for data exchange. Structure of XML documents exchanged among different components of a system (e.g. services in a Service-Oriented Architecture) is usually described with XML schemas. It is a common practice that there is not only one but a whole family of XML schemas each applied in a particular logical execution part of the system. In such systems, the design and later maintenance of the XML schemas is not a simple task. In this paper we aim at a part of this problem - evolution of the family of the XML schemas. A single change in user requirements or surrounding environment of the system may influence more XML schemas in the family. A designer needs to identify the XML schemas affected by a change and ensure that they are evolved coherently with each other to meet the new requirement. Doing this manually is very time consuming and error prone. In this paper we show that much of the manual work can be automated. For this, we introduce a technique based on the principles of Model-Driven Development. A designer is required to make a change only once in a conceptual schema of the problem domain and our technique ensures semi-automatic coherent propagation to all affected XML schemas (and vice versa). We provide a formal model of possible evolution changes and their propagation mechanism. We also evaluate the approach on a real-world evolution scenario.

XML has recently emerged as the leading medium for data storage and data transfer over the World Wide Web due to its adaptable structure and flexibility in defining the tags. Many organizations had adopted XML as the principal facet in their online business applications. On the other hand, relational database is still widely used as the back-end database in most organizations. The diversity of these models need to be taken into account to ensure transparent and seamless integration. In this paper, we propose s-XML, an effective mapping scheme to bridge XML and relational database. Experimental results indicate that (1) s-XML is robust in terms of database storage and data loading; (2) s-XML processes query efficiently for complex chain and twig queries; and (3) s-XML is able to support large and skew-structured dataset as compared to relational DTD, Attribute and Edge approaches.

Markup Language (XML) is a simple text format which was designed to describe data using custom tags. The use of custom tags makes XML extremely flexible and enables it to not only describe structured data like information from a table of relational database but also semi-structured data. An XML document is self-describing which has made it a standard means of data exchange between applications and for use in configuration files of enterprise applications. The increasing preference to store and transmit data in the XML format has led to a need for searching these data stores for information. Query languages like Xpath and XQuery are used to retrieve information from xml document. But these query languages are complex for non expert user to learn. Keyword search allows such user to retrieve information without knowledge of complex query language. In this paper we proposed an algorithm for relevance ranking of nodes which retrieved as result by considering keyword ambiguity and intension of user. General Terms Information Retrieval.

In this paper we introduce a novel approach to conceptual modeling for XML schemas. Compared to other approaches, it allows for modeling of a whole family of XML schemas related to a particular application domain. It is integrated in a well-established way of software-engineering, namely Model-Driven Development (MDD). It allows software-engineers to naturally model their application domain using a conceptual schema at the platform-independent level of the MDD hierarchy. From there they can design the desired XML schemas in a form of conceptual schemas at the platform-specific level of MDD hierarchy. Schemas at the platform-specific level are then automatically translated to particular XML schemas. Beside this forward-engineering direction, reverse-engineering direction integrating existing XML schemas into the MDD hierarchy is supported as well. We provide several theoretical results which ensure correctness of the introduced approach. We exploit regular tree grammars to formalize XML schemas. We formalize the bindings between the schemas at the two MDD levels and between schemas at the platform-specific level and XML schemas. We prove that conceptual schemas specify the target XML schemas unambiguously. We also prove the expressive power of the conceptual schemas. And, finally, we prove correctness of the introduced translation algorithms between platform-specific and XML schema levels.

XML is one of the most widely accepted data representation languages in today's Internet-dominated Computing. While most XML data on the net today use commonly known structures, the power of XML lies in the ability to develop application-specific structures and models. XER (Extensible Entity Relationship) is a conceptual modeling methodology that uses visual constructs reminiscent of Entity Relationship (ER) in the logical design of XML instead of relying on the text-based DTD (Document Type Definition) and XML Schema notations. In this paper, we demonstrate how XER can be used to effectively design and analyze applications that use XML data. We also compare XER against other design constructs to demonstrate that a conceptual modeling artifact can potentially be superior to other artifacts for modeling XML structures, by significantly improving accuracy, efficiency and user satisfaction.

In this paper a model of automatic marking on access skill operation based on XML is proposed after analyzing the existing logically formalized automatic marking technology. And the implementation principles and processes are introduced with focuses on two critical technical links: XML formalized expression and XML formalized automatic marking. Define the structure of table’s information and Get the information of table in access. Introduce the implementation of automatic marking. Practice proves that it is practical and feasible to automatically score skill operation on access database based on XML

Providing efficient query to XML data for ebXML applications in e-commerce is crucial, as XML has become the most important technique to exchange data over the Internet. ebXML is a set of specifications for companies to exchange their data in e-commerce. Following the ebXML specifications, companies have a standard method to exchange business messages, communicate data, and business rules in e-commerce. Due to its tree-structure paradigm, XML is superior for its capability of storing and querying complex data for ebXML applications. Therefore, discovering frequent XML query patterns has become an interesting topic for XML data management in ebXML applications. In this paper, we present an efficient mining algorithm, namely ebXMiner, to discover the frequent XML query patterns for ebXML applications. Unlike the existing algorithms, we propose a new idea by collecting the equivalent XML queries and then enumerating the candidates from infrequent XML queries in our ebXMiner. Furthermore, our simulation results show that ebXMiner outperforms other algorithms in its execution time.

This paper introduces advantages of XML as a data exchange format, and proposes a multi-database system architecture based on XML, a data exchange platform model. We takes full advantage of is the features of XML, including good extensibility and interactivity, to implement the XML-based integration program of heterogeneous databases, making all kinds of data described in a unified XML format. And we describe the actual workflow of the system in this model and theoretically analyze the implementation details of its core modules. Finally, the workflow and the multi-database work mode for users to access databases in the system model based on XML are presented.

Data Warehouse is one of the most common ways for analyzing large data for decision based system. These data are often sourced from online transactional system. The transactional data are represented in different formats. XML is one of the worldwide standards to represent data in web based system. Numbers of organizations use XML for e-commerce and internet based applications. Integration of XML and data warehouse for the innovation of business logic and to enhance decision making has therefore emerged as a demanding area of research interest. This paper focuses on integrating XML data based on multiple related XML schemas, to an equivalent data warehouse schemas based on relational online analytical processing (ROLAP). This work bears a high relevance towards standardizing of the ETL phase (Extraction, Transformation, and Loading) of the OLAP projects. The novelty of the work is that more than one data warehouse schemas could be identified from a single related XML schema and each of them could be categorized as star schema or snowflake schema. Moreover if the individual schemas are found to be related according to the analysis, fact constellation could be identified. A new data structure, Schema Graph has been proposed in the process.

XML documents are now ubiquitous and their current applications are countless, from representing semi-structured documents to being the de facto standard for exchanging information. Viewed as partially-ordered trees, XML documents are amenable to efficient data mining techniques. In this paper, we describe how scalable algorithms can be used to mine frequent patterns from partially-ordered trees and discuss the trade-offs that are involved in the design of such algorithms.

Designing “good” XML documents is a very difficult task for a database designer. Although many theories for XML database design have proposed, none of commercial design tool for XML document design has been developed to assist the XML document designer. In this paper, the authors present a formal framework of XML document design by incorporating a conceptual model of XML schema called Graph-Document Type Definition (G-DTD) with a theory of database normalization. This framework is designed as a blueprint to help the XML database designers to perform the XML document schema design quickly and accurately. The G-DTD is used to describe the structure of XML documents at the schema level. A set of normal forms for G-DTD on the basis of rules proposed by Arenas and Libkin and Lv. et al is used to provide a guideline to a well-designed schema for XML documents. They develop a prototype of XML document schema design using a Z formal specification language. Finally, using a case study, this formal specification is validated to check for correctness and consistency of the specification. Thus, this gives a confidence that the authors’ prototype can be implemented successfully to generate an automatic XML document design.

We investigate the limitations of existing XML search methods and propose a new semantics, related relationship, to effectively capture meaningful relationships of data elements from XML data in the absence of structural constraints. Then we make an extension to XPath by introducing a new axis, related axis, to specify the related relationship between query nodes so as to enhance the flexibility of XPath. We propose to reduce the cost of computing the related relationship by a new schema summary that summarizes the related relationship from the original schema without any loss. Based on this schema summary, we introduce two indices to improve the performance of query processing. Our algorithm shows that the evaluation of most queries can be equivalently transformed into just a few selection and value join operations, thus avoids the costly structural join operations. The experimental results show that our method is effective and efficient in terms of comparing the effectiveness of the related relationship with existing keyword search semantics and comparing the efficiency of our evaluation methods with existing query engines.