Approximate CSS Styling in XSLT

2016 ◽  
Author(s):  
John Lumley
Keyword(s):  
Xml Documents ◽  
The Core ◽  
Xml Document ◽  
Execution Speed ◽  
General Architecture

This paper discusses transforming a CSS stylesheet into an XSLT transform that projects an approximation of the styling from the CSS onto a target XML document. It was developed during several XSLT-based projects involving multi-dialect XML documents, where there was a need either to evaluate CSS properties for another external tool, such as in an HTML → XSL-FO → PDF pipeline, or where a document styling needed to be “fixed” for embedding in another document, such as examples in professional papers. The paper presents examples, explains the general architecture of the generated XSLT transform, discusses how that transform is itself constructed from the CSS stylesheet and outlines the strengths and weaknesses and some of the directions in which the tool could be developed. It is approximate in that it only supports some of the core CSS features, assumes the user is “skilled in the art” and is working with CSS stylesheets that are understood and visible, and that the execution speed of the CSS “projection” is not an issue. Nevertheless, in the author's experience the ability to mix CSS styling into the “XSLT researcher's toolbox” has proved to be of some utility.

Research of Data Exchange Model among Information Systems

2014 ◽  
Vol 608-609 ◽  
pp. 401-407
Author(s):  
Su Jin Cai
Keyword(s):  
Information Systems ◽  
Data Storage ◽  
Data Exchange ◽  
Xml Schema ◽  
Exchange Model ◽  
Relational Schema ◽  
Xml Documents ◽  
The Core ◽  
Xml Document ◽  
Information Circulation

Data exchange can make different information systems of enterprises realize data interaction. The objective establishing it is to keep information sharing and synchronization in enterprises, which can effectively use resources, improve the performance of the system and speeds up information circulation. Data exchange model is the core of realizing data exchange and it has a set of completed data storage and access mechanism. The paper verifies the mapping of relational schema and XML schema, the conversion of database and XML data, and XML document schema, and the paper constructs XSLT documents among different XML schemas, and explains and implements the algorithms of the conversion among different XML documents.

XML Documents Normalization Using GN-DTD

2013 ◽  
pp. 54-77
Author(s):  
Zurinahni Zainol ◽  
Bing Wang
Keyword(s):  
Normal Forms ◽  
Document Type Definition ◽  
Document Type ◽  
Graphical Notation ◽  
Xml Documents ◽  
Type Definition ◽  
Xml Document ◽  
Multiple Levels ◽  
Normalization Process

Designing a well-structured XML document is important for the sake of readability, maintainability and more importantly to avoid both data redundancies and update anomalies. This paper proposes to improve and simplify XML structural design using a normalization process. To achieve this, Graphical Notation for Document Type Definition (GN-DTD) is used to describe the structure of XML document at the schema level. Multiple levels of normal forms for GN-DTD are proposed and the corresponding normalization rules to transform from poorly designed into well-designed XML documents. A case study is presented to show the application of these normal forms and normalization algorithm.

An Algorithm for Transforming XML Documents Schema into Relational Database Schema

2011 ◽  
pp. 171-189 ◽  
Author(s):  
Abad Shah ◽  
Jacob Adeniyi ◽  
Tariq Al Tuwairqi
Keyword(s):  
Relational Database ◽  
Database Schema ◽  
The Internet ◽  
Xml Documents ◽  
Simpler Algorithm ◽  
Xml Document ◽  
Database Technology ◽  
Relational Database Schema ◽  
Xml Technologies ◽  
The Web

The Web and XML have influenced all walks of lives of those who transact business over the Internet. People like to do their transactions from their homes to save time and money. For example, customers like to pay their utility bills and other banking transactions from their homes through the Internet. Most companies, including banks, maintain their records using relational database technology. But the traditional relational database technology is unable to provide all these new facilities to the customers. To make the traditional relational database technology cope with the Web and XML technologies, we need a transformation between the XML technology and the relational database technology as middleware. In this chapter, we present a new and simpler algorithm for this purpose. This algorithm transforms a schema of a XML document into a relational database schema, taking into consideration the requirement of relational database technology.

A Framework for Efficient Association Rule Mining in XML Data

2009 ◽  
pp. 505-526
Author(s):  
Ji Zhang ◽  
Han Liu ◽  
Tok Wang Ling ◽  
Robert M. Bruckner ◽  
A Min Tjoa
Keyword(s):  
Greedy Algorithm ◽  
Association Rule Mining ◽  
Data Selection ◽  
Rule Mining ◽  
Raw Data ◽  
Confidence Levels ◽  
Xml Documents ◽  
Xml Document ◽  
Efficient Data ◽  
Integrate Data

In this article, we propose a framework, called XAR-Miner, for mining ARs from XML documents efficiently. In XAR-Miner, raw data in the XML document first are preprocessed to transform either to an Indexed XML Tree (IX-tree) or to Multirelational Databases (Multi-DB), depending on the size of the XML document and the memory constraint of the system, for efficient data selection and AR mining. Concepts that are relevant to the AR mining task are generalized to produce generalized metapatterns. A suitable metric is devised for measuring the degree of concept generalization in order to prevent undergeneralization or overgeneralization. Resulting generalized metapatterns are used to generate large ARs that meet the support and confidence levels. A greedy algorithm is also presented in order to integrate data selection and large itemset generation to enhance the efficiency of the AR mining process. The experiments conducted show that XAR-Miner is more efficient in performing a large number of AR mining tasks from XML documents than the state-of-the-art method of repetitively scanning through XML documents in order to perform each of the mining tasks.

Abstract DTD Graph from an XML Document

2010 ◽  
pp. 204-224
Author(s):  
Joseph Fong ◽  
Herbert Shiu
Keyword(s):  
Relational Database ◽  
The Internet ◽  
Conceptual Schema ◽  
Reverse Engineer ◽  
Xml Documents ◽  
Data Interchange ◽  
Data Semantics ◽  
Xml Document ◽  
Extensible Markup ◽  
Implicit And Explicit

Extensible Markup Language (XML) has become a standard for persistent storage and data interchange via the Internet due to its openness, self-descriptiveness and flexibility. This chapter proposes a systematic approach to reverse engineer arbitrary XML documents to their conceptual schema – Extended DTD Graphs ? which is a DTD Graph with data semantics. The proposed approach not only determines the structure of the XML document, but also derives candidate data semantics from the XML element instances by treating each XML element instance as a record in a table of a relational database. One application of the determined data semantics is to verify the linkages among elements. Implicit and explicit referential linkages are among XML elements modeled by the parent-children structure and ID/IDREF(S) respectively. As a result, an arbitrary XML document can be reverse engineered into its conceptual schema in an Extended DTD Graph format.

General Architecture for Generation of Slide Presentations, including PowerPoint, from arbitrary XML Documents

2013 ◽  
Author(s):  
Eliot Kimber
Keyword(s):  
General Structure ◽  
Xml Documents ◽  
Implementation Effort ◽  
Training Content ◽  
General Architecture ◽  
Intermediate Format ◽  
Specific Challenge

PowerPoint slide decks are often required for training content authored in XML. Until recently, this was difficult for many users. With the development of the Apache POI library, it is now possible to reliably generate PowerPoint documents with a minimum of implementation effort. This paper presents a general architecture for generating slide presentations of any format from XML of any sort through the use of an intermediate format that abstracts the general structure of PowerPoint-type presentations. This general architecture allows the same source to potentially produce PowerPoint, Slidey, PDF, or any other presentation-optimized format from the same source with a minimum of implementation effort. The paper focuses on the specific challenge of producing PowerPoint using this architecture.

scholarly journals STRUCTURAL CLASSIFICATION OF XML DOCUMENTS USING MULTISETS

2008 ◽  
Vol 17 (05) ◽  
pp. 1003-1022 ◽  
Author(s):  
SWAMI IYER ◽  
DAN A. SIMOVICI
Keyword(s):  
Symmetric Difference ◽  
Structural Classification ◽  
High Quality ◽  
Xml Documents ◽  
Xml Document ◽  
Measure Of Similarity ◽  
Difference Operation

In this paper, we investigate the problem of clustering XML documents based on their structure. We represent the paths in an XML document as a multiset and use the symmetric difference operation on multisets to define certain metrics. These metrics are then used to obtain a measure of similarity between any two documents in a collection. Our technique was successfully applied to real and synthesized XML documents yielding high-quality clusterings.

The Research of Heterogeneous Database Migration Based on XML and Middleware

2014 ◽  
Vol 556-562 ◽  
pp. 3350-3353
Author(s):  
Sai Dong Lv ◽  
Yao Wen Xia
Keyword(s):  
Data Transfer ◽  
Data Extraction ◽  
Heterogeneous Database ◽  
Xml Documents ◽  
Source Database ◽  
Xml Document ◽  
Cross Platform ◽  
Target Database ◽  
New System ◽  
System Upgrades

For many government departments or enterprises to use new system upgrades, data transfer between heterogeneous database problem, this paper puts forward a kind of heterogeneous database based on XML and middleware model of data migration.The model by using XML technology to build a middleware, through the ODBC interface connected to the source database and target database.After extracting data from the source database into a unified XML documents, again according to the mapping relationship between old and new database and XSL document, and converts it to meet the needs of the target XML document, the target database and load the data to the target database.The model including data extraction, transformation, validation, write, and other functions, is a cross-platform, easy extensibility and reusability.

A Formal Approach for Securing XML Document

2010 ◽  
Vol 1 (1) ◽  
pp. 41-53
Author(s):  
Yun Bai
Keyword(s):  
High Level Language ◽  
Security Issue ◽  
Formal Approach ◽  
Web Based ◽  
Protection Mechanism ◽  
Xml Documents ◽  
Web Document ◽  
Xml Document ◽  
Increasing Demand ◽  
High Level

With the ever increasing demand for the Web-based applications over the Internet, the related security issue has become a great concern. Web document security has been studied by many researchers and various security mechanisms have been proposed. The aim of this article is to investigate the security issue of the XML documents. We discuss a protection mechanism and investigate a formal approach to ensure the security of Web-based XML documents. Our approach starts by introducing a high level language to specify an XML document and its protection authorizations. We also discuss and investigate the syntax and semantics of the language. The flexible and powerful access control specification can effectively protect the documents from unauthorized attempts.

On the Usage of Structural Information in Constrained Semi-Supervised Clustering of XML Documents

2008 ◽  
pp. 67-86
Author(s):  
Eduardo Bezerra ◽  
Geraldo Xexéo ◽  
Marta Mattoso
Keyword(s):  
Prior Knowledge ◽  
Structural Information ◽  
Logical Structure ◽  
Structured Data ◽  
Constrained Clustering ◽  
Xml Documents ◽  
Clustering Model ◽  
Xml Document ◽  
Document Collection

In this chapter, we consider the problem of constrained clustering of documents. We focus on documents that present some form of structural information, in which prior knowledge is provided. Such structured data can guide the algorithm to a better clustering model. We consider the existence of a particular form of information to be clustered: textual documents that present a logical structure represented in XML format. Based on this consideration, we present algorithms that take advantage of XML metadata (structural information), thus improving the quality of the generated clustering models. This chapter also addresses the problem of inconsistent constraints and defines algorithms that eliminate inconsistencies, also based on the existence of structural information associated to the XML document collection.

Sign in / Sign up

Export Citation Format

Share Document