To see the other types of publications on this topic, follow the link: Constraints in XML.

Dissertations / Theses on the topic 'Constraints in XML'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 22 dissertations / theses for your research on the topic 'Constraints in XML.'

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

Kwong, April P. "Tree pattern constraints for XML : theory and applications /." For electronic version search Digital dissertations database. Restricted to UC campuses. Access is free to UC campus dissertations, 2004. http://uclibs.org/PID/11984.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Madiraju, Praveen. "Global Semantic Integrity Constraint Checking for a System of Databases." Digital Archive @ GSU, 2005. http://digitalarchive.gsu.edu/cs_diss/1.

Full text
Abstract:
In today’s emerging information systems, it is natural to have data distributed across multiple sites. We define a System of Databases (SyDb) as a collection of autonomous and heterogeneous databases. R-SyDb (System of Relational Databases) is a restricted form of SyDb, referring to a collection of relational databases, which are independent. Similarly, X-SyDb (System of XML Databases) refers to a collection of XML databases. Global integrity constraints ensure integrity and consistency of data spanning multiple databases. In this dissertation, we present (i) Constraint Checker, a general fra
APA, Harvard, Vancouver, ISO, and other styles
3

Whittington, Austin J., Alexander G. Youngs, John R. Harwell, and Myron L. Moodie. "FOCUSED AUTOMATED DISCOVERY OF TELEMETRY DEVICE CONSTRAINTS." International Foundation for Telemetering, 2016. http://hdl.handle.net/10150/624240.

Full text
Abstract:
Configuring typical devices in the telemetry community requires the creation of complex, device-specific configuration files. While the grammar of the configuration files is vendor neutral, the device specific details are vendor specific. Thus, a naïve approach to building these files is to construct a file, test it against a device, and then iterate. The specification sheets (and other documents) for the device can serve as a guide, but the details of flight test configuration possibilities are immense and, in this community, typically not fully documented. This paper describes a proces
APA, Harvard, Vancouver, ISO, and other styles
4

Noonan, Patrick J., Hakima Ibaroudene, Austin J. Whittington, and Myron L. Moodie. "SIMPLIFYING FLIGHT TEST CONFIGURATION WITH CONSTRAINTS." International Foundation for Telemetering, 2016. http://hdl.handle.net/10150/624259.

Full text
Abstract:
Configuring flight test systems can be a complex process due to the large number of choices that must be made. Making these choices requires system knowledge to build a working configuration in an efficient and timely manner. Historically, flight test systems have embedded this system knowledge in code. The limitation with these approaches is that any change or addition to the system knowledge is costly due to the significant work required to update and maintain the software. We see the philosophy of constraints as a promising path toward addressing these issues. In the context of flight
APA, Harvard, Vancouver, ISO, and other styles
5

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
APA, Harvard, Vancouver, ISO, and other styles
6

Noonan, Patrick J., Austin J. Whittington, Hakima Ibaroudene, and Myron L. Moodie. "RAPIDLY RECONFIGURABLE SYSTEM MANAGEMENT." International Foundation for Telemetering, 2017. http://hdl.handle.net/10150/627018.

Full text
Abstract:
The growth of network and distributed technologies in flight test instrumentation (FTI) has provided the benefits of flexibility, scalability, and compatibility with prevalent computing capabilities. However, to achieve these capabilities, the complexity of each piece of FTI and the overall system has increased dramatically. Even with systems composed of equipment from a single vendor, it is important to have management systems that provide the flexibility to adapt quickly to various system configurations and present unified information to the flight test users. The growth of network techno
APA, Harvard, Vancouver, ISO, and other styles
7

Revels, Kenneth W. "Constraints of Migrating Transplant Information System's Legacy Data to an XML Format For Medical Applications Use." NSUWorks, 2001. http://nsuworks.nova.edu/gscis_etd/799.

Full text
Abstract:
This dissertation presents the development of two methodologies to migrate legacy data elements to an open environment. Changes in the global economy and the increasingly competitive business climate are driving companies to manage legacy data in new ways. Legacy data is used for strategic decisions as well as short-term decisions. Data migration involves replacing problematic hardware and software. The legacy data elements are being placed into different file formats then migrated to open system environments. The purpose of this study, was to develop migration methodologies to move legacy dat
APA, Harvard, Vancouver, ISO, and other styles
8

Barcenas, Patino Ismael. "Raisonnement automatisé sur les arbres avec des contraintes de cardinalité." Phd thesis, Université de Grenoble, 2011. http://tel.archives-ouvertes.fr/tel-00569058.

Full text
Abstract:
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 nœuds. Dans les langages de requêtes (XPath, XQuery), ces contraintes permettent de sélectionner les nœuds ayant un nombre limité de nœuds 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 sa
APA, Harvard, Vancouver, ISO, and other styles
9

Hamilton, John, Timothy Darr, Ronald Fernandes, Dave Jones, and Jon Morgan. "Rule-Based Constraints for Metadata Validation and Verification in a Multi-Vendor Environment." International Foundation for Telemetering, 2015. http://hdl.handle.net/10150/596430.

Full text
Abstract:
ITC/USA 2015 Conference Proceedings / The Fifty-First Annual International Telemetering Conference and Technical Exhibition / October 26-29, 2015 / Bally's Hotel & Convention Center, Las Vegas, NV<br>This paper describes a method in which users realize the benefits of a standards-based method for capturing and evaluating verification and validation (V&V) rules within and across metadata instance documents. The method uses a natural language based syntax for the T&E metadata V&V rule set in order to abstract the highly technical rule languages to a domain-specific syntax. As a result, the domai
APA, Harvard, Vancouver, ISO, and other styles
10

Ruffner, Christoph. "Implicit specification of a distributed system configuration." [S.l. : s.n.], 2002. http://www.bsz-bw.de/cgi-bin/xvms.cgi?SWB10252224.

Full text
APA, Harvard, Vancouver, ISO, and other styles
11

Mok, Kei-hon, and 莫麒瀚. "Algorithmic music composition using XML: a constraint-based approach." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2008. http://hub.hku.hk/bib/B40988090.

Full text
APA, Harvard, Vancouver, ISO, and other styles
12

Mok, Kei-hon. "Algorithmic music composition using XML a constraint-based approach /." Click to view the E-thesis via HKUTO, 2008. http://sunzi.lib.hku.hk/hkuto/record/B40988090.

Full text
APA, Harvard, Vancouver, ISO, and other styles
13

Nabdel, Leili. "An Xml-based Feature Modeling Language." Master's thesis, METU, 2011. http://etd.lib.metu.edu.tr/upload/12613827/index.pdf.

Full text
Abstract:
Feature modeling is a common way of representing commonality and variability in Software Product Lines. There are alternative notations reported in the literature to represent feature models. Compared to the graphical notations, the text-based notations are more amenable to automated processing and tool interoperability. This study presents an XML-based feature modeling language to represent extended feature models that can include complex relationships involving attributes. We first provide a Context Free Grammar for the extended feature model definitions including such complex relationships.
APA, Harvard, Vancouver, ISO, and other styles
14

Jovana, Vidaković. "Спецификација и валидација ограничења у XML моделу података". Phd thesis, Univerzitet u Novom Sadu, Fakultet tehničkih nauka u Novom Sadu, 2015. https://www.cris.uns.ac.rs/record.jsf?recordId=94370&source=NDLTD&language=en.

Full text
Abstract:
Циљ истраживања реализованих у овом раду, био је да се формално опишу типови ограничења у XML моделу података, по угледу на типове ограничења у релационом моделу података. У складу са постављеним циљем, урађена је класификација типова ограничења у XML моделу података, њихова формална спецификација и имплементација у репрезентативним XML СУБП.<br>Cilj istraživanja realizovanih u ovom radu, bio je da se formalno opišu tipovi ograničenja u XML modelu podataka, po ugledu na tipove ograničenja u relacionom modelu podataka. U skladu sa postavljenim ciljem, urađena je klasifikacija tipova ograničenja
APA, Harvard, Vancouver, ISO, and other styles
15

Felício, Crícia Zilda. "VISTREE: uma linguagem visual para análise de padrões arborescentes e para especificação de restrições em um ambiente de mineração de árvores." Universidade Federal de Uberlândia, 2008. https://repositorio.ufu.br/handle/123456789/12459.

Full text
Abstract:
The frequent pattern mining in data represented by more complex structures like trees and graphs are growing lately. Among the reasons for this improvement is the fact that the tree and graph patterns has more information than sequential patterns, besides there is the possibility of usage of this type of mining in several areas like XML Mining,Web Mining and Bioinformatic. A problem that occurs in mining patterns in general is the great amount of patterns generated. Being some of them not interesting for users. The decrease in the quantity of patterns generated can be done restricting the patt
APA, Harvard, Vancouver, ISO, and other styles
16

Fajt, Stanislav. "Mining XML Integrity Constraints." Master's thesis, 2011. http://www.nusl.cz/ntk/nusl-297892.

Full text
Abstract:
The most important integrity constraints in XML are primary keys and foreign keys. In general, keys are essential in understanding both the structure and properties of data. They provide an instrument by which va- lues from a given set of attributes uniquely identify tuples in a database. As a result, keys are important to main database operations. Since XML beco- mes lingua franca for data exchange on the web, it is widely accepted as a model of real world data. Because XML documents in general can appear in any semi-structured form, structural constraints (including keys) are often imposed o
APA, Harvard, Vancouver, ISO, and other styles
17

Vitásek, Matej. "Inference of XML Integrity Constraints." Master's thesis, 2012. http://www.nusl.cz/ntk/nusl-313582.

Full text
Abstract:
In this work we expand upon the previous efforts to infer schema information from existing XML documents. We find the inference of structure to be sufficiently researched and focus further on integrity constraints. After briefly introducing some of them we turn our attention to ID/IDREF/IDREFS attributes in DTD. Building on the research by Barbosa and Menelzon (2003) we introduce a heuristic approach to the problem of finding an optimal ID set. The approach is evaluated and tuned in a wide range of experiments.
APA, Harvard, Vancouver, ISO, and other styles
18

Švirec, Michal. "Efficient Detection of XML Integrity Constraints." Master's thesis, 2011. http://www.nusl.cz/ntk/nusl-313748.

Full text
Abstract:
Title: Efficient Detection of XML Integrity Constraints Author: Michal Švirec Department: Department of Software Engineering Supervisor: RNDr. Irena Mlýnková, Ph.D. Abstract: Knowledge of integrity constraints covered in XML data is an impor- tant aspect of efficient data processing. However, although integrity constraints are defined for the given data, it is a common phenomenon that data violate the predefined set of constraints. Therefore detection of these inconsistencies and consecutive repair has emerged. This work extends and refines recent approaches to repairing XML documents violatin
APA, Harvard, Vancouver, ISO, and other styles
19

Malý, Jakub. "Adaptace XML dokumentů a integritní omezení v XML." Doctoral thesis, 2013. http://www.nusl.cz/ntk/nusl-327393.

Full text
Abstract:
This work examines XML data management and consistency -- more precisely the problem of document adaptation and the usage of integrity constraints. Changes in user requirements cause changes in schemas used in the systems and changes in the schemas subsequently make existing documents invalid. In this thesis, we introduce a formal framework for detecting changes between two versions of a schema and generating a transformation from the source to the target schema. Large-scale information systems depend on integrity constraints to be preserved and valid. In this work, we show how OCL can be used
APA, Harvard, Vancouver, ISO, and other styles
20

Wu, Zheng-Yi, and 吳政儀. "Supporting XML Query Processing with Complex Keyword Constraints." Thesis, 2009. http://ndltd.ncl.edu.tw/handle/38403120562510509285.

Full text
Abstract:
碩士<br>國立臺灣海洋大學<br>資訊工程學系<br>97<br>In this thesis, we discuss how to combine the technology of Information Retrieval with the XQuery query processing algorithm, so that we could retrieve the data satisfying the structural constraints and the keyword constraints imposed by users. We propose two methods. One is TJ_IR and the other is SCU_Twig. The first one will convert a user to a query tree. According to the structure of the query tree, the system retrieves the corresponding elements and processes the keyword constraints. Then, the system uses the technique of TJFast to merge and feedback t
APA, Harvard, Vancouver, ISO, and other styles
21

Lo, Cheng-Cheng, and 羅誠正. "The Research on Optimizing XML Queries with Structural and Keyword Constraints." Thesis, 2011. http://ndltd.ncl.edu.tw/handle/46374158715787032698.

Full text
Abstract:
碩士<br>國立臺灣海洋大學<br>資訊工程學系<br>99<br>Efficient query processing on XML data has become a very important research issue. In this paper, we consider the XML query with structural and keyword constraints and apply the query optimizing mechanism to improve the efficiency of query processing. Two approaches are proposed in the thesis [吳09], that is, the structure-first approach and the keyword-first approach. The structure-first approach will first identify the elements that satisfy the tag constraint from the query tree, and then process the full-text constraint. The satisfied elements will be combi
APA, Harvard, Vancouver, ISO, and other styles
22

Lu, Jing [Verfasser]. "Constraints and triggers to enhance XML-based data integration systems / vorgelegt von Jing Lu." 2009. http://d-nb.info/994435983/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!