Xml Validation

A great deal of research into the learning of schemas from XML data has been conducted in recent years to enable the automatic discovery of XML Schemas from XML documents when no schema, or only a low-quality one is available. Unfortunately, and in strong contrast to, for instance, the relational model, the automatic discovery of even the simplest of XML constraints, namely XML keys, has been left largely unexplored in this context. A major obstacle here is the unavailability of a theory on reasoning about XML keys in the presence of XML schemas, which is needed to validate the quality of candidate keys. The present paper embarks on a fundamental study of such a theory and classifies the complexity of several crucial properties concerning XML keys in the presence of an XSD, like, for instance, testing for consistency, boundedness, satisfiability, universality, and equivalence. Of independent interest, novel results are obtained related to cardinality estimation of XPath result sets. A mining algorithm is then developed within the framework of levelwise search. The algorithm leverages known discovery algorithms for functional dependencies in the relational model, but incorporates the above mentioned properties to assess and refine the quality of derived keys. An experimental study on an extensive body of real world XML data evaluating the effectiveness of the proposed algorithm is provided.

Much research work has recently focused on the problem of representing historical information in XML. This paper describes a number of temporal XML data models and provides their comparison according to the following properties: time dimension (valid time, transaction time), support of temporal elements and attributes, querying possibilities, association to XML Schema/DTD, and influence on XML syntax. We conclude that the approaches of managing time information using XML mostly do not require changes of current standards.

This paper explains a novel manipulation framework for XML. The key idea is to choose some example XML elements existing in the database and show the system how to manipulate them. The system then infers how to manipulate the whole collection of XML documents. The framework is unique in that while other approaches require users to write (or draw) explicit query specifications in their own query languages, ours needs implicit specifications through example operations. The problem is challenging, because XML documents can be semistructured data and inferring the intended operation is not trivial. Our algorithm is based on tree-style object modeling and path-expressions with wildcards to infer the user's intention. The paper presents the object modeling, its inference mechanism, and some results of our preliminary experiments.

XML has emerged as the standard for representing and exchanging data on the World Wide Web. It is critical to have efficient mechanisms to store and query XML data to exploit the full power of this new technology. Several researchers have proposed to use relational databases to store and query XML data. While several algorithms of schema mapping and query mapping have been proposed, the problem of mapping XML data to relational data, i.e., mapping an XML INSERT statement to a sequence of SQL INSERT statements, has not been addressed thoroughly in the literature. In this paper, we propose an efficient linear algorithm for mapping XML data to relational data. This algorithm is based on our previous proposed inlining algorithm for mapping DTDs to relational schemas and can be easily adapted to other inlining algorithms.

In this paper, we present a technique for efficient extraction of concise and accurate schemas for XML documents. By restricting the schema form and applying some heuristic rules, we achieve the efficiency and conciseness. The result of an experiment with real-life DTDs shows that our approach attains high accuracy and is 20 to 200 times faster than existing approaches.

Recently, there has been plenty of interest in XML. Since the amount of data in XML format has rapidly increased, the need for effective storage and retrieval of XML data has arisen. Many database researchers and vendors have proposed various techniques and tools for XML data storage and retrieval in recent years. In this paper, we present an XML data management system using a relational database as a repository. our XML management system stores XML data in a schema independent manner, and translates a comprehensive subset of XQuery expressions into a single SQL statement. Also, our system does not modify the relational engine. In this paper, we also present the experimental results in order to demonstrate the efficiency and scalability of our system compared with well-known XML processing systems.

Nowadays, structured documents are marked-up using XML. XML is the W3C standard that allows to give a meaning about the stored content of a document by the definition of its logical structure. A logical structure can be exploited to have a focused access to structured documents. For instance, in XML Information Retrieval, the logical structure is aimed at retrieving the most relevant fragments within documents as answers to queries, instead of the whole document. The problem arises when it is not possible to automatically define the logical structure of a document by using the methodologies presented in the literature. This position paper takes into account this situation and provides a possible solution adopted in the Enel SpA energy company.

XML is increasingly becoming the format of choice for information exchange, in critical areas such as government, finance, healthcare and law, where integrity is of the essence. As this trend grows, one can expect that documents (or collections thereof) may get quite large, and clients may wish to query for specific segments of these documents. In critical applications, clients must be assured that they are getting complete and correct answers to their queries. Existing methods for signing XML documents cannot be used to establish that an answer to a query is complete. A simple approach has a server processing queries and certifying answers by digitally signing them with an on-line private key; however, the server, and its on-line private key, would be vulnerable to external hacking and insider attacks. We propose a new approach to signing XML documents which allows untrusted servers to answer certain types of path queries and selection queries over XML documents without the need for trusted on-line signing keys. This approach enhances both the security and scalability of publishing information in XML format over the internet. In addition, it provides greater flexibility in authenticating parts of XML documents, in response to commercial or security policy considerations.

XML is increasingly becoming the format of choice for information exchange, in critical areas such as government, finance, healthcare and law, where integrity is of the essence. As this trend grows, one can expect that documents (or collections thereof) may get quite large, and clients may wish to query for specific segments of these documents. In critical applications, clients must be assured that they are getting complete and correct answers to their queries. Existing methods for signing XML documents cannot be used to establish that an answer to a query is complete. A simple approach has a server processing queries and certifying answers by digitally signing them with an on-line private key; however, the server, and its on-line private key, would be vulnerable to external hacking and insider attacks. We propose a new approach to signing XML documents which allows untrusted servers to answer certain types of path queries and selection queries over XML documents without the need for trusted on-line signing keys. This approach enhances both the security and scalability of publishing information in XML format over the internet. In addition, it provides greater flexibility in authenticating parts of XML documents, in response to commercial or security policy considerations.

XML is increasingly becoming the format of choice for information exchange, in critical areas such as government, finance, healthcare and law, where integrity is of the essence. As this trend grows, one can expect that documents (or collections thereof) may get quite large, and clients may wish to query for specific segments of these documents. In critical applications, clients must be assured that they are getting complete and correct answers to their queries. Existing methods for signing XML documents cannot be used to establish that an answer to a query is complete. A simple approach has a server processing queries and certifying answers by digitally signing them with an on-line private key; however, the server, and its on-line private key, would be vulnerable to external hacking and insider attacks. We propose a new approach to signing XML documents which allows untrusted servers to answer certain types of path queries and selection queries over XML documents without the need for trusted on-line signing keys. This approach enhances both the security and scalability of publishing information in XML format over the internet. In addition, it provides greater flexibility in authenticating parts of XML documents, in response to commercial or security policy considerations.

This paper explains why XML is rapidly becoming the enabling technology for Internet markets and trading communities. It revisits EDI's basic premise that it is easier to interconnect business systems using "document-based coupling" than in terms of application interfaces and shows how XML can breathe new life into this philosophy. It recognizes the value of preserving EDI's years of experience in designing messages that meet business process requirements and analyzes the technical limitations in both EDI and XML that make the transformation from EDI to XML challenging.

We propose a method to evaluate queries using a last-resort semantic cache in a distributed Web search engine. The cache stores a group of frequent queries and for each of these queries it keeps minimal data, that is, the list of machines that produced their answers. The method for evaluating the queries uses the inverse frequency of the terms in the queries stored in the cache (Idf) to determine when the results recovered from the cache are a good approximation to the exact answer set. Experiments show that the method is effective and efficient.

XML is emerging as a de facto standard for information exchange over the Web, while businesses and enterprises generate and exchange large amounts of XML data daily. One of the major challenges is how to query this data efficiently. Queries typically can be represented as twig patterns. Some researchers have developed algorithms that reduce the intermediate results that are generated during query processing, while others have introduced labeling schemes that encode the position of elements, enabling queries to be answered by accessing the labels without traversing the original XML documents. In this paper we outline optimizations that are based on semantics of the data being queried, and introduce efficient algorithms for content and keyword searches in XML databases. If the semantics are known we can further optimize the query processing, but if the semantics are unknown we revert to the traditional query processing approaches.

If XML is to play the critical role of the lingua franca for Internet data interchange that many predict, it is necessary to start designing and adopting benchmarks allowing the comparative performance analy sis of the tools being developed and proposed. The effectiveness of existing XML query languages has been studied by many who focused on the comparison of linguistic features, implicitly reflecting the fact that most XML tools exist only on paper. In this paper, with a focus on efficiency and concreteness, we propose a pragmatic first step toward the systematic benchmarking of XML query processing platforms with an initial focus on the data (versus document) point of view. We propose XOO7, an XML version of the OO7 benchmark. We discuss the applicability of XOO7, its strengths, limitations and the extensions we are considering. We illustrate its use by presenting and discussing the performance comparison against XOO7 of three different query processing platforms for XML.

As a simple XML query language but with enough expressive power, XPath has become very popular. To expedite evaluation of XPath queries, we consider the problem of rewriting XPath queries using materialized XPath views. This problem is very important and arises not only from query optimization in server side but also from semantic caching in client side. We consider the problem of deciding whether there exists a rewriting of a query using XPath views and the problem of finding minimal rewritings. We first consider those two problems for a very practical XPath fragment containing the descendent, child, wildcard and branch features. We show that the rewriting existence problem is coNP-hard and the problem of finding minimal rewritings is Σ p 3 . We also consider those two rewriting problems for three subclasses of this XPath fragment, each of which contains child feature and two of descendent, wildcard and branch features, and show that both rewriting problems can be polynomially solved. Finally, we give an algorithm for finding minimal rewritings, which is sound for the XPath fragment, but is also complete and runs in polynomial time for its three subclasses.

XML (eXtensible Mark-up Language) has become the fundamental standard for efficient data management and exchange. Due to the widespread use of XML for describing and exchanging data on the web, XML-based comparison is central issues in database management and information retrieval. In fact, although many heterogeneous XML sources have similar content, they may be described using different tag names and structures. This work proposes a series of algorithms for detection of structural and content changes among XML data. The first is an algorithm called XDoI (XML Data Integration Based on Content and Structure Similarity Using Keys) that clusters XML documents into subtrees using leaf-node parents as clustering points. This algorithm matches subtrees using the key concept and compares unmatched subtrees for similarities in both content and structure. The experimental results show that this approach finds much more IV. XML-SIM-CHANGE: STRUCTURE AND CONTENT SEMANTIC SIMILARITY DETECTION AMONG XML DOCUMENT VERSIONS .

XML similarity detection plays an important role in facilitating many applications such as data integration, document classification/clustering, querying, and change management. In this chapter, we present an overview on XML document syntactic and semantic similarity/distance measures along with existing research related to XML similarity detection. The measures are classified into two main categories: structural similarity, and structural and content similarity. We review similarity detection approaches proposed in the literature and discuss some of the challenges and future directions for research on XML similarity detection and related fields.

The Ranking of XML documents can be performed by using Adaptive keyword search and Reverse indexing of the XML data within which critical metrics are weighed and assigned to the XML data. This proposed system can act as an upgrade to the existing XML keyword searching pattern. The search results obtained in LCA based systems are non-adjustable and some important features like compactness and size are missed. So this proposed system aims to overcome the disadvantages of LCA methods with adaptive system containing the metrics to make the system better.

The widespread use of the XML format for document representation and message exchange has influenced techniques for data integration in last years. A development of various XML languages, methods and tools gave rise to so called XML technology. Enterprise Information Integration (EII) requires an accurate, precise and complete understanding of the disparate data sources, the needs of the information consumers, and how these map to the business concepts of the enterprise. Any integration takes place in context of an Enterprise Information System (EIS). In the paper we explain various approaches to EII, its architectures as well as its association to Enterprise Application Integration (EAI). We introduce basic features and issues of EII and justify why XML technology contributes to finding sufficiently powerful support for tools for enabling EII. In particular, a database approach to XML provides a universal solution enabling to construct tools for achieving EII. In the paper we present some features of the XML technology, mainly its database part, and show how it is usable in EII.

The increasing number of XML documents over the internet motivated us to develop indexing techniques to retrieve the XML data efficiently. Assigning unique labels to each node and determining the structural relationships is a critical problem in XML query processing. Labelling schemes designed for static XML documents will not support dynamic updates on XML documents. Some dynamic labelling schemes provide dynamic updates but, with a high cost and complexity. In this paper we propose a labelling scheme which supports the dynamic update without relabelling the existing nodes. It also determines the structural relationships efficiently by looking at the labels. A set of performance tests is carried to compute the time required to generate unique labels.

In XML Schema development, the quality of XML Schemas is a crucial issue for further steps in the life cycle of an application, closely correlated with the structure of XML Schemas and different building blocks. Current research focuses on measuring complexity of XML Schemas and mainly do not consider other quality aspects. This paper proposes a novel quality measuring approach, based on existing software engineering metrics, additionally defining quality aspect of XML Schemas in the following steps: (1) definition of six schema quality aspects, (2) adoption of 25 directly measurable XML Schema variables, (3) proposition of six composite metrics, applying 25 measured variables and (4) composite metrics validation. An experiment using 250 standard XML Schemas collected from available e-business information systems was conducted. The results illustrate influence of XML Schema characteristics on its quality and evaluate applicability of metrics in the measurement process, a useful tool...

Supporting queries and modifications on XML documents is a challenging task, and several related approaches exist. When implementing query and modification languages efficiently, the actual persistent storage of the XML data is of particular importance. Generally speaking, the structure of XML data significantly differs from the well-known relational data-model. This paper presents the prototypical implementation of NaXDB, a native XML database management system (DBMS). A native approach means the XML data is stored as a hierarchical tree of linked objects. NaXDB is implemented as a MaxDB by MySQL kernel module and thus inherits several DBMS functionality. Furthermore, NaXDB uses objectoriented extensions of of MaxDB by MySQL to store the tree of linked objects. NaXDB implements a large subset of the query language specification XQuery 1.0 as well as XUpdate for modification. The design and architecture of the prototypical implementation is presented, and concepts for query processing within the database server are discussed.

Supporting queries and modifications on XML documents is a challenging task, and several related approaches exist. When implementing query and modification languages efficiently, the actual persistent storage of the XML data is of particular importance. Generally speaking, the structure of XML data significantly differs from the well-known relational data-model. This paper presents the prototypical implementation of NaXDB, a native XML database management system (DBMS). A native approach means the XML data is stored as a hierarchical tree of linked objects. NaXDB is implemented as a MaxDB by MySQL kernel module and thus inherits several DBMS functionality. Furthermore, NaXDB uses objectoriented extensions of of MaxDB by MySQL to store the tree of linked objects. NaXDB implements a large subset of the query language specification XQuery 1.0 as well as XUpdate for modification. The design and architecture of the prototypical implementation is presented, and concepts for query processing within the database server are discussed.

Document Object Modeling (DOM) is widely used approach for retrieving data from an XML document. If the size of the XML document is very large, however, using the DOM approach for retrieving data from the XML document may suffer from a lack of memory space for building the associated XML tree in the main memory. To alleviate this problem, we propose a method that allows the very large XML document to be split into small XML documents, retrieves data from the XML tree built from each of these small XML documents, and combines the results from all of the n XML trees to generate the final result. With this proposed approach, the memory space and processing time required to retrieve data from the very large XML document using DOM are reduced so that they can be managed by one single generalpurpose personal computer.

Due to the evolution of computer systems and the proliferation of Internet, numerous information resources have been constructed. The deluge of information makes the need to integrate informations, which are distributed on the Internet and handled in heterogeneous systems. Recently, most of the XMLbased information integration systems use XML DTD (Document Type Definition) for describing integrated global schema. However, DTD has some limitations in modeling local information resources. Although W3C's XML Schema is more flexible and powerful than XML DTD in specifying integrated global schema, it has more complex problems than using DTDs in resolving conflicts. In this paper, we classify the conflict problems in integrating information resources using XML Schema, and propose conflict resolution mechanism using XQuery. Furthermore, we design an authoring toolkit for supporting user to define global schema easily with the schema definitions of local information resources.

As many metadata are encoded in XML, and many digital libraries need to manage XML documents, efficient techniques for searching in such formatted data are required. In order to efficiently process path expressions with wildcards on XML data, a new path index is proposed. Extensive evaluation confirms better performance with respect to other techniques proposed in the literature. An extension of the proposed technique to deal with the content of XML documents in addition to their structure is also discussed. Efficient management of metadata is an important issue in Digital Library systems. Simple flat solutions to metadata collections such as the Dublin Core cannot be applied to complex metadata models requested by advanced multimedia digital libraries. These complex metadata models often include nested structures, hierarchies, multiple views, and semistructured information, which cannot efficiently be handled by techniques based on a simple term inversion or by application of the relational databases. Instead, efficient technology for the management of such data should be developed. Recently, several interesting trends to processing complex metadata by means of XML structures have been observed. Specifically, new generation digital libraries, such as ECHO or OpenDlib , have chosen to encode their supported metadata with XML. Recent standards, for instance the MPEG-7 [8], require to encode metadata in XML. Moreover, some digital libraries consider XML documents as their native format of documents. The obvious advantage of encoding metadata in XML is that they can easily be exported and imported. They can also be easily read by human user in their raw format. In addition to the documents' content, XML documents contain explicit information on their structures. However, efficient management of large XML document repositories is still a challenge. Searching for information in an XML document repository involves checking structural relationships in addition to content predicates, and the process of finding structural relationships has been

This work highlights how to transform information from invoice documents to semantic models, as an implementation of ontology modeling. The migration from printed paper to digital documents in the Mexican Government Offices in the last few years has brought significant opportunities for the usage of information technologies and applications. However, when changing digital document information into knowledge, there are still many gaps to be filled. This work proposes a solution to some issues regarding ontology modeling, specifically when mapping a document that follows some XML schema to an ontology under the OWL standard. The main contribution of this work is to provide new interpretations of the XML terms in the context of OWL, so that the XML Schema Definition (XSD) structures can be mapped into more complex OWL structures. A software tool developed to test and validate the information extraction strategies proposed is presented here.

UML is being increasing used for the analysis and design of Web Information Systems. At the same time, many XML-based languages are cornerstones in the development of this kind of system. As a consequence of the predominance of these languages, there are many works in the literature devoted to exploring the relationships between UML and XML. In this paper we present a survey of current approaches to the transformation of UML models into XML schemas. The study is focused on the case of transformation of UML class diagrams to XML schemas, since we have not found any proposal regarding other kinds of UML diagrams.

Recent fashion in knowledge representation languages is to use XML as the low-level syntax. This tends to make the output of these knowledge representation languages easy for machines to parse, at the expense of human readability. The strength of XML lies in its simplicity to represent data and knowledge. It is used to develop modeling languages that are tailored to specific knowledge, and specific data structures and hierarchies. This paper considers an approach to frame knowledge representation using XML. A generalized XML model of the frame-based representation is proposed. The implementation of the XML generator, which is built into the interactive tool for frame representation is described.

Spoken Language can be used to provide insights into organisational processes, unfortunately transcription and coding stages are very time consuming and expensive. The concept of partial transcription and coding is proposed in which spoken language is indexed prior to any subsequent processing. The functional linguistic theory of texture is used to describe the effects of partial transcription on observational records. The standard used to encode transcript context and metadata is called CHAT, but a previous XML schema developed to implement it contains design assumptions that make it difficult to support partial transcription for example. This paper describes a more effective XML schema that overcomes many of these problems and is intended for use in applications that support the rapid development of spoken language deliverables.

Spoken Language can be used to provide insights into organisational processes, unfortunately transcription and coding stages are very time consuming and expensive. The concept of partial transcription and coding is proposed in which spoken language is indexed prior to any subsequent processing. The functional linguistic theory of texture is used to describe the effects of partial transcription on observational records. The standard used to encode transcript context and metadata is called CHAT, but a previous XML schema developed to implement it contains design assumptions that make it difficult to support partial transcription for example. This paper describes a more effective XML schema that overcomes many of these problems and is intended for use in applications that support the rapid development of spoken language deliverables.

In this thesis, we advocate storing XML documents in a relational DBMS, and address the related challenges. In particular, we set out to address the issues of mapping, indexing and updating XML documents. The first challenge is how to store XML documents. We propose XStorM, a mapping scheme that maps XML documents to a relational DBMS. Our experiments demonstrate that XStorM gives good query performance, uses minimal space requirement and is scalable. The second challenge is how to handle branching path (twig) queries efficiently. Inspired by the join index proposed in the relational context, we propose XJoin Index, a simple yet efficient indexing approach to shrink twigs before applying structural join algorithms. Our experiments show that the XJoin Index efficiently reduces the number of structural joins, thus improving overall query performance. The third challenge is how to handle XML updates efficiently. XML updates can be modeled as inserting/removing small XML segments into/from an existing XML database. On this premise, we propose a new lazy approach to handle XML updates. This approach avoids relabeling existing elements after updates. Our experiments show that the lazy approach is much more efficient in handling updates than using immutable labeling; at the same time, it improves the performance of the structural join algorithm by taking advantage of segments.

This paper discusses subtyping of tree-structured data encountered on the Web, e.g. XML and HTML data. Our long range objective is to define a type system for Web and/or Semantic Web query languages amenable to static type checking. We propose a type formalism motivated by XML Schema and accommodating two concepts of subtyping: inclusion subtyping (corresponding to XML Schema notion of type restriction) and extension subtyping (motivated by XML Schema's type extension). We present algorithms for checking both kinds of subtyping. The algorithms are polynomial if certain conditions are imposed on the type definitions; the conditions seem natural and not too restrictive.

e vf hg ai Ed hj lk a k a m ©n Y og pi q rj l as j t og vu a vw vs yx k p z v vw vs i %k a rg vj {w hw eg p ri % cw | if hk v} ~ %d t g pf hg a © g v r Tk af d x 4f h vi q vf hi q I ¦ r a c rg v y rg pf e v a r t rg pu p vw # v © p p od hk Bd e j l ri ©f e cg pw ej l ru ¤ rw hg vu a k v $¡ £¢ g¤ ¥g aw 6g v ¦ © § i q Tg v u a ¨k af e og d cs #© r vf e yj t u B¡ £¢ g¤ x k yi © © rd hw 6j tw 6g p tw ek Bu ag pj l j t u ªg d ed e v ad hj lk a ¬« ¥ j t t w v p vf hg p # {g v ru p rg pu p vw t © § yj {w d vs #® ¯k af e°ªj {w @ rx ©f 6® "g ªd ek x %± r d h " ² r 8w d hg p rx g pf hx 4 ¨k af ig v ³¡ £¢ g¤ B© r ©f h @ {g v u a rg vu a p« & ¦k td hg v°a ´ ¨ r l g ax g v rd hg pu p k v d h $w ~d hf e v u vd h k p d h ª £µ ¢ ¶ Gs i¡ £¢ g¤ •© r vf ej t vw mk p ¡ £¢ ¤ x yj tf d h rg v x k yi © © rd hw r © vx Rd ek ¦I d ef qg v rw e tg vd e cx 8d ek ¹ ¶ rº t¤ © r vf ej t vw £d hk I % § vi © d e cx y g ¤f h © {g d ej tk p Tg v U © u aj l r p« o ¶ y © a ©f qg v # % § j tw d ej t u B f hk v} ~ ci Ed hw t f hk p Ik aw e m g p j t u aw I %d ~® © v ¡ t¢ g¤ »x k yi © © rd hw "g p rx f h © {g d hj lk a rg v Ix g d qg vŗg aw cw ©s r d "d e r t© r vf e md ef qg v Tw {g d hj lk a f hk p t © ¼ ¨f hk p ¡ t¢ g¤ ½© r vf ej t vw d hk ¾ ¶ rº t¤ ¢© r vf ej t vw of h vi © ©j t p cx ¾ t vw hw g vd d h © rd ej tk p ¬« S ¿ g f hk p Ik aw e gg 8u p v ©f qg v $ %d h k x ¨k pf r rw rj l u ³¡ £¢ g¤ ¦© r vf ej t vw ´j l rd ek g 6f h © {g d hj lk a rg v Wx g vd hg vŢg pw e i %k a ad qg vj t j t u 6d h £¡ t¢ g¤ ¿x k i % © rd cÀ w "x g vd hg « ´Á £ f w ek p t d hj lk a ¤j {w  rà %Ä Wà %Å eAE vÇ ¦j t Bd e Tg d j ld $± d hw g ® $j {x @f qg v u a 4k v U g p j t u aw "I %d ~® © v d e @f h © {g d hj lk a rg v ¬x g vd hg g v Tx d h ¡ t¢ g¤ x k yi © © rd hw vÈ ´j ld ³ og p°p vw ³g ª og § j t g p ¯ Tw k p $d e ¤f e v tg vd ej tk p rg p ´ v u pj t © r vf e 8i ©g p rg vŗj l tj Éd hj l cw ©s g p rx 8f h © tj l cw k a ¹® © t Én Ê°y k ® $ Rg v tu pk af ej ld e r w 6 ¨f ek a Ëd e f e v tg vd ej tk p rg p ¯x g vd hg pŗg pw e o± r v tx Gs ´® $ j ti q ¾ og v°p cw 6j ld g u ak yk yx i ©g p rx j {x g d h @w k a l d hj lk a ¨k af g px x j l u ¡ t¢ g¤ 8© r ©f h i ©g p rg vŗj l tj Éd hj l cw d ek g mf h © {g d ej tk p Tg v Gw w d e v « P ¿ 6g v {w ek j t y p cw ~d hj lu rg d e ¯d e r tj t mj ld hw ik v rd h "d ef qg v Tw {g d hj lk a f hk i % vw hw #j l mu p v ©f qg v rn ¬ k pd P © p vf e rd h j l ru ti vg v mŢ "d hf hg p rw {g d h vx Gs u aj l a © d e 4j tu mx j ÉÌ W ©f h © ri © 4Ţ ©d ~® ¯ v © d h 4 % § f h vw hw j t p £ Tk ® ©f k v P ¶ rº t¤ ¿g v rx d e rg vd "d ek mŢ 4 % § I vi %d e vx ¨f hk p ¡ t¢ g¤ ¦© r ©f h o tg p u p Tg vu p cw ©È r® £ f hk yj tx £g v Bg v Tg v t yw ej {w ´k p ¦ {g v u a rg vu a ¨ vg vd e f h vw ¯d hk ³I 4 % § T ci Ed h vx ¨f ek a Íd e w d hg p rx g pf hx ¤¡ £¢ g¤ R© a r ©f h {g v u a rg vu a ps g v rx B cw ~d qg v tj {w B® $ j {i q Bk v #d e v Îi vg v BŢ 6d ef qg v rw e tg vd e cx d hk ¶ rº t¤ 8g v Tx rk ® @« Ï ªÐ rÑ WÒ hÓ Ô Õ # p ¡ t¢ g¤ is Tw v mj {w d ef h ri Ed h f e cx ¤x rg d hg rs Tº £ j t Éd cs r© r ©f h od ef qg v Tw {g d hj lk a ¬s © a r ©f h f e v® $f ej ld ej t u Ö i× ¨Ø #Ù ¬× ÛÚ ¯Ü pÝ GÞ qß qÞ à %á ~â ã ß åä qae qá ~ç è é GÝ Wä Eê %è ÊÞ qç è ë W× Ûä %Þ qê Þ cé ì @Þ qê ä Eâ íá ~î qç ï ð #ñ íê ß qñ òÞ cé ó lß ô × ¨Ø #Ù ¬× ÛÚ ¯Ü pÝ GÞ qß qÞ à %á ~â ã ß åä qae qá ~ç è é GÝ Wä Eê %è ÊÞ qç è ë Gõ UÞ qê ñ íá ~â òÞ cé ö â íä Eß åá î qç ~ï vð #ñ íê ß åñ òÞ cé ó tß ÷ Uø á ç Yù ê ñ íç Þ qâ ú ¦ê ñ à %á ~ß åî Yñ è Ûû ä qó Tì 4ï ê ñ íç Êù aÜ vü #á ~ß qý Þ qê %û %é GÝ Wä Eê %è ÊÞ qç è ë Wþ Eä Eî qî Yý Þ qê ê vð #ñ íê vó tä Eß åý Þ hè Yñ íþ vé è qï cÿ Ûý ï cá ê cç Êù á ~ê ré á 4 33 &! U5 o' ¡ £ ´3 ¦ § %5 6¡ t¢ g¤ g Tg pw iI vi ©k p d h 4w ~d qg v rx g pf hx ³ ¨k af ¯j t ¨k pf h og d hj lk a oj l rd e vf hi q Tg v u a ps ax d hk j ld hw 65 r % § j tj l tj ld ~ ps y Tk af d qg vj t tj Éd ~ g p rx Bw j t tj ti ©j Éd ~ a« Ti %f h vg pw ej t u o¡ £¢ g¤ Rg px k a d ej tk p Bj t Bd e 6j t rx Tw ~d hf e rg pw $ ¨k aw d e ©f h vx Bj t rd e v rw @f h vw e vg pf hi q Bg v Tx w d hg p rx g pf hx j 87 vg vd ej tk p %Ì Wk pf ed hw ¯k p ¤g x g vd hg 6 k x v qs © r ©f h m tg p u p rg pu p as vd ~ y j t u vi q Tg v j {w ©d hi v« Pw e T ci %j l± Ti ©g p l t x vw ej lu a vx ¨k pf 4¡ £¢ ¤ i« #º £ vf e ª {g v ru p rg pu p vw £j t ¿ Tg vf ed ej {i % {g vf 4f h vi % vj l a vx »g ¤u ak yk yx »x vg p Pk v $g d ed e © rd hj lk a ¬s ¬® $ j t l w d ek af hg pu p w e w ~d h © ow ´g p rx © r ©f h m f ek i © vw hw k af hw # ¨k af ´ rg vd ej t p ¡ t¢ g¤ x rg d hg g vf h i % f hf h © rd e t ³j t g mk af e j l ri ©j l rj l v ad r rg pw e p« ¶ yj t ri © 6 k aw d k v #d e ® ¯k af e {x GÀ w $ rw ej l r vw hw x g d qg j tw £w ~d hk pf h vx j t ªf e v tg vd ej tk p rg p 6& ¨k pf k p} ~ ci Ed n Êf h © {g d ej tk p Tg v ( i ¨k af n og vd vs Ij Éd j {w t© a rj Éd h 6 lj t°p v l ¤d e Tg d tg {g vf hu p 4 ¨f qg pi %d ej tk p ªk p #d h ¡ t¢ g¤ Rx rg d hg © § i q rg v u a vx Bg v Tx g© r ©f hj l cx ® $j Éd h j l x j l a ©f qw ok af eu rg v j 87 vg vd ej tk p rw @i ©k p rw ej tw d hw 6j l 8 åg ai Ed mk v $ yj lf ed e rg p ´¡ t¢ g¤ x k i © © rd hw ® $ k aw e x g vd hg ªj {w 6 y w ej ti vg v t l w d ek af e cx j t ªg mf e v tg vd ej tk p rg p tµ ¢ ¶ W« @9 i rx rw e ©f qw " rj t ©® Sx g d qg rx vf "d e 4 ¨k af e 0k v #¡ £¢ g¤ 8x k i © © rd hw vs rg v Tx © r vf e ¤j Éd £ rw j t u w ek p 6¡ t¢ g¤ ¹© r vf e ¤ tg p u p rg pu p a« " d d h j {w Ik pj t ad cs rd ~® k oj {w ew e vw i ©g v ªI 6j {x © rd hj ɱ r cx F " k ® d hk ³ og p ¤I %d ~® © v yj lf ed e Tg v W¡ £¢ g¤ ¦x k i © © rd hw "g v Tx f h © {g d hj lk a rg v Td hg p l cw "w ~d hk pf hj l u d e @x g vd hg rÈ g v rx k ® ¥d ek d hf hg p rw e tg vd e t¡ £¢ g¤ 8© r vf ej t vw "k a d h @ yj lf ed e rg p ¬x k i % v ad qw $j t ad hk ¶ rº t¤ ¦© a r ©f hj l cw "k p ¤d e @f h vg p ¬x g d qg « ¦k ¤w ek p t p 4d h 6± rf qw d £ f hk p t © Bs Iw v p ©f qg v & g p j t u d h vi q rj t© r cw % § j {w ~d cs T rf ek a Tk rw cx Bŗ ¤d e r ³x g vd hg vŢg pw e f h vw e vg pf hi q ¦i %k a j ld ~ ps #k pf ³f e v l cg pw e vx ¿j t ¹i %k p ©f qi %j {g v ´ f ek x Ti Ed hw vÈ Ud e r ¤i %k a l v © rd hg pf e » rg v l $k v w Ti q w ek p t d hj lk a rw Pj {w ´k aŗ yj tk p rw e t @d e d ef qg v rw e {g d ej tk p k p W¡ t¢ g¤ © r vf ej t vw Pd ek m ¶ Tº t¤ i« a " rj tw ´ rg v I ©f ´ ¨k yi © rw e vw ik a A r ¯d h " ¨ vg aw j tj t lj ld ~ k p ¯d h od hf hg p rw {g d hj lk a ¬s ¦w ej t ri % d h ©f h j {w 6g ªw vf ej tk p Tw @x g d qg B mk x v ¯g p rx ¦© a r ©f h »i ©g p rg vŗj l tj Éd ~ » j tw e og d hi q ¦I %n d ~® © v g ¶ rº t¤ 8g v rx Bg p ª¡ £¢ g¤ ¹© r vf e tg p u p rg pu p aÈ rg v rx ¬s ® $ © Bd h @d hf hg p rw {g d hj lk a ¤j {w Ik aw hw ej l t ps r® ¯ @ f hk yj tx d h @ f hk p I ©f d ef qg v Tw {g d hj lk a ¤f h t vw v« ¦® ¯k o© r cw ~d hj lk a rw $g vf hj tw e 4g d $d e rj tw $ Ik pj t rd F P® $ j {i q ¡ £¢ g¤ 8© r vf e {g v ru p rg pu p £g p rx ® $ j {i q x g vd hg m og v rj l u ® ³i ©k p rw ej {x ©f c« " w ~d qg v rx rg vf qx g© r ©f h ¤ {g v ru p rg pu p @ ¨k af £¡ t¢ g¤ R Tg pw £ k vd t p %d 4I © © ¿x %± T vx Gs W d £d h ³ ² y Ik x j t i q rg pf eu a k p Ij ld hw i © t tg pŢk af hg vd ej tk p m rg pw Pj {w hw cx & ¨ f h © tj l j t rg vf h 3( # p vf hw ej lk a rw Uk v Id e r © r ©f h g v tu p vf qg Ge í gf Ys x rg d hg k yx © he í gi 1f Ês ¬g v rx f e c© r j lf h © v ad qw pe í 0q 1f P ¨k pf £d e m ¨ d h f e w d hg v Tx g vf qx g {g v u a rg vu a pÈ Id e r vw e mx k i © © rd hw w e ©f h p 6g aw "d e r ŗg aw j {w " ¨k pf £k p f £w ~d h rx p« $ Bd h ³g pŗw e © ri © @k v ig w d hg v Tx g vf qx j 87 © vx Bw e y ad qg § Gs r® @ rw e @d e r º £ j t Éd © r vf e tg p u p rg pu p Ge gf ¬ ¨k pf $j t l t rw d ef qg d hj l u k a f " % § g v t vw v« " w t ¨k pf td e og v r j l ru rs ¬® ³I © tj t © p md h ©f h ³j {w 4 k ªw ej l u a l Tr u pk yk x ts k p as ¬w j t ri © x j ÉÌ W ©f h © rd 6x k i % v ad d ~ y I vw vs Px g d qg ªj l Tw ~d qg v ri © vw 6g p rx ¹© r ©f h ® k pf h°y lk rg px w 4 og ¿ © rd hg pj l ¯® $j tx © t ¿x j lÌ W ©f h © rd og v rj l u rw 6I %d ~® © v f h © {g d hj lk a rg v tx g d qg Rg p rx ¥¡ £¢ ¤ yj t ©® w ¤k v 6d h j tw x g vd hg « Í " vf e © ¨k pf h ps $® »w e © »d e » © cx ¥ ¨k af g  aà ©Ä Ià ©Å eAE Ç g p lu ak pf hj Éd h d e rg vd ³d hf hg p rw {g d h vw ³¡ £¢ g¤ S© r ©f hj t vw ³k p 8d h ¤¡ t¢ g¤ x rj t ©® w ³j t ad hk ¦ ¶ Tº t¤ © r ©f hj t vw ³k p 8d h x rg d hg w d ek af e cx j l ¤f e v tg vd ej tk p rg p r v u pj t vw vs WÅ eà Ê aAE vÅ u yÇ là 2£ Y£ T& ¦v "# E¥ rà w pAE g# ÊAE x oAE y y ( § ÛÄ r p« i ¿ £j {x v ad hj É ¨ g ³w j tu p rj ɱ Ti vg v rd w e ŗw e %d k p Ud e 6 Ik aw hw ej l t 6 og v r j l ru w ei q r © vw vs rf hj ti q B v k p u a Bd ek i ©k p rd hg pj l d h ³w ek p t d ej tk p Tw $ f h © yj lk a rw e l ¤ f ek a Tk rw cx j t f h vw e vg pf hi q B f hk v} ~ ci Ed qw #& ¨k af £j t t © © rd e cx gj t j t rx rw d ef hj {g v # f ek x Ti Ed hw ( Es Gg p rx g® f hk yj tx g od hf hg p rw {g d hj lk a g p lu ak pf hj Éd h d e Tg d g v r lj t vw d hk d e j {w åg v j t l ¤k v U og v j t u rw ©« Á £ f w ek p t d hj lk a ¤ f hk i % v vx w "j t d e f h © @w d e © Tw 7F p« h ¦Ô I ¹ 3R 0 H d e r ³j t ri %k a j l u ¡ £¢ ¤ ¾© r vf e By ªg v t yj l ru ¤ c© a rj l g v t © Ti % f h t vw vs Wf ej t u aj l u ¤j Éd td ek g ³ ¨k pf h ® $ j {i q ¤j {w $ k pf h 4g v f hk p rf ej {g d h ¨k af "d ef qg v rw e tg vd ej tk p ¬È yd h j {w "j tw x vw hi %f hj lI vx ¤j l ªw e vi %d ej tk p Aq « « © R q H Sd h ¿ k pf h og v tj 7 v vx ¡ £¢ ¤ © r vf e j t ad hk ¶ rº t¤ k p Sg B § ÛÅ # ¡ rAE vÇ ³Â aà ©Ä Ià ©Å § Q ¦Å eà ©Ç lAE g# § & vÄ IAE Ç w ei q r © og s pd e rg vd ´i ©g v k x © Ig v y ¡ t¢ g¤ ªx k i % r m v rd vÈ ad ef qg v rw e tg vd ej tk p f h l cw Pg vf h $ f h vw e © rd e cx ³j t ow ci Ed hj lk a « Ù ¦Ù Îê $ 1 ¦ « Ð R q Ô @ 3R ¦¥ Ð Ñ Ð aÓ $ ¨ b ªk v #d e r 6© a r ©f h od e rg vd f e cw r Éd h vx ¨f ek a d e r 4d ef qg v rw e tg vd ej tk p ©F U® 4 rw d e 4f h © {g d hj lk a rw j l ¤d e 4 y w ej ti vg v Gw ~d hk pf qg vu a £g pw og d h ©f hj tg p lj 87 © cx yj t ©® w k p vf ´d h 4u p © r ©f hj ti tw ei q r © og s g pw x %d qg vj t l cx j l ªw e vi Ed hj lk a ¨ § « " rj tw {g...

The spread of XML vindicated a project that the present authors developed earlier, independently of SGML, the parent-language of XML (SGML was originally devised for communicating structured documents). Our own project was the Navigation component of the Raffaello retrieval system. The latter was originally devised for managing the deeply nested, flexible relations that constituted the lexical database of the Onomaturge expert system for Hebrew word-formation. Whereas Raffaello within Onomaturge was a simpler version, such that retrieval was done by means of retrieval functions implemented in Lisp and reflecting the actual structure of the nested relations as known beforehand, the version of Navigation that was implemented by El-Sana under Nissan's supervision used a metadata schema. The syntax for describing metadata in Raffaello was in a language defined by Nissan, CuProS (short for Customization Production System). Whereas a few articles about Raffaello were published, none explained CuProS and the Navigation tool as implemented by El-Sana. The unabated interest in XML, Web technology, and ontologies (an area relevant for the database of Onomaturge) have vindicated Nissan's contention that nested relations (a research area in database design) should be allowed not only unlimited depth of nesting, but also extreme flexibility of structure. This is now taken for granted because of how metadata are defined for XML, but the feasibility of the idea was shown by El-Sana's managing to implement retrieval as based on metadata description, along the lines of CuProS syntax. In this article, apart from explaining the syntax of CuProS and also describing El-Sana's implementation of retrieval, we also illustrate the approach to metarepresentation through an exemplification from the structure of lexical frames in Onomaturge. In particular, we discuss variants of a given derivational pattern of wordformation, and we also discuss the evolution of terminology for given lexical concepts, throughout historical strata of Hebrew. We show how Nested Relations to Ingres Flat Relations 9.1. An Overall View 9.2. Query Handling in the Ingres-Oriented Version of Raffaello 9.3. Details of the Representation Under Ingres 10.

Currently, several researchers have proposed mapping both structure and constraints of XML documents to an object-relational database (ORDB). However, these researches cannot be conducted because of the limited range of constraints in available object-relational DBMSs. We therefore propose mapping rules that are practicable in available technologies. Normally, an XML document is treated as a database, so much data redundancy occurs. To solve this problem, we keep non-redundant data in several separate XML documents, link the data dispersed in these documents together by a mechanism called 'rlink' and then map this mechanism to ORDB. Finally we perform a case study in Oracle9i to illustrate the mapping of XML to ORDB according to our rules. Our contribution is that we find that mapping linked XML documents to traditional databases such as (O)RDB makes it easier to join several documents and to update several documents in one update command.

The past few years have seen the widespread adoption of XML as a data representation format in various middleware: databases, Web Services, messaging systems, etc. One drawback of XML has been the high cost of XML processing. We present in this paper InflateX, a system that supports efficient XML processing. InflateX advances the state of the art in two ways. First, it uses a novel representation of XML, called inflatable trees, that supports lazy construction of an XML document in-memory in response to client requests, as well as, more efficient serialization of results. Second, it incorporates a novel algorithm, based on the idea of projection [8], for efficiently constructing an inflatable tree given a set of XPath expressions. The projection algorithm presented in this paper, unlike previous work, can handle all axes in XPath, including complex axes such as ancestor. While we describe the algorithm in terms of our inflatable tree representation, it is portable to other representations of XML. We provide experiments that validate the utility of our inflatable tree representation and our projection algorithm.

The past few years have seen the widespread adoption of XML as a data representation format in various middleware: databases, Web Services, messaging systems, etc. One drawback of XML has been the high cost of XML processing. We present in this paper InflateX, a system that supports efficient XML processing. InflateX advances the state of the art in two ways. First, it uses a novel representation of XML, called inflatable trees, that supports lazy construction of an XML document in-memory in response to client requests, as well as, more efficient serialization of results. Second, it incorporates a novel algorithm, based on the idea of projection [8], for efficiently constructing an inflatable tree given a set of XPath expressions. The projection algorithm presented in this paper, unlike previous work, can handle all axes in XPath, including complex axes such as ancestor. While we describe the algorithm in terms of our inflatable tree representation, it is portable to other representations of XML. We provide experiments that validate the utility of our inflatable tree representation and our projection algorithm.

With the vastly growing data resources on the Internet, XML is one of the most important standards for document management. Not only does it provide enhancements to document exchange and storage, but it is also helpful in a variety of information retrieval tasks. Document clustering is one of the most interesting research areas that utilize XML's semi-structural nature. In this paper, we put forward a new XML clustering algorithm that relies solely on document structure. We propose the use of maximal frequent subtrees and an operator called Satisfy/Violate to divide documents into groups. The algorithm is experimentally evaluated on real and synthetic data sets with promising results.

The integration among DW, OLAP and GIS has been given considerable attention in recent years by many researchers and industrial corporations. This may be a result of: 1) DW/OLAP can improve GIS spatial queries whereas, 2) a GIS can provide better support to deal with the DW/OLAP geographic data. Some research about this integration has already been done. However, these

Background: The concept of Dual Mobility (DM) Total Hip Arthroplasty (THA) has been introduced to improve the range of motion in the post-operative hips. However, literature on the mid-term and long-term outcomes of DM-THA are relatively lacking. Question / Purpose: What are the mid-term results (minimum 5 years post-operatively) of DM THA surgeries done for various indications? Patients and Methods: We recruited sixty participants over a period of one year who underwent DM THA surgeries. The clinical outcomes were evaluated using the Harris' Hip Score (HHS) and the Oxford Hip Score (OHS). The participant subjective assessment of the post-operative condition was classified into excellent, good, and fair. Adverse events were recorded. The radiological outcomes were evaluated using the Moore's criteria of osteointegration (MCO). The scores were determined for the various age groups and participant perceptions, and compared using the one-way Analysis of Variance (ANOVA). Results: The mean age of our participants was 65.77 ± 10.13 years. Thirty-six participants reported excellent subjective post-operative outcomes. The mean values for HHS, OHS, and MCO were found to be 87.38 ± 4.41, 37.35 ± 4.60, and 3.10 ± 0.47 respectively. The HHS, OHS, and MCO were significantly better in participants who subjectively reported excellent outcomes (p < 0.001 each). The MCO was also significantly lesser with increasing age (p = 0.020). Two of our study participants experienced persistent thigh pain, while heterotrophic calcification, aseptic loosening of the hip joint prosthesis, and revision THR (at six years post-operatively) were observed in one participant each. Conclusion: We observed reasonably good clinical and radiological outcomes in our study, with most of the study participants reporting their post-operative condition to be excellent. The HHS, OHS, and MCO correlated with the participant's subjective perceptions. The overall incidence of complications was found to be low in our study.

Abstract. Mapping XML documents into relational database is a promising solution because relational databases are mature and scale very well and they have the advantages that in a relational database XML data and structured data can coexist making it possible to build application that involve both kinds of data with little extra effort. In this paper, we propose two algorithms (XRD, XRS) that maps XML documents into relational database. The algorithm steps are given in details to describe how to map the XML documents into relational ...

XML is a universal, platform independent language that describes the way, information can be stored, transferred and exchanged electronically. Any user on internet can access these XML documents & manipulate the information contents. Security is the prime concern in XML documents. Different security measures can be employed to ensure the integrity & confidentiality of XML data. Information hiding can be applied in XML documents which constitutes towards the field of steganography. Steganography is the art and science of hiding information by embedding messages within other messages so that unauthorized users can not access the information. This paper provides a new horizon for safe communication through XML on Internet. XML steganography is a solution which makes it possible to send news and information without being altered and without the fear of the messages being intercepted and traced back to sender. Different steganographic techniques have been designed which ensures that the integrity and confidentiality of data is maintained in XML documents. XML files can be secured by applying these techniques separately or by combining them. Applying these techniques collectively provides more security for the files.

The Digital Curation Centre (DCC) develops and shares expertise in digital curation and makes accessible best practices in the creation, management, and preservation of digital information to enable its use and re-use over time. Among its key objectives is the development and maintenance of a world-class digital curation manual. The DCC Digital Curation Manual is a community-driven resource-from the selection of topics for inclusion through to peer review. The Manual is accessible from the DCC web site (http://www.dcc.ac.uk/resource/curation-manual). Each of the sections of the DCC Digital Curation Manual has been designed for use in conjunction with DCC Briefing Papers. The briefing papers offer a high-level introduction to a specific topic; they are intended for use by senior managers. The DCC Digital Curation Manual instalments provide detailed and practical information aimed at digital curation practitioners. They are designed to assist data creators, curators and re-users to better understand and address the challenges they face and to fulfil the roles they play in creating, managing, and preserving digital information over time. Each instalment will place the topic on which it is focused in the context of digital curation by providing an introduction to the subject, case studies, and guidelines for best practice(s). A full list of areas that the curation manual aims to cover can be found at the DCC web site (http://www.dcc.ac.uk/resource/curation-manual/chapters). To ensure that this manual reflects new developments, discoveries, and emerging practices authors will have a chance to update their contributions annually. Initially, we anticipate that the manual will be composed of forty instalments, but as new topics emerge and older topics require more detailed coverage more might be added to the work. To ensure that the Manual is of the highest quality, the DCC has assembled a peer review panel including a wide range of international experts in the field of digital curation to review each of its instalments and to identify newer areas that should be covered. The current membership of the Peer Review Panel is provided at the beginning of this document. The DCC actively seeks suggestions for new topics and suggestions or feedback on completed Curation Manual instalments. Both may be sent to the editors of the DCC Digital Curation Manual

One of the consequences of the rapid development and dissemination of the ecosystem of XML technologies was the widespread adoption of XML as a meta-format for the specification of application configuration information. The validation of these rich configuration files with standard XML validation tools, however, is often not sufficient for error-free deployment of applications. This paper considers how to categorize some of the constraints that cannot be enforced by such tools, and discusses some XML-based approaches to enforcing such constraints before, or as part of, deployment.

XML and XML Schema are widely used in different domains for the definition of standards that enhance the interoperability between parts exchanging information through the Internet. The size and complexity of some standards, and their associated schemas, have been growing with time as new use case scenarios and data models are added to them. The common approach to deal with the complexity of producing XML processing code based on these schemas is the use of XML data binding generators. Unfortunately, these tools do not always produce code that fits the limitations of resource-constrained devices, such as mobile phones, in the presence of large schemas. In this paper we present Instance-based XML data binding, an approach to produce compact application-specific XML processing code for mobile devices. The approach utilises information extracted from a set of XML documents about how the application make use of the schemas.

XML is nowadays the dominant standard used for data exchanging and representation. XML documents can be transformed into different formats by using the transformation language XSLT. XSLT was designed to present data and transform data in XML according to the output schema of the used XSLT stylesheet. In this paper we describe how to compute automatically an output schema given an XSLT stylesheet. The main objective of our work is to develop a tool that contributes to a better understanding of the ...