To see the other types of publications on this topic, follow the link: XML schema.
Dissertations / Theses on the topic 'XML schema'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'XML schema.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
1
Philippe, Marie. "XML Schema." [S.l.] : [s.n.], 2002. http://www.enssib.fr/bibliotheque/documents/dessride/rrbphilippe.pdf.
Full text
2
Zainol, Zurinahni. "XML documents schema design." Thesis, University of Hull, 2012. http://hydra.hull.ac.uk/resources/hull:8315.
Full textAbstract:
The eXtensible Markup Language (XML) is fast emerging as the dominant standard for storing, describing and interchanging data among various systems and databases on the intemet. It offers schema such as Document Type Definition (DTD) or XML Schema Definition (XSD) for defining the syntax and structure of XML documents. To enable efficient usage of XML documents in any application in large scale electronic environment, it is necessary to avoid data redundancies and update anomalies. Redundancy and anomalies in XML documents can lead not only to higher data storage cost but also to increased costs for data transfer and data manipulation. To overcome this problem, this thesis proposes to establish a formal framework of XML document schema design. To achieve this aim, we propose a method to improve and simplify XML schema design by incorporating a conceptual model of the DTD with a theory of database normalization. A conceptual diagram, Graph-Document Type Definition (G-DTD) is proposed to describe the structure of XML documents at the schema level. For G- DTD itself, we define a structure which incorporates attributes, simple elements, complex elements, and relationship types among them. Furthermore, semantic constraints are also precisely defined in order to capture semantic meanings among the defined XML objects. In addition, to provide a guideline to a well-designed schema for XML documents, we propose a set of normal forms for G-DTD on the basis of rules proposed by Arenas and Libkin and Lv. et al. The corresponding normalization rules to transform from a G- DTD into a normal form schema are also discussed. A case study is given to illustrate the applicability of the concept. As a result, we found that the new normal forms are more concise and practical, in particular as they allow the user to find an 'optimal' structure of XML elements/attributes at the schema level. To prove that our approach is applicable for the database designer, we develop a prototype of XML document schema design using a Z formal specification language. Finally, using the same case study, this formal specification is tested to check for correctness and consistency of the specification. Thus, this gives a confidence that our prototype can be implemented successfully to generate an automatic XML schema design.
3
Tsoulos, Kostis. "XML schema support in MXquery /." Zürich : ETH, Eidgenössische Technische Hochschule Zürich, Databases and Information Systems Group, 2008. http://e-collection.ethbib.ethz.ch/show?type=dipl&nr=383.
Full text
4
Minh, Tran Thi Hong. "Approaches to XML schema matching." Thesis, University of East Anglia, 2007. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.441541.
Full text
5
Buntin, Scott McCollum. "XML Schema inference with XSLT." [Gainesville, Fla.] : University of Florida, 2001. http://etd.fcla.edu/etd/uf/2001/anp4321/thesis.pdf.
Full textAbstract:
Thesis (M.S.)--University of Florida, 2001.<br>Title from first page of PDF file. Document formatted into pages; contains viii, 135 p.; also contains graphics. Vita. Includes bibliographical references (p. 132-134).
6
Saude, Andre Vital. "Gerador automatico de editores XML baseado no XML schema." [s.n.], 2003. http://repositorio.unicamp.br/jspui/handle/REPOSIP/259795.
Full textAbstract:
Orientador: Roberto de Alencar Lotufo<br>Dissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica e de Computação<br>Made available in DSpace on 2018-08-03T19:17:32Z (GMT). No. of bitstreams: 1
Saude_AndreVital_M.pdf: 1540852 bytes, checksum: ad2ecda7f7d3f26db74368ec25d80598 (MD5)
Previous issue date: 2003<br>Mestrado
7
Checiu, Laurentiu. "A new XML schema mapping architecture." Thesis, University of Ottawa (Canada), 2008. http://hdl.handle.net/10393/27624.
Full textAbstract:
This thesis presents a solution for an XML Schema mapping problem. Furthermore, this thesis shows how this solution can be used in a practical way.
The research presented in this thesis is based on a novel approach for the internal representation of the XML Schema during the matching process. This internal representation uses the XML Schema Infoset Model. The majority of XML schema matching tools use a graph representation for XML schemas. This representation leads to limitations regarding XML Schema documents complexity and scalability of the matching tool.
An important feature that was also implemented is the mapping refinement by a user at the end of the automatic matching process. Two XML schemas can be mapped in different ways and these mappings can be stored in a repository. A domain expert can then decide which mapping is best suited for the two XML schemas.
8
Maalej, Mustapha [Verfasser]. "Generieren von XML-Editoren in XForms aus XML Schema / Mustapha Maalej." München : Verlag Dr. Hut, 2014. http://d-nb.info/1053860102/34.
Full text
9
Myklebust, Trond Aksel. "Indeksering av heterogene XML dokumenter ved hjelp av datatyper fra XML Schema." Thesis, Norwegian University of Science and Technology, Department of Computer and Information Science, 2006. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-10772.
Full textAbstract:
<p>Denne masteroppgaven foreslår og undersøker en metode for hvordan informasjons-gjenfinning i heterogene XML dokumenter kan gjøres ved å differensiere indekserings-prosessen ut i fra datatyper angitt i tilhørende XML Schema. Målet er å tilby bedre søkemuligheter for informasjonssøkere ved å muliggjøre spørringer som er uavhengige av elementnavn i en samling av forskjellig strukturerte dokumenter. Informasjonssøking foregår i dag primært i ustrukturerte dokumenter der betydningen av innholdet ikke er direkte kjent. Dette krever kompliserte og unøyaktige tolkninger av innholdet for å kunne trekke ut hva som er hva og hvordan dokumentene best mulig kan indekseres. En stadig økende mengde produsert informasjon og metadata gjør dette til en krevende prosess å utføre manuelt. Det trengs derfor nye metoder der innholdet blir beskrevet ved produksjonstidspunktet slik at en datamaskin automatisk kan forstå dokumentenes innhold. Semistrukturerte dokumentformater som XML inneholder støtte for spesifisering av slik informasjon og muliggjør differensiert indeksering av innholdet basert på annotert informasjon. Dette gjør mer detaljerte spørringer enn tidligere mulig men stiller nye krav til de metoder som brukes for å indeksere dokumentene. En av de største utfordringene er å lokalisere og tolke den informasjonen som øker kvaliteten på resultatet av et søk uten at noe informasjon forsvinner. Informasjonen eksisterer ikke i en flat tekstfil, men inneholder distinkte datatyper som må behandles individuelt. Dette krever nye metoder som muliggjør indeksering basert på denne informasjonen. I denne oppgaven presenteres et forslag til et system som indekserer XML dokumenter ved å tolke tilhørende XML Schema inneholdende annotasjoner av datatype og dataformat. Ved å bruke for hvert element denne informasjonen er ønsket at indekseringen gjøres ved å automatisk normalisere elementinnholdet ut i fra angitt format og datatype. Søk kan dermed optimaliseres basert på datatype uavhengig av om originalt format og dokumentstruktur er forskjellig. Testing av systemet er gjennomført for å finne ut hvordan eksisterende XML dokumenter støtter denne typen indeksering og eventuelle løsninger for hvordan det kan gjøres bedre. Utkommet fra arbeidet på oppgaven og hovedkonklusjonen er at den foreslåtte metoden fungerer godt som løsning på problemstillingen, gitt at de eksterne data som brukes er strukturert slik at datatyper kan defineres for innholdet.</p>
10
Rittinger, Jan. "XML Schema Import for the Pathfinder XQuery Compiler." [S.l. : s.n.], 2004. http://www.bsz-bw.de/cgi-bin/xvms.cgi?SWB11513806.
Full text
11
Klinger, Stefan. "Streaming XML Schema Validation for Relational Tree Encodings." [S.l. : s.n.], 2004. http://www.bsz-bw.de/cgi-bin/xvms.cgi?SWB11103954.
Full text
12
Dinakenyane, Otlhapile. "SIQXC : Schema Independent Queryable XML Compression for smartphones." Thesis, University of Sheffield, 2014. http://etheses.whiterose.ac.uk/7184/.
Full textAbstract:
The explosive growth of XML use over the last decade has led to a lot of research on how to best store and access it. This growth has resulted in XML being described as a de facto standard for storage and exchange of data over the web. However, XML has high redundancy because of its self-describing nature making it verbose. The verbose nature of XML poses a storage problem. This has led to much research devoted to XML compression. It has become of more interest since the use of resource constrained devices is also on the rise. These devices are limited in storage space, processing power and also have finite energy. Therefore, these devices cannot cope with storing and processing large XML documents. XML queryable compression methods could be a solution but none of them has a query processor that runs on such devices. Currently, wireless connections are used to alleviate the problem but they have adverse effects on the battery life. They are therefore not a sustainable solution. This thesis describes an attempt to address this problem by proposing a queryable compressor (SIQXC) with a query processor that runs in a resource constrained environment thereby lowering wireless connection dependency yet alleviating the storage problem. It applies a novel simple 2 tuple integer encoding system, clustering and gzip. SIQXC achieves an average compression ratio of 70% which is higher than most queryable XML compressors and also supports a wide range of XPATH operators making it competitive approach. It was tested through a practical implementation evaluated against the real data that is usually used for XML benchmarking. The evaluation covered the compression ratio, compression time and query evaluation accuracy and response time. SIQXC allows users to some extent locally store and manipulate the otherwise verbose XML on their Smartphones.
13
Amano, Shun’ichi. "XML data exchange under expressive mappings." Thesis, University of Edinburgh, 2009. http://hdl.handle.net/1842/3856.
Full textAbstract:
Data Exchange is the problem of transforming data in one format (the source schema) into data in another format (the target schema). Its core component is a schema mapping, which is a high level specification of how such transformation should be done. Relational data exchange has been extensively studied, but exchanging XML data have been paid much less attention. The goal of this thesis is to develop a theory of XML data exchange with expressive schema mappings, extending a previous work using restricted mappings. Our mapping language is based on tree patterns that can use horizontal navigation and data comparison in addition to downward navigation. First we look at static analysis problems concerning a single mapping. More specif- ically, we consider consistency problems with different flavours. One such problem, for instance, asks if any tree has a solution under the given mapping. Then we turn to analyse the complexity of mapping themselves, i.e., recognising pairs of trees such that the one is mapped to the other. For both problems, we provide classifications based on sets of features used in the mappings. Second we investigate the composition of XML schema mappings. Generally it is hard, or rather simply impossible, to achieve closure under composition in XML settings unlike in relational settings. Nevertheless we identify a class of XML schema mappings that is closed under composition. Lastly we consider the problem of query answering. It is important to exchange data so that we can feasibly answer queries while it often leads to intractability. We identify the dividing line between tractable and intractable cases: answering queries with extended features is always intractable while tractability of answering simple queries can be retained in extended mappings.
14
Al-Kamha, Reema. "Conceptual XML for Systems Analysis." Diss., CLICK HERE for online access, 2007. http://contentdm.lib.byu.edu/ETD/image/etd1890.pdf.
Full text
15
Kane, Bintou. "Consistently updating XML documents using incremental checks with Xqueries." Link to electronic thesis, 2003. http://www.wpi.edu/Pubs/ETD/Available/etd-0505103-101820.
Full text
16
Corry, Diarmuid, and Alan Cooke. "XML: A GLOBAL STANDARD FOR THE FLIGHT TEST COMMUNITY." International Foundation for Telemetering, 2004. http://hdl.handle.net/10150/605327.
Full textAbstract:
International Telemetering Conference Proceedings / October 18-21, 2004 / Town & Country Resort, San Diego, California<br>Much effort has been spent on developing physical layer standards to ease multi-vendor
inter-operability. However as anyone familiar with real-life system integration knows a
large gap exists in defining system configuration and set-up, not just between vendors but
also between different groups on the base.
Different solutions to this problem have been attempted (for example TMATS).
However, the emergence of XML (eXtensible Markup Language) as a commercial
standard presents a new opportunity to define a powerful and extensible tool for data-interchange
between different systems.
This paper introduces the self-documenting standard for information exchange that is
XML. A generic model for flight test data acquisition is presented. Finally, an XML
vocabulary (or schema) based on this model is proposed. This schema could form the
basis for an industry wide XML standard to simplify the problem of data interchange
between vendors, between programs, even between different databases in the same
organisation.
17
Parthepan, Vijayeandra. "Efficient Schema Extraction from a Collection of XML Documents." TopSCHOLAR®, 2011. http://digitalcommons.wku.edu/theses/1061.
Full textAbstract:
The eXtensible Markup Language (XML) has become the standard format for data exchange on the Internet, providing interoperability between different business applications. Such wide use results in large volumes of heterogeneous XML data, i.e., XML documents conforming to different schemas. Although schemas are important in many business applications, they are often missing in XML documents. In this thesis, we present a suite of algorithms that are effective in extracting schema information from a large collection of XML documents. We propose using the cost of NFA simulation to compute the Minimum Length Description to rank the inferred schema. We also studied using frequencies of the sample inputs to improve the precision of the schema extraction. Furthermore, we propose an evaluation framework to quantify the quality of the extracted schema. Experimental studies are conducted on various data sets to demonstrate the efficiency and efficacy of our approach.
18
Koszinowski, Linus. "Flexibel extraktion av data från XMI-dokument, utan tillgång till DTD eller XML-schema." Thesis, University of Skövde, School of Humanities and Informatics, 2005. http://urn.kb.se/resolve?urn=urn:nbn:se:his:diva-1006.
Full textAbstract:
<p>Undersökningen behandlar problem som tidigare forskning har uppmärksammat kring användandet av standarden XMI. XMI är avsedd för utbyte av modeller mellan modelleringsverktyg. Problem som uppmärksammats i användningen av XMI är att information om modeller inte alltid utbyts korrekt mellan verktyg. Detta kan resultera i att viktig information om modellerna går förlorad.</p><p>Undersökningen har till syfte att undersöka huruvida det är möjligt att extrahera data från modeller sparade i XMI-format utan tillgång till DTD eller XML-schema. En sådan möjlighet skulle kunna användas för att rädda information om modeller som annars skulle gå förlorad.</p><p>Den metod som har används för undersökningen är litteraturstudie, experiment och implementation samt hypotesprövning. Studien har resulterat i en implementation som är avsedd för att extrahera och presentera information från XMI-dokument.</p><p>Den slutsats som dras från undersökningen är att det går att extrahera data från modeller sparade i XMI-dokument förutsatt att sättet på vilken XMI-standarden har tillämpats är känt sedan tidigare.</p>
19
Jildenhed, Mattias. "XML-baserade dataöverföringar i flera steg." Thesis, University of Skövde, School of Humanities and Informatics, 2004. http://urn.kb.se/resolve?urn=urn:nbn:se:his:diva-862.
Full textAbstract:
<p>Behovet av datautbyte mellan olika system, ökar ständigt. Därför byggs fler och fler system med möjligheten att utbyta och överföra data via XML. Då olika system lagrar data på olika sätt, måste de strukturella och innehållsmässiga skillnaderna hanteras innan data kan överföras.</p><p>Syftet med detta arbete är att undersöka hur dataöverföringar mellan XML-dokument i flera steg påverkas av strukturella eller innehållsmässiga skillnader. Arbetet visar i vilka fall data inte kan överföras korrekt. Studien utförs genom en experimentell metod. Experimenten genomförs med en applikation som utvecklats för ändamålet.</p><p>Resultatet från studien visar att problem kan uppstår då käll- och målstrukturen lagrar ett element eller attribut med olika datatyper, de övriga strukturmässiga skillnaderna genererar få problem. De innehållsmässiga skillnaderna medför att data inte kan identifieras då attributet saknas i käll- eller målstrukturen.</p>
20
Kramer, Diane S. "XEM: XML Evolution Management." Digital WPI, 2001. https://digitalcommons.wpi.edu/etd-theses/912.
Full textAbstract:
"As information on the World Wide Web continues to proliferate at an astounding rate, the Extensible Markup Language (XML) has been emerging as a standard format for data representation on the web. In many application domains, specific document type definitions (DTDs) are designed to enforce a semantically agreed-upon structure of the XML documents. In XML context, these structural definitions serve as schemata. However, both the data and the structure (schema) of XML documents tend to change over time for a multitude of reasons, including to correct design errors in the DTD, to allow expansion of the application scope over time, or to account for the merging of several businesses into one. Most of the current software tools that enable the use of XML do not provide explicit support for such data or schema changes. Using these tools in a changing environment entails making manual edits to DTDs and XML data and reloading them from scratch. In this vein, we put forth the first solution framework, called XML Evolution Manager (XEM), to manage the evolution of DTDs and XML documents. XEM provides a minimal yet complete taxonomy of basic change primitives. These primitives, classified as either data or schema changes, are consistency-preserving. For a data change, they ensure that the modified XML document conforms to its DTD both in structure and constraints. For a schema change, they ensure that the new DTD is well-formed, and all existing XML documents are transformed also to conform to the modified DTD. We prove both the completeness of our evolution taxonomy, as well as its consistency-preserving nature. To verify the feasibility of our XEM approach we have implemented a working prototype system in Java, using the XML4J parser from IBM and PSE Pro as our backend storage system. We present an experimental study run on this system where we compare the relative efficiencies of the primitive operations in terms of their execution times. We then contrast these execution times against the time to reload the data, which would be required in a manual system. Based on the results of these experiments we conclude that our approach improves upon the previous method of making manual changes and reloading data from scratch by providing automated evolution management facilities for DTDs and XML documents."
21
Groppe, Jinghua. "Speeding up XML querying satisfiability test & containment test of Xpath queries in the presence of XML schema definitions." Berlin dissertation.de, 2008. http://d-nb.info/990324427/04.
Full text
22
Ho, Terence Cheung-Fai. "On detecting and repairing inconsistent schema mappings." Thesis, University of British Columbia, 2008. http://hdl.handle.net/2429/4126.
Full textAbstract:
Huge amount of data flows around the Internet every second, but for the data to be
useful at its destination, it must be presented in a way such that the target has little problem interpreting it. Current data exchange technologies may rearrange the
structure of data to suit expectations at the target. However, there may be semantics
behind data (e.g. knowing the title of a book can determine its #pages) that may
be violated after data translation. These semantics are expressed as integrity constraints (IC) in a database. Currently, there is no guarantee that the exchanged data
conforms to the target’s ICs. As a result, existing applications (e.g. user queries)
that assume such semantics will no longer function correctly. Current constraint
repair techniques deal with data after it has been translated; thus take no consideration of the integrity constraints at the source. Moreover, such constraint repair
methods usually involve addition/deletion/modification of data, which may yield
incomplete or false data. We consider the constraints of both source and target
schemas; together with the mapping, we can efficiently detect which constraint is
violated and suggest ways to correct the mappings.
23
Almuna, Herrera Esteban Mauricio. "Contenidos para repositorio de esquemas y metadatos documentos electrónicos de servicios públicos." Tesis, Universidad de Chile, 2007. http://www.repositorio.uchile.cl/handle/2250/104664.
Full text
24
Darr, Tim, John Hamilton, and Ronald Fernandes. "Design Considerations for XML-Based T&E Standards." International Foundation for Telemetering, 2011. http://hdl.handle.net/10150/595666.
Full textAbstract:
ITC/USA 2011 Conference Proceedings / The Forty-Seventh Annual International Telemetering Conference and Technical Exhibition / October 24-27, 2011 / Bally's Las Vegas, Las Vegas, Nevada<br>The next generation of telemetry systems will rely heavily on XML-based standards. Multiple standards are currently being developed and reviewed by the T&E community, including iNET's Metadata Description Language (MDL), the XML-version of IRIG 106, Chapter 9 (TMATS XML), the Instrumentation Hardware Abstraction Language (IHAL), and the Data Display Markup Language (DDML). In this paper, we share design considerations for developing XML-based T&E standards, gained from our experiences in designing IHAL and DDML.
25
Kancham, Reddy Kiran. "Fully exploiting XML schema constraints on tree pattern query minimization /." Available to subscribers only, 2005. http://proquest.umi.com/pqdweb?did=1079672411&sid=20&Fmt=2&clientId=1509&RQT=309&VName=PQD.
Full text
26
Vyšniauskaitė, Ramutė. "XML schemų sudarymo ir normalizavimo metodika." Master's thesis, Lithuanian Academic Libraries Network (LABT), 2005. http://vddb.library.lt/obj/LT-eLABa-0001:E.02~2005~D_20050525_091727-93586.
Full textAbstract:
In this work analyses the transition from UML class diagrams to XML schema. The main problems, such as - UML does not include all the features required to describe a XML schema - are explored. Also, the principles of XML schema normalization, resemblances and differences between applying normal forms to XML documents and relational data bases are presented.
27
Wilk, Artur. "Types for XML with Application to Xcerpt." Doctoral thesis, Linköping : Department of Computer and Information Science, Linköpings universitet, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-10687.
Full text
28
Shamsedin, Tekieh Razieh Sadat Information Systems Technology & Management Australian School of Business UNSW. "An XML-based framework for electronic business document integration with relational databases." Publisher:University of New South Wales. Information Systems, Technology & Management, 2009. http://handle.unsw.edu.au/1959.4/43695.
Full textAbstract:
Small and medium enterprises (SMEs) are becoming increasingly engaged in B2B interactions. The ubiquitousness of the Internet and the quasi-reliance on electronic document exchanges with larger trading partners have fostered this move. The main technical challenge that this brings to SMEs is that of business document integration: they need to exchange business documents with heterogeneous document formats and also integrate these documents with internal information systems. Often they can not afford using expensive, customized and proprietary solutions for document exchange and storage. Rather they need cost-effective approaches designed based on open standards and backed with easy-to-use information systems. In this dissertation, we investigate the problem of business document integration for SMEs following a design science methodology. We propose a framework and conceptual architecture for a business document integration system (BDIS). By studying existing business document formats, we recommend using the GS1 XML standard format as the intermediate format for business documents in BDIS. The GS1 standards are widely used in supply chains and logistics globally. We present an architecture for BDIS consisting of two layers: one for the design of internal information system based on relational databases, capable of storing XML business documents, and the other enabling the exchange of heterogeneous business documents at runtime. For the design layer, we leverage existing XML schema conversion approaches, and extend them, to propose a customized and novel approach for converting GS1 XML document schemas into relational schemas. For the runtime layer, we propose wrappers as architectural components for the conversion of various electronic documents formats into the GS1 XML format. We demonstrate our approach through a case study involving a GS1 XML business document. We have implemented a prototype BDIS. We have evaluated and compared it with existing research and commercial tools for XML to relational schema conversion. The results show that it generates operational and simpler relational schemas for GS1 XML documents. In conclusion, the proposed framework enables SMEs to engage effectively in electronic business.
29
Smiljanić, Marko. "XML schema matching balancing efficiency and effectiveness by means of clustering /." Enschede : University of Twente [Host], 2006. http://doc.utwente.nl/55982.
Full text
30
Júnior, Carlos Augusto Siqueira da Cunha. "Common Information Model/eXtensible Markup Language (CIM/XML) na troca de informações entre centros de controle de energia elétrica." Universidade de São Paulo, 2005. http://www.teses.usp.br/teses/disponiveis/3/3143/tde-20082005-184734/.
Full textAbstract:
Esta dissertação analisa a utilização do modelo de dados padronizado pela norma IEC 61970 (CIM), tida como uma ferramenta para troca de informações cadastrais e operacionais entre empresas de energia elétrica, com sistemas computacionais de diferentes fabricantes. O propósito deste padrão é criar um mecanismo para troca de informações baseado em XML, denominado de CIM/XML um formato, especificamente, utilizado pelos Centros de Controle de Energia Elétrica para troca de dados. Os modelos de dados do padrão IEC 61970 são apresentados, bem como a avaliação do CIM/XML como uma ferramenta de interoperabilidade de dados entre empresas de energia que apresentam bases de dados de diferentes modelagem e implementação. Um dos méritos deste modelo, além de fazer uso de uma tecnologia aberta (XML) disponível em qualquer tipo de computador, e que possibilita armazenar e transferir não só dados cadastrais de equipamentos, mas também dados de topologia da rede, curvas de carga, programação de geração, saídas programadas de equipamentos, bem como medições de sistemas SCADA, indicações de estado e alarmes. Possibilita ainda armazenamento de resultados de simulação, tais como resultados do programa de fluxo de potência. Adicionalmente, é apresentado em detalhes informações sobre: a implementação do modelo lógico orientado a objetos do CIM, numa base de dados relacional; os registros de equipamentos e a topologia de um trecho de linha de sub-transmissão aéreo e subterrâneo; as informações (exportadas e importadas no formato CIM/XML) inseridas na base de dados, e a geração do documento CIM/XML.<br>This dissertation provides an analysis about the application of a data model based on IEC 61970 (CIM) standard a tool for exchanging operational and equipments information among different Electrical Power Utilities' computing systems. The purpose of this standard is to create a mechanism for information exchange using XML, called CIM/XML a format specifically used by Electrical Power Utilities' Control Centers for data exchange. The IEC 61970 standard-based data models is presented as well the evaluation of CIM/XML as a tool for data interoperability among Electrical Power Utilities' databases, that uses different modeling and implementation approaches. The benefit of this model besides of using a open standard technology (XML) that can be found on any type of computer is the capability of store and transfer information not only from equipments, but also from network topology, load flow curves, generation scheduling, equipments outages, SCADA system measurements, status indication and alarms. It also enables the storage of simulation results, such as the power flow bus voltage and lines loads. Additionally, is also provided highly detailed information about: the CIM object-oriented model implementation mapped to a relational database; the records of equipments and topology of an aerial and underground subtransmission line section; the information (exported and imported using CIM/XML format) included in the database, and the CIM/XML document generation.
31
Moore, Michael S., Jeremy C. Price, Andrew R. Cormier, Ryan J. Thibodeaux, Ben A. Abbott, and William A. Malatesta. "Describing Telemetry Systems with the Metadata Description Language." International Foundation for Telemetering, 2010. http://hdl.handle.net/10150/604283.
Full textAbstract:
ITC/USA 2010 Conference Proceedings / The Forty-Sixth Annual International Telemetering Conference and Technical Exhibition / October 25-28, 2010 / Town and Country Resort & Convention Center, San Diego, California<br>The integrated Network-Enhanced Telemetry (iNET) project has developed standards to enhance telemetry systems for the twenty-first century. A foundational component of these standards is the Metadata Description Language (MDL). MDL is an eXtensible Markup Language (XML)-based language for describing requirements, design choices, and configuration parameters of a Telemetry Network System (TmNS). Within a TmNS, MDL guides the exchange of information between applications and the configuration of network devices. Recent initial evaluations assessed MDL in terms of the expressive power of the language and the level of effort in developing applications that utilize MDL Instance Documents. Performing these initial evaluations required the generation of MDL Instance Documents to describe scenarios representative of both near-term and future telemetry systems that express different levels of iNET interoperability. These initial evaluations determined quantitative metrics such as file size, memory requirements, and required parsing time for MDL Instance Documents, and further evaluations judged the efficacy and complexity of MDL for describing and configuring a TmNS.
32
Moore, Michael S., Jeremy C. Price, Andrew R. Cormier, and William A. Malatesta. "Metadata Description Language: The iNET Metadata Standard Language." International Foundation for Telemetering, 2009. http://hdl.handle.net/10150/605963.
Full textAbstract:
ITC/USA 2009 Conference Proceedings / The Forty-Fifth Annual International Telemetering Conference and Technical Exhibition / October 26-29, 2009 / Riviera Hotel & Convention Center, Las Vegas, Nevada<br>In order to help manage the complexity in designing and configuring network-based telemetry systems, and to promote interoperability between equipment from multiple vendors, the integrated Network-Enhanced Telemetry (iNET) Metadata Standards Working Group (MDSWG) has developed a standard language for describing and configuring these systems. This paper will provide the community with an overview of Metadata Description Language (MDL), and describe how MDL can support the description of the requirements, design choices, and the configuration of devices that make up the Telemetry Network System (TmNS). MDL, an eXtensible Markup Language (XML) based language that describes a TmNS from various aspects, is embodied by an XML schema along with additional rules and constraints. Example MDL instance documents will be presented to illustrate how MDL can be used to capture requirements, describe the design, and configure the equipment that makes up a TmNS. Various scenarios for how MDL can be used will be discussed.
33
Wang, Chao. "Grail to XMI and Back." Thesis, Växjö University, School of Mathematics and Systems Engineering, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:vxu:diva-2298.
Full textAbstract:
<p>Grail is an open source graph library, which is developed at the MSI of Växjö University, tools like the VizzAnalyzer and vizz3d use Grail for representing their internal structures.</p><p>In this thesis, an adapter serializing and deserializing Grail graphs to and from XMI is introduced. XMI is short for XML Metadata Interchange; it is developed by the Object Management Group (OMG).</p>
34
Barcenas, Everardo. "Raisonnement automatisé sur les arbres avec des contraintes de cardinalité." Phd thesis, Université de Grenoble, 2011. http://tel.archives-ouvertes.fr/tel-00578972.
Full textAbstract:
Les contraintes arithmétiques sont largement utilisées dans les langages formels comme les expressions, les grammaires d'arbres et les chemins réguliers. Ces contraintes sont utilisées dans les modèles de contenu des types (XML Schemas) pour imposer des bornes sur le nombre d'occurrences de noeuds. Dans les langages de requêtes (XPath, XQuery), ces contraintes permettent de sélectionner les noeuds ayant un nombre limité de noeuds accessibles par une expression de chemin donnée. Les types et chemins étendus avec les contraintes de comptage constituent le prolongement naturel de leurs homologues sans comptage déjà considérés comme des constructions fondamentales dans les langages de programmation et les systèmes de type pour XML. Un des défis majeurs en programmation XML consiste à développer des techniques automatisées permettant d'assurer statiquement un typage correct et des optimisations de programmes manipulant les données XML. À cette fin, il est nécessaire de résoudre certaines tâches de raisonnement qui impliquent des constructions telles que les types et les expressions XPath avec des contraintes de comptage. Dans un futur proche, les compilateurs de programmes XML devront résoudre des problèmes de base tels que le sous-typage afin de s'assurer au moment de la compilation qu'un programme ne pourra jamais générer de documents non valides à l'exécution. Cette thèse étudie les logiques capables d'exprimer des contraintes de comptage sur les structures d'arbres. Il a été montré récemment que le μ-calcul sur les graphes, lorsqu'il est étendu à des contraintes de comptage portant exclusivement sur les noeuds successeurs immédiats est indécidable. Dans cette thèse, nous montrons que, sur les arbres finis, la logique avec contraintes de comptage est décidable en temps exponentiel. En outre, cette logique fournit des opérateurs de comptage selon des chemins plus généraux. En effet, la logique peut exprimer des contraintes numériques sur le nombre de noeuds descendants ou même ascendants. Nous présentons également des traductions linéaires d'expressions XPath et de types XML comportant des contraintes de comptage dans la logique.
35
Kupferschmidt, Benjamin, and Eric Pesciotta. "METADATA MODELING FOR AIRBORNE DATA ACQUISITION SYSTEMS." International Foundation for Telemetering, 2007. http://hdl.handle.net/10150/604548.
Full textAbstract:
ITC/USA 2007 Conference Proceedings / The Forty-Third Annual International Telemetering Conference and Technical Exhibition / October 22-25, 2007 / Riviera Hotel & Convention Center, Las Vegas, Nevada<br>Many engineers express frustration with the multitude of vendor specific tools required to describe measurements and configure data acquisition systems. In general, tools are incompatible between vendors, forcing the engineer to enter the same or similar data multiple times. With the emergence of XML technologies, user centric data modeling for the flight test community is now possible. With this new class of technology, a vendor neutral, standard language to define measurements and configure systems may finally be realized. However, the allure of such a universal language can easily become too abstract, making it untenable for hardware configuration and resulting in a low vendor adoption rate. Conversely, a language that caters too much to vendor specific configuration will defeat its purpose. Achieving this careful balance is not trivial, but is possible. Doing so will produce a useful standard without putting it out of the reach of equipment vendors. This paper discusses the concept, merits, and possible solutions for a standard measurement metadata model. Practical solutions using XML and related technologies are discussed.
36
Amavi, Joshua. "Comparaison et évolution de schémas XML." Thesis, Orléans, 2014. http://www.theses.fr/2014ORLE2053/document.
Full textAbstract:
XML est devenu le format standard d’échange de données. Nous souhaitons construire un environnement multi-système où des systèmes locaux travaillent en harmonie avec un système global, qui est une évolution conservatrice des systèmes locaux. Dans cet environnement, l’échange de données se fait dans les deux sens. Pour y parvenir nous avons besoin d’un mapping entre les schémas des systèmes. Le but du mapping est d’assurer l’évolution des schémas et de guider l’adaptation des documents entre les schémas concernés. Nous proposons des outils pour faciliter l’évolution de base de données XML. Ces outils permettent de : (i) calculer un mapping entre le schéma global et les schémas locaux, et d’adapter les documents ; (ii) calculer les contraintes d’intégrité du système global à partir de celles des systèmes locaux ; (iii) comparer les schémas de deux systèmes pour pouvoir remplacer un système par celui qui le contient ; (iv) corriger un nouveau document qui est invalide par rapport au schéma d’un système, afin de l’ajouter au système. Des expériences ont été menées sur des données synthétiques et réelles pour montrer l’efficacité de nos méthodes<br>XML has become the de facto format for data exchange. We aim at establishing a multi-system environment where some local original systems work in harmony with a global integrated system, which is a conservative evolution of local ones. Data exchange is possible in both directions, allowing activities on both levels. For this purpose, we need schema mapping whose is to ensure schema evolution, and to guide the construction of a document translator, allowing automatic data adaptation wrt type evolution. We propose a set of tools to help dealing with XML database evolution. These tools are used : (i) to compute a mapping capable of obtaining a global schema which is a conservative extension of original local schemas, and to adapt XML documents ; (ii) to compute the set of integrity constraints for the global system on the basis of the local ones ; (iii) to compare XML types of two systems in order to replace a system by another one ; (iv) to correct a new document with respect to an XML schema. Experimental results are discussed, showing the efficiency of our methods in many situations
37
Stampoultzis, Michael. "The use of XML schema and XSLT rules for product information personalization." Thesis, City University London, 2004. http://openaccess.city.ac.uk/8453/.
Full textAbstract:
This thesis describes research carried out in order to help solve the problem of personalization in e-commerce/CRM system. Web-based personalization consists of activities, such as providing customised information, that tailor the user's Web experience- browsing a Web site or purchasing a product, for example-to that user's particular needs. The main research objective of the project is to investigate how XSLT technologies can be used for the development of matching engines that find XML represented products that match the tastes, needs or requirements of customers as captured in customer profiles, also represented in XML. More specifically our research investigates into novel algorithms for transforming XML based product specifications using rules that derive from mining customer profiles with the purpose of customizing the product information.
38
Scardello, Mike, Jim Harris, and Bob Downing. "AN XML SCHEMA FOR AIRBORNE TELEMETRY BASED ON THE IRIG TMATS STANDARD." International Foundation for Telemetering, 2003. http://hdl.handle.net/10150/605578.
Full textAbstract:
International Telemetering Conference Proceedings / October 20-23, 2003 / Riviera Hotel and Convention Center, Las Vegas, Nevada<br>XML is a simple and powerful way to handle on data transfers between organizations, applications
and/or computer systems. Currently, there is a significant effort within NASA to transition to XML
vocabularies as the means of exchanging electronic data. XML can provide a useful way to transfer
telemetry attributes data between customers and systems. The current standard for airborne telemetry
data description is the Telemetry Attributes Transfer Standard (TMATS). TMATS is a well-defined,
structured specification that will map into XML extremely well. This makes XML an excellent choice
to supplement TMATS for the interchange of telemetry attribute information. The Western
Aeronautical Test Range (WATR) at NASA Dryden Flight Research Center (DFRC) is defining an
XML Schema that will be used in support of the WATR Integrated Next Generation System (WINGS).
This paper describes this work in progress.
39
Mauricio, Cláudio Roberto Marquetto. "Uma proposta de mapeamento do modelo XML Schema para o modelo relacional." Florianópolis, SC, 2005. http://repositorio.ufsc.br/handle/123456789/102237.
Full textAbstract:
Dissertação (mestrado) - Universidade Federal de Santa Catarina, Centro Tecnológico. Programa de Pós-Graduação em Ciência da Computação.<br>Made available in DSpace on 2013-07-16T00:24:33Z (GMT). No. of bitstreams: 1
222835.pdf: 616703 bytes, checksum: e20e319370f9158e7b18098b28cd832a (MD5)<br>O uso da XML como padrão para intercâmbio de dados gera a necessidade de um esquema comum a ser seguido pelos sistemas envolvidos. Os mecanismos mais usados para a definição de esquemas XML são a DTD e a XML Schema. Com estas tecnologias, é possível definir a estrutura a ser seguida pelos documentos XML a serem intercambiados, estabelecendo um protocolo de troca de informações independente do mecanismo de armazenamento de dados usado pelos sistemas.
Neste contexto, é necessário que os sistemas comunicantes sejam capazes de transformar seu modelo de dados em XML para o modelo de dados utilizado pelo sistema e vice-versa. O modelo de dados relacional é utilizado por muitos destes sistemas, considerando a grande disponibilidade de Sistemas Gerenciadores de Bancos de Dados (SGBDs) que adotam este modelo. Para isso, estes sistemas devem desenvolver mecanismos para exportar os dados de suas tabelas no formato XML e também para decompor documentos XML e armazená-los no SGBD. Estes mecanismos devem ser genéricos, dinâmicos e eficientes para garantir uma atividade adequada de intercâmbio de dados.
Assim sendo, este trabalho propõe um mecanismo baseado em regras para transformar um esquema de dados XML, definido com o uso de XML Schema, para um esquema de dados relacional, que pode ser usado por SGBDs relacionais existentes no mercado. Como contribuição específica, este trabalho realiza uma análise detalhada dos conceitos do modelo XML Schema, considerando estes conceitos nas regras para transformação do XML Schema em um esquema de dados relacional.
40
Janga, Prudhvi. "Integration of Heterogeneous Web-based Information into a Uniform Web-based Presentation." University of Cincinnati / OhioLINK, 2014. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1397467105.
Full text
41
Menkevičius, Saulius. "Objektų savybių modelio grafinis redaktorius." Master's thesis, Lithuanian Academic Libraries Network (LABT), 2006. http://vddb.library.lt/obj/LT-eLABa-0001:E.02~2006~D_20060113_215001-30663.
Full textAbstract:
During the development of federated IS that make use of non-homogenous databases and data sources, XML documents are often used for data exchange among the local subsystems, while their corresponding XML Schemas are generated using the standard CASE tools for local systems. External data schemes of those systems must be specified in a unified common model. An assumption is given that OBJECT PROPERTY (OP) model is being used for the semantic integration of the local non-homogenous subsystems. A graphical editor was developed that can be used to specify relation objects, their identifiers, complex and multi-valued object attributes. As OP model’s semantic expression capabilities can map those available in XML, additionally rules have been defined and implemented that can transform specific OP model structures into XML Schemas. Also algorithm is specified that can be used to extract tree-like structures from the model.Example transformations are performed that illustrate the process of generation of XML Schemas documents from sample OP models.
42
Hernych, Radim. "Transformace a perzistence XML v relační databázi." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2009. http://www.nusl.cz/ntk/nusl-236730.
Full textAbstract:
This master's thesis deals with problems of effective storage and querying of XML documents in A relational database. In the first part of this thesis XML and related technologies are described, with emphasis on languages for XML Schema definition and it's querying. Then an XML mapping method based on Hybrid method and XML Schema is described here. Hereafter the design and implementation of a native XML database front-end for object-relational database is described. Designed front-end allows storing and querying of XML documents into the underlying database. The last part contains results and evaluation of performance tests of the implemented system.
43
Willden, Greg C., Ray D. Seegmiller, Maria S. Araujo, Ben A. Abbott, and William A. Malatests. "Vendor Interoperability Through MDL." International Foundation for Telemetering, 2011. http://hdl.handle.net/10150/595668.
Full textAbstract:
ITC/USA 2011 Conference Proceedings / The Forty-Seventh Annual International Telemetering Conference and Technical Exhibition / October 24-27, 2011 / Bally's Las Vegas, Las Vegas, Nevada<br>Describing data formats has gone a long way in providing a common thread for moving test programs from one test range to another without incurring massive code rewrites. The introduction of the IRIG 106-93 standard provided the Telemetry Attributes Transfer Standard (TMATS) to achieve interoperability between the test article and ground processing system. The integrated Network Enhanced Telemetry (iNET) Metadata Description Language (MDL) extends the concept to include descriptions of the equipment configuration and setup. This MDL declarative language is both vendor neutral and vendor customizable (where needed) and extends interoperability down to the individual components of the instrumentation system. This paper describes the current state of MDL and its use across intended vendor lines.
44
Mergen, Sérgio Luis Sardi. "Casamento de esquemas XML e esquemas relacionais." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2005. http://hdl.handle.net/10183/10421.
Full textAbstract:
O casamento entre esquemas XML e esquemas relacionais é necessário em diversas aplicações, tais como integração de informação e intercâmbio de dados. Tipicamente o casamento de esquemas é um processo manual, talvez suportado por uma interface grá ca. No entanto, o casamento manual de esquemas muito grandes é um processo dispendioso e sujeito a erros. Disto surge a necessidade de técnicas (semi)-automáticas de casamento de esquemas que auxiliem o usuário fornecendo sugestões de casamento, dessa forma reduzindo o esforço manual aplicado nesta tarefa. Apesar deste tema já ter sido estudado na literatura, o casamento entre esquemas XML e esquemas relacionais é ainda um tema em aberto. Isto porque os trabalhos existentes ou se aplicam para esquemas de nidos no mesmo modelo, ou são genéricos demais para o problema em questão. O objetivo desta dissertação é o desenvolvimento de técnicas especí cas para o casamento de esquemas XML e esquemas relacionais. Tais técnicas exploram as particularidades existentes entre estes esquemas para inferir valores de similaridade entre eles. As técnicas propostas são avaliadas através de experimentos com esquemas do mundo real.<br>The matching between XML schemas and relational schemas has many applications, such as information integration and data exchange. Typically, schema matching is done manually by domain experts, sometimes using a graphical tool. However, the matching of large schemas is a time consuming and error-prone task. The use of (semi-)automatic schema matching techniques can help the user in nding the correct matches, thereby reducing his labor. The schema matching problem has already been addressed in the literature. Nevertheless, the matching of XML schemas and relational schemas is still an open issue. This comes from the fact that the existing work is whether speci c for schemas designed in the same model, or too generic for the problem in discussion. The mais goal of this dissertation is to develop speci c techniques for the matching of XML schemas and relational schemas. Such techniques exploit the particularities found when analyzing the two schemas together, and use these cues to leverage the matching process. The techniques are evaluated by running experiments with real-world schemas.
45
Saleem, Khalid. "Schema Matching and Integration in Large Scale Scenarios." Montpellier 2, 2008. http://www.theses.fr/2008MON20126.
Full textAbstract:
Le besoin d'intégrer et d'analyser des grands ensembles de données issus des bases de données publiées sur le web est présent dans de nombreux domaines d'applications comme la génomique, l'environnement, la médecine et le commerce électronique. Ces données sont, après intégration, utilisées pour prendre des décisions, des échanges de services, etc. Les outils existants pour la découverte de correspondances (appelés matchers) permettent de traiter les schémas deux par deux et nécessitent l'intervention d'un expert afin de garantir une bonne qualité des correspondances. Dans un scénario de large échelle, ces approches ne sont plus pertinentes et sont voire même infaisables à cause du nombre important de schémas et de leur taille (de l'ordre d'un millier d'éléments). Il est donc nécessaire d'automatiser la découverte de correspondances. Cependant, une méthode automatique doit préserver la qualité des correspondances et garantir des performances acceptables si l'on veut qu'elle soit utilisable. Nous avons développé des méthodes qui passent à l'échelle et qui réaliseront une découverte automatique. Nous avons proposé une méthode PORSCHE (Performance ORiented SCHEma Mediation) qui permet d'intégrer plusieurs schémas simultanément et de fournir un schéma médiateur. Cette méthode utilise un algorithme basé sur la fouille d'arbres (tree mining) et a été implémentée et expérimentée sur un grand nombre de schémas disponibles sur le web. Le Web sémantique est fortement dépendant du paradigme XML, qui suit une structure hiérarchique. Par ailleurs, l'utilisation d'ontologie se développe fortement. Nous nous intéressons à la construction d'ontologie à partir de schemas XML disponible sur le web. Nous proposons une approche automatique pour modéliser la sémantique émergente des ontologies. C'est une méthode collaborative pour la construction d'ontologie sans l'interaction directe avec les utilisateurs du domaine, des experts ou des développeurs. Une des caractéristiques très importante d'une ontologie est sa structure hiérarchique des concepts. Nous considérons des grands ensembles de schémas pour un domaine spécifique comme étant des arbres et leur appliquons des algorithmes d'extraction de sous-arbres fréquents pour découvrir des motifs (patterns) hiérarchiques en vue de construire une ontologie. Nous présentons un technique pour découvrir et proposer des correspondances complexes entre deux schemas. Ces correspondances sont ensuite validées à l'aide des mini-taxonomies qui sont les sous-arbres fréquents. La technique démontre une fois de plus la construction de la taxonomie ontologie de domaine. À cet égard, nous considérons le plus grand arbre ou un arbre créé par la fusion de l'ensemble des plus grands souvent sous-arbres comme étant une taxonomie. Nous plaidons en faveur de la confiance d'une telle taxonomie et des concepts associés car elle a été extraite à partir des schémas utilisés dans le domaine spécifié considéré<br>Semantic matching of schemas in heterogeneous data sharing systems is time consuming and error prone. The dissertation presents a new robust automatic method which integrates a large set of domain specific schemas, represented as tree structures, based upon semantic correspondences among them. The method also creates the mappings from source schemas to the integrated schema. Existing mapping tools employ semi-automatic techniques for mapping two schemas at a time. In a large-scale scenario, where data sharing involves a large number of data sources, such techniques are not suitable. Semi-automatic matching requires user intervention to finalize a certain mapping. Although it provides the flexibilty to compute the best possible mapping but time performance wise abates the whole matching process. At first, the dissertation gives a detail discussion about the state of the art in schema matching. We summarize the deficiencies in the currently available tools and techniques for meeting the requirements of large scale schema matching scenarios. Our approach, PORSCHE (Performance ORiented SCHEma Mediation) is juxtaposed to these shortcomings and its advantages are highlighted with sound experimental support. PORSCHE associated algorithms, first cluster the tree nodes based on linguistic label similarity. Then, it applies a tree mining technique using node ranks calculated during depth-first traversal. This minimises the target node search space and improves time performance, which makes the technique suitable for large scale data sharing. PORSCHE implements a hybrid approach, which also in parallel, incrementally creates an integrated schema encompassing all schema trees, and defines mappings from the contributing schemas to the integrated schema. The approach discovers 1:1 mappings for integration and mediation purposes. Formal experiments on real and synthetic data sets show that PORSCHE is scalable in time performance for large scale scenarios. The quality of mappings and integrity of the integrated schema is also verified by the experimental evaluation. Moreover, we present a technique for discovering complex match (1:n, n:1 and n:m) propositions between two schemas, validated by mini-taxonomies. These mini-taxonomies are extracted from the large set of domain specific metadata instances represented as tree structures. We propose a framework, called ExSTax (Extracting Structurally Coherent Mini-Taxonomies) based on frequent sub-tree mining, to support our idea. We further extend the ExSTax framework for extracting a reliable domain specific taxonomy
46
Boháč, Martin. "Perzistence XML v relační databázi." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2010. http://www.nusl.cz/ntk/nusl-237200.
Full textAbstract:
The aim of this thesis is to create a client xDB database, which supports visualization and management of XML documents and schemas. The first part deals with the introduction of XML, XML schemas (DTD, XML Schema, RelaxNG, etc.) and contextual technologies. After that the thesis deals with the problem of the XML persistence and it focuses on mapping techniques necessary for an efficient storage in a relational database. The main part is devoted to the design and implementation of client application XML Admin, which is programmed in Java. The application uses the XML:DB interface to communicate with the xDB database. It supports storing XML documents to a collection and the XPath language for querying them. The final section is devoted to application performance testing and comparison with existing native database eXist.
47
Lee, Yau-tat Thomas, and 李猷達. "Formalisms on semi-structured and unstructured data schema computations." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2009. http://hub.hku.hk/bib/B43703914.
Full text
48
Lee, Yau-tat Thomas. "Formalisms on semi-structured and unstructured data schema computations." Click to view the E-thesis via HKUTO, 2009. http://sunzi.lib.hku.hk/hkuto/record/B43703914.
Full text
49
Rull, Fort Guillem. "Validation of mappings between data schemas." Doctoral thesis, Universitat Politècnica de Catalunya, 2011. http://hdl.handle.net/10803/22679.
Full textAbstract:
En esta tesis, presentamos un nuevo enfoque para validar mappings entre esquemas de datos que permite al diseñador comprobar si el mapping satisface o no ciertas propiedades deseables. La respuesta que obtiene el diseñador no se limita a un simple valor booleano, sino que dependiendo del resultado de la comprobación obtendrá un ejemplo/contraejemplo que ilustre ese resultado, o bien se le indicará el conjunto de restricciones de integridad de los esquemas y formulas del mapping responsables de ese resultado.
Una de las características principales de nuestro enfoque es que es capaz de tratar una clase muy expresiva de mappings y esquemas relacionales. En particular, nuestro enfoque es capaz de tratar con formulas de mapping consistentes en inclusiones y igualdades de consultas, además de permitir el uso de negaciones y comparaciones aritméticas tanto en las propias formulas del mapping como en las vistas definidas en los esquemas. Nuestro enfoque también permite tratar restricciones de integridad, las cuales pueden estar definidas no solo sobre las tablas sino también sobre las vistas de los esquemas.
Dado que razonar sobre este tipo de mappings y esquemas es, desafortunadamente, indecidible, proponemos realizar un test de terminación previo a la validación del mapping. Si el test de terminación da una respuesta positiva, entonces podremos estar seguros de que la posterior comprobación de la propiedad deseable correspondiente terminará.
Finalmente, también extendemos nuestro enfoque más allá del caso relacional y lo aplicamos al contexto de mappings entre esquemas XML.<br>In this thesis, we present a new approach to the validation of mappings between data schemas. It allows the designer to check whether the mapping satisfies certain desirable properties. The feedback that our approach provides to the designer is not only a Boolean answer, but either a (counter)example for the (un)satisfiability of the tested property, or the set of mapping assertions and schema constraints that are responsible for that (un)satisfiability.
One of the main characteristics of our approach is that it is able to deal with a very expressive class of relational mapping scenarios; in particular, it is able to deal with mapping assertions in the form of query inclusions and query equalities, and it allows the use of negation and arithmetic comparisons in both the mapping assertions and the views of the schemas; it also allows for integrity constraints, which can be defined not only over the base relations but also in terms of the views.
Since reasoning on the class of mapping scenarios that we consider is, unfortunately, undecidable, we propose to perform a termination test as a pre-validation step. If the answer of the test is positive, then checking the corresponding desirable property will terminate.
We also go beyond the relational setting and study the application of our approach to the context of mappings between XML schemas.
50
Vojíř, Stanislav. "Mapování PMML a BKEF dokumentů v projektu SEWEBAR-CMS." Master's thesis, Vysoká škola ekonomická v Praze, 2010. http://www.nusl.cz/ntk/nusl-75744.
Full textAbstract:
In the data mining process, it is necessary to prepare the source dataset - for example, to select the cutting or grouping of continuous data attributes etc. and use the knowledge from the problem area. Such a preparation process can be guided by background (domain) knowledge obtained from experts. In the SEWEBAR project, we collect the knowledge from experts in a rich XML-based representation language, called BKEF, using a dedicated editor, and save into the database of our custom-tailored (Joomla!-based) CMS system. Data mining tools are then able to generate, from this dataset, mining models represented in the standardized PMML format. It is then necessary to map a particular column (attribute) from the dataset (in PMML) to a relevant 'metaattribute' of the BKEF representation. This specific type of schema mapping problem is addressed in my thesis in terms of algorithms for automatic suggestion of mapping of columns to metaattributes and from values of these columns to BKEF 'metafields'. Manual corrections of this mapping by the user are also supported. The implementation is based on the PHP language and then it was tested on datasets with information about courses taught in 5 universities in the U.S.A. from Illinois Semantic Integration Archive. On this datasets, the auto-mapping suggestion process archieved the precision about 70% and recall about 77% on unknown columns, but when mapping the previously user-mapped data (using implemented learning module), the recall is between 90% and 100%.