Log in

Relevant bibliographies by topics / Constraints in XML

Contents

Journal articles
Dissertations / Theses
Book chapters
Conference papers
Reports

Academic literature on the topic 'Constraints in XML'

Author: Grafiati

Published: 4 June 2021

Last updated: 19 February 2022

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

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources 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.

Journal articles on the topic "Constraints in XML"

1

Vidakovic, Jovana, Sonja Ristic, Slavica Kordic, and Ivan Lukovic. "Extended tuple constraint type as a complex integrity constraint type in XML data model - definition and enforcement." Computer Science and Information Systems 15, no. 3 (2018): 821–43. http://dx.doi.org/10.2298/csis180324029v.

Full text

Abstract:

A database management system (DBMS) is based on a data model whose concepts are used to express a database schema. Each data model has a specific set of integrity constraint types. There are integrity constraint types, such as key constraint, unique constraint and foreign key constraint that are supported by most DBMSs. Other, more complex constraint types are difficult to express and enforce and are mostly completely disregarded by actual DBMSs. The users have to manage those using custom procedures or triggers. eXtended Markup Language (XML) has become the universal format for representing and exchanging data. Very often XML data are generated from relational databases and exported to a target application or another database. In this context, integrity constraints play the essential role in preserving the original semantics of data. Integrity constraints have been extensively studied in the relational data model. Mechanisms provided by XML schema languages rely on a simple form of constraints that is sufficient neither for expressing semantic constraints commonly found in databases nor for expressing more complex constraints induced by the business rules of the system under study. In this paper we present a classification of constraint types in relational data model, discuss possible declarative mechanisms for their specification and enforcement in the XML data model, and illustrate our approach to the definition and enforcement of complex constraint types in the XML data model on the example of extended tuple constraint type.

APA, Harvard, Vancouver, ISO, and other styles

2

Fan, Wenfei, and Jérôme Siméon. "Integrity constraints for XML." Journal of Computer and System Sciences 66, no. 1 (2003): 254–91. http://dx.doi.org/10.1016/s0022-0000(02)00032-6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Mok, Wai Yin, Jonathan R. Mok, and Xiaotong Li. "XML Template Functional and Multivalued Dependencies Validation." International Journal of Cooperative Information Systems 28, no. 01 (2019): 1950001. http://dx.doi.org/10.1142/s0218843019500011.

Full text

Abstract:

In this paper, we present two types of XML semantic constraints, namely the XML Template Functional Dependencies (XTFDs) and the XML Template Multivalued Dependencies (XTMVDs), which are both defined over the finite XML files that have no mixed contents. Essentially they specify that if a pattern of nodes appears in a finite XML file that has no mixed contents, then another pattern of nodes must also appear. To implement these semantic constraints, we demonstrate an algorithm that transforms an XTFD or an XTMVD to an XQuery program such that the program returns a non-empty set of counter examples from such an XML file If [Formula: see text] if and only if [Formula: see text] does not satisfy the constraint.

APA, Harvard, Vancouver, ISO, and other styles

4

Cohen, Sara, Benny Kimelfeld, and Yehoshua Sagiv. "Incorporating constraints in probabilistic XML." ACM Transactions on Database Systems 34, no. 3 (2009): 1–45. http://dx.doi.org/10.1145/1567274.1567280.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Davidson, Susan, Wenfei Fan, and Carmem Hara. "Propagating XML constraints to relations." Journal of Computer and System Sciences 73, no. 3 (2007): 316–61. http://dx.doi.org/10.1016/j.jcss.2006.10.022.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Cautis, Bogdan, Serge Abiteboul, and Tova Milo. "Reasoning about XML update constraints." Journal of Computer and System Sciences 75, no. 6 (2009): 336–58. http://dx.doi.org/10.1016/j.jcss.2009.02.001.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Hartmann, Sven, and Sebastian Link. "Numerical constraints on XML data." Information and Computation 208, no. 5 (2010): 521–44. http://dx.doi.org/10.1016/j.ic.2008.09.004.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

FONG, JOSEPH, ANTHONY FONG, H. K. WONG, and PHILIP YU. "TRANSLATING RELATIONAL SCHEMA WITH CONSTRAINTS INTO XML SCHEMA." International Journal of Software Engineering and Knowledge Engineering 16, no. 02 (2006): 201–43. http://dx.doi.org/10.1142/s0218194006002744.

Full text

Abstract:

With XML adopted as the technology trend on the Internet, and with investment in the current relational database systems, companies must convert their relational data into XML documents for data transmission on the Internet. In the process, to preserve the users' relational data requirements of data constraints into the converted XML documents, we must define a meaningful root element for each XML document. The construction of an XML document is based on the root element and its relevant elements. The root element can be selected from a relational entity table in the existing relational database, which depends on the requirements to present the business behind. The relevant elements are mapped from the related entities, based on the navigability of the chosen entity. The derived root and relevant elements can form a Data Type Definition Graph (DTD-graph) of an XML conceptual schema diagram which can be mapped into a Data Type Definition (DTD) of an XML schema. The result is a translated XML schema with semantic constraints transferred from a relational conceptual schema of an Extended Entity Relationship (EER) model. The data conversion from relational data to the XML documents can be done after the schema translation. The relational data are loaded into XML documents according to the translated DTD.

APA, Harvard, Vancouver, ISO, and other styles

9

Niewerth, Matthias, and Thomas Schwentick. "Reasoning About XML Constraints Based on XML-to-Relational Mappings." Theory of Computing Systems 62, no. 8 (2018): 1826–79. http://dx.doi.org/10.1007/s00224-018-9846-5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Cong, He, and Wei Quan Jiang. "An Approach to Advanced XML Constraints Expression and Validation." Advanced Materials Research 562-564 (August 2012): 2149–52. http://dx.doi.org/10.4028/www.scientific.net/amr.562-564.2149.

Full text

Abstract:

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

APA, Harvard, Vancouver, ISO, and other styles

More sources

Dissertations / Theses on the topic "Constraints in XML"

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 framework of a mobile agent based approach for checking global constraints on R-SyDb, and (ii) XConstraint Checker, a general framework for checking global XML constraints on X-SyDb. Furthermore, we formalize multiple efficient algorithms for varying semantic integrity constraints involving both arithmetic and aggregate predicates. The algorithms take as input an update statement, list of all global semantic integrity constraints with arithmetic predicates or aggregate predicates and outputs sub-constraints to be executed on remote sites. The algorithms are efficient since (i) constraint check is carried out at compile time, i.e. before executing update statement; hence we save time and resources by avoiding rollbacks, and (ii) the implementation exploits parallelism. We have also implemented a prototype of systems and algorithms for both R-SyDb and X-SyDb. We also present performance evaluations of the system.

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 process of creating a set of general rules describing characteristics of a configuration file and using those rules to discover the configuration constraints of telemetry devices automatically. The discovered constraints posed by a particular vendor’s device can then be quickly formed into a correct-by-construction constraint-based grammar for use in other systems.

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 test configuration, a set of constraints defines the limits of how a system may be configured to perform specific tasks. This paper describes an approach for simplifying configuration by moving the system knowledge out of hardcoded business rules and into a flexible architecture that leverages constraints for validation of system configurations.

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 technologies and then standardized approaches such as iNET standards becoming accepted IRIG 106 standards is leading to the growth of multi-vendor systems. These multi-vendor systems further increase the need for rapidly reconfigurable management systems. This paper describes a constraints engine we have developed to enable flexible system management systems and reflects on how these techniques have been used successfully in the iNET System Manager.

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 data to an XML format the techniques used for developing the intermediate delimited file and the XML schema involved the use of system development life cycles (SDLC) procedures. These procedures are part of the overall SDLC methodologies used to guide this project to a successful conclusion. SDLC procedures helped in planning, scheduling, and implementing of the project steps. This study presents development methodologies to create XML schemas which saves man-hours. XML technology is very flexible in that it can be published to many different platforms that are ODBC compliant and uses TCPIIP as its transport protocol. This study provides a methodology that steers the step-by-step migration of legacy information to an open environment. The incremental migration methodology was used to create and migrate the intermediate legacy data elements and the FAST methodology was used to develop the XML schema. As a result the legacy data can reside in a more efficient and useful data processing environment.

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 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 mu-calcul sur les graphes, lorsqu'il est étendu à des contraintes de comptage portant exclusivement sur les nœuds 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 nœuds 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.

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 domain expert can easily specify, validate and manage the specification and validation of the rules themselves. Our approach is very flexible in that under the hood, the method automatically translates rules to a host of target rule languages. We validated our method in a multi-vendor scenario involving Metadata Description Language (MDL) and Instrumentation Hardware Abstraction Language (IHAL) instance documents, user constraints, and domain constraints. The rules are captured in natural language, and used to perform V&V within a single metadata instance document and across multiple metadata instance documents.

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

More sources

Book chapters on the topic "Constraints in XML"

1

Arenas, Marcelo. "XML Integrity Constraints." In Encyclopedia of Database Systems. Springer New York, 2018. http://dx.doi.org/10.1007/978-1-4614-8265-9_787.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Arenas, Marcelo. "XML Integrity Constraints." In Encyclopedia of Database Systems. Springer US, 2009. http://dx.doi.org/10.1007/978-0-387-39940-9_787.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Arenas, Marcelo. "XML Integrity Constraints." In Encyclopedia of Database Systems. Springer New York, 2017. http://dx.doi.org/10.1007/978-1-4899-7993-3_787-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Hartmann, Sven, and Sebastian Link. "Numerical Constraints for XML." In Logic, Language, Information and Computation. Springer Berlin Heidelberg, 2007. http://dx.doi.org/10.1007/978-3-540-73445-1_15.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Cohen, Sara. "Count-Constraints for Generating XML." In Next Generation Information Technologies and Systems. Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11780991_14.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Vitásek, Matej, and Irena Mlýnková. "Inference of XML Integrity Constraints." In Advances in Intelligent Systems and Computing. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-32741-4_26.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Alagić, Suad, and David Briggs. "Semantics of Objectified XML Constraints." In Database Programming Languages. Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-24607-7_10.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Arenas, Marcelo, Wenfei Fan, and Leonid Libkin. "What’s Hard about XML Schema Constraints?" In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-46146-9_27.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Deutsch, Alin, and Val Tannen. "Reformulation of XML Queries and Constraints." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-36285-1_15.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Ferrarotti, Flavio, Sven Hartmann, Sebastian Link, Mauricio Marin, and Emir Muñoz. "Soft Cardinality Constraints on XML Data." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-41230-1_32.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Constraints in XML"

1

Chen, Haitao, and Husheng Liao. "Integrity constraints for XML." In 2010 IEEE International Conference on Software Engineering and Service Sciences (ICSESS). IEEE, 2010. http://dx.doi.org/10.1109/icsess.2010.5552445.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Fan, Wenfei, and Jérôme Siméon. "Integrity constraints for XML." In the nineteenth ACM SIGMOD-SIGACT-SIGART symposium. ACM Press, 2000. http://dx.doi.org/10.1145/335168.335172.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Cohen, Sara, Benny Kimelfeld, and Yehoshua Sagiv. "Incorporating constraints in probabilistic XML." In the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium. ACM Press, 2008. http://dx.doi.org/10.1145/1376916.1376933.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Benedikt, Michael, Alan Jeffrey, and Ruy Ley-Wild. "Stream firewalling of xml constraints." In the 2008 ACM SIGMOD international conference. ACM Press, 2008. http://dx.doi.org/10.1145/1376616.1376667.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Tan, Zijing. "Validating XML Constraints Using Automata." In 2009 Eighth IEEE/ACIS International Conference on Computer and Information Science. IEEE, 2009. http://dx.doi.org/10.1109/icis.2009.64.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Cautis, Bogdan, Serge Abiteboul, and Tova Milo. "Reasoning about XML update constraints." In the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium. ACM Press, 2007. http://dx.doi.org/10.1145/1265530.1265558.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Fajt, Stanislav, Irena Mlynkova, and Martin Necasky. "On mining XML integrity constraints." In 2011 Sixth International Conference on Digital Information Management (ICDIM). IEEE, 2011. http://dx.doi.org/10.1109/icdim.2011.6093314.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Necasky, Martin, and Katerina Opocenska. "Designing and Maintaining XML Integrity Constraints." In 2009 20th International Workshop on Database and Expert Systems Application. IEEE, 2009. http://dx.doi.org/10.1109/dexa.2009.49.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Lv, Teng, and Ping Yan. "Mapping Relational Schemas to XML DTDs with Constraints." In 2006 International Multi-Symposiums on Computer and Computational Sciences (IMSCCS). IEEE, 2006. http://dx.doi.org/10.1109/imsccs.2006.237.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Liu, Xiping, and Changxuan Wan. "Minimizing XML Queries Using a Family of Constraints." In Fourth International Conference on Fuzzy Systems and Knowledge Discovery (FSKD 2007). IEEE, 2007. http://dx.doi.org/10.1109/fskd.2007.397.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Constraints in XML"

1

Cokus, M., R. Costello, M. A. Malloy, E. Masek, and D. Winkowski. XML-Native Constraint Evaluation. Defense Technical Information Center, 2004. http://dx.doi.org/10.21236/ada460336.

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!