Log in

Relevant bibliographies by topics / Constraints in XML / Journal articles

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

Journal articles 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 top 50 journal articles 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 journal articles on a wide variety of disciplines and organise your bibliography correctly.

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

11

Buneman, Peter, Wenfei Fan, Jérôme Siméon, and Scott Weinstein. "Constraints for semistructured data and XML." ACM SIGMOD Record 30, no. 1 (2001): 47–54. http://dx.doi.org/10.1145/373626.373697.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Currim, Faiz A., Sabah A. Currim, Curtis E. Dyreson, Richard T. Snodgrass, Stephen W. Thomas, and Rui Zhang. "Adding Temporal Constraints to XML Schema." IEEE Transactions on Knowledge and Data Engineering 24, no. 8 (2012): 1361–77. http://dx.doi.org/10.1109/tkde.2011.74.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Pardede, Eric, J. Wendy Rahayu, and David Taniar. "Preserving conceptual constraints during XML updates." International Journal of Web Information Systems 1, no. 2 (2005): 65–82. http://dx.doi.org/10.1108/17440080580000084.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Ferrarotti, Flavio, Sven Hartmann, and Sebastian Link. "Efficiency frontiers of XML cardinality constraints." Data & Knowledge Engineering 87 (September 2013): 297–319. http://dx.doi.org/10.1016/j.datak.2012.09.004.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Tan, Zijing, Liyong Zhang, Wei Wang, and Baile Shi. "XML data exchange with target constraints." Information Processing & Management 49, no. 2 (2013): 465–83. http://dx.doi.org/10.1016/j.ipm.2012.09.002.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Fujita, Katsuhide, Takayuki Ito, and Mark Klein. "Common Testbed Generating Tool Based on XML for Multiple Interdependent Issues Negotiation Problems." Journal of Advanced Computational Intelligence and Intelligent Informatics 15, no. 1 (2011): 34–40. http://dx.doi.org/10.20965/jaciii.2011.p0034.

Full text

Abstract:

Multiple interdependent issues negotiations have been widely studied since most real-world negotiation involves multiple interdependent issues. Our work focuses on negotiation with multiple interdependent issues in which agent utility functions are nonlinear. In the field of multiple issue negotiations, there are no established common testbeds for evaluating protocols. In this paper, we propose a common testbed creating tool based on XML that mainly covers the utility functions based on cube-constraints and cone-constraints. First, we propose a testbed generating tool that inputs configuration data and outputs XML formatted files that represent agent utility spaces. The current tool can produce four types of utility spaces: Random, A Single Hill, Two-Hills, and SeveralHills. These types are observed in real negotiation settings. Also we define the agent’s utility space information based on XML formats. By defining the testbed data as XMLs, users can easily read the files and change the data structure.

APA, Harvard, Vancouver, ISO, and other styles

17

ZHANG, Jian-Mei, Shi-Qun TAO, Ji-Ye LIANG, and Feng CAO. "Reasoning about Structural Integrity Constraints for XML." Chinese Journal of Computers 33, no. 12 (2011): 2281–90. http://dx.doi.org/10.3724/sp.j.1016.2010.02281.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Deutsch, Alin, and Val Tannen. "XML queries and constraints, containment and reformulation." Theoretical Computer Science 336, no. 1 (2005): 57–87. http://dx.doi.org/10.1016/j.tcs.2004.10.032.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Cohen, Sara. "Generating XML structure using examples and constraints." Proceedings of the VLDB Endowment 1, no. 1 (2008): 490–501. http://dx.doi.org/10.14778/1453856.1453910.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Combi, Carlo, Andrea Masini, Barbara Oliboni, and Margherita Zorzi. "A hybrid logic for XML reference constraints." Data & Knowledge Engineering 115 (May 2018): 94–115. http://dx.doi.org/10.1016/j.datak.2018.02.005.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Yin, Li Feng, Hua Jin, and Hong Tian. "Tree Inferior Strong MVD for XML Document." Advanced Materials Research 268-270 (July 2011): 2002–8. http://dx.doi.org/10.4028/www.scientific.net/amr.268-270.2002.

Full text

Abstract:

Data constraints are the basis of the database normalization, the introduction of XML documents with incomplete information, data constraints need to be re-defined. The precise definition of the tree inferior strong multi-valued dependency for XML documents(XTISMVD) was proposed, which was based on the tree structure and subtree information equivalent. Judging condition of XTISMVD was studied. By instance this paper shows that the existence of XTISMVD produces redundancies and update anomalies, moving or adding nodes for XML Schema can reduce redundancies.

APA, Harvard, Vancouver, ISO, and other styles

22

Yanlong Wen, Ying Zhang, Zhongqi Liu, Haiwei Zhang, Lei Xu, and Xiaojie Yuan. "Searching and Ranking XML Documents via Path Constraints." International Journal of Digital Content Technology and its Applications 6, no. 1 (2012): 462–70. http://dx.doi.org/10.4156/jdcta.vol6.issue1.56.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Gao, Yuan, Husheng Liao, and Hongyu Gao. "Twig Pattern Minimization Based on XML Schema Constraints." INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY 15, no. 3 (2016): 6608–12. http://dx.doi.org/10.24297/ijct.v15i3.1683.

Full text

Abstract:

Twig pattern is one of the core components of XQuery. Twig usually includes redundancy nodes which can be optimized. Schema feature is used to judge whether the node of Twig pattern is redundancy. In this paper, we propose sufficient Schema constraints and specific rules. In this paper, we have designed more determination conditions to optimize, then we will get the most efficient results. By a large number of test case, we finally get the practical limits of minimization.

APA, Harvard, Vancouver, ISO, and other styles

24

Anutariya, Chutiporn, Vilas Wuwongse, and Kiyoshi Akama. "XML DECLARATIVE DESCRIPTION WITH FIRST-ORDER LOGICAL CONSTRAINTS." Computational Intelligence 21, no. 2 (2005): 130–56. http://dx.doi.org/10.1111/j.0824-7935.2005.00268.x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Hartmann, Thomas, Benjamin Zapilko, Joachim Wackerow, and Kai Eckert. "Directing the Development of Constraint Languages by Checking Constraints on RDF Data." International Journal of Semantic Computing 10, no. 02 (2016): 193–217. http://dx.doi.org/10.1142/s1793351x16400079.

Full text

Abstract:

For research institutes, data libraries, and data archives, validating RDF data according to predefined constraints is a much sought-after feature, particularly as this is taken for granted in the XML world. Based on our work in two international working groups on RDF validation and jointly identified requirements to formulate constraints and validate RDF data, we have published 81 types of constraints that are required by various stakeholders for data applications. In this paper, we evaluate the usability of identified constraint types for assessing RDF data quality by (1) collecting and classifying 115 constraints on vocabularies commonly used in the social, behavioral, and economic sciences, either from the vocabularies themselves or from domain experts, and (2) validating 15,694 data sets (4.26 billion triples) of research data against these constraints. We classify each constraint according to (1) the severity of occurring violations and (2) based on which types of constraint languages are able to express its constraint type. Based on the large-scale evaluation, we formulate several findings to direct the further development of constraint languages.

APA, Harvard, Vancouver, ISO, and other styles

26

Policarpio, Sean, and Yan Zhang. "A Formal Language for XML Authorisations Based on Answer Set Programming and Temporal Interval Logic Constraints." International Journal of Secure Software Engineering 2, no. 1 (2011): 22–39. http://dx.doi.org/10.4018/jsse.2011010102.

Full text

Abstract:

The Extensible Markup Language is susceptible to security breaches because it does not incorporate methods to protect the information it encodes. This work focuses on the development of a formal language that can provide role-based access control to information stored in XML formatted documents. This language has the capacity to reason whether access to an XML document should be allowed. The language, Axml(T), allows for the specification of authorisations on XML documents and distinguishes itself from other research with the inclusion of temporal interval reasoning and the XPath query language.

APA, Harvard, Vancouver, ISO, and other styles

27

Marcinkowski, Jerzy, and Piotr Wieczorek. "Modulo Constraints and the Complexity of Typechecking XML Views." Theory of Computing Systems 44, no. 4 (2008): 620–52. http://dx.doi.org/10.1007/s00224-008-9132-z.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Gelade, Wouter, Wim Martens, and Frank Neven. "Optimizing Schema Languages for XML: Numerical Constraints and Interleaving." SIAM Journal on Computing 38, no. 5 (2009): 2021–43. http://dx.doi.org/10.1137/070697367.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Fan, Wenfei, and Leonid Libkin. "On XML integrity constraints in the presence of DTDs." Journal of the ACM 49, no. 3 (2002): 368–406. http://dx.doi.org/10.1145/567112.567117.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Chang, Ya‐Hui, Chieh‐Chang Luo, and Chih‐Chung Huang. "Efficient evaluation of XML twig queries with keyword constraints." Journal of the Chinese Institute of Engineers 32, no. 4 (2009): 469–80. http://dx.doi.org/10.1080/02533839.2009.9671529.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Govedarica, Miro, Ivan Lukovic, and Pavle Mogin. "Generating XML based specifications of information systems." Computer Science and Information Systems 1, no. 1 (2004): 117–40. http://dx.doi.org/10.2298/csis0401117g.

Full text

Abstract:

This paper outlines a methodology for designing information systems based on XML. The methodology uses XML DTDs to define the design standards, and the structure and constraints of the design specifications. The result of the design process is a set of valid XML documents that are the specifications of transaction programs and applications of the information system. At the start of a design process, the methodology uses a CASE tool to map user requirements into initial XML specifications. Final design specifications are produced by a sequence of XSL transformations of the initial XML specifications. A key feature of the methodology is that it produces a platform independent design of an information system. To enable an early feedback from users, the methodology uses further XSL transformations that produce an executable prototype of the information system in the Java programming environment.

APA, Harvard, Vancouver, ISO, and other styles

32

FONG, JOSEPH, HERBERT SHIU, and JENNY WONG. "METHODOLOGY FOR DATA CONVERSION FROM XML DOCUMENTS TO RELATIONS USING EXTENSIBLE STYLESHEET LANGUAGE TRANSFORMATION." International Journal of Software Engineering and Knowledge Engineering 19, no. 02 (2009): 249–81. http://dx.doi.org/10.1142/s0218194009004131.

Full text

Abstract:

Extensible Markup Language (XML) has been used for data-transport and data-transformation while the business sector continues to store critical business data in relational databases. Extracting relational data and formatting it into XML documents, and then converting XML documents back to relational structures, becomes a major daily activity. It is important to have an efficient methodology to handle this conversion between XML documents and relational data. This paper aims to perform data conversion from XML documents into relational databases. It proposes a prototype and algorithms for this conversion process. The pre-process is schema translation using an XML schema definition. The proposed approach is based on the needs of an Order Information System to suggest a methodology to gain the benefits provided by XML technology and relational database management systems. The methodology is a stepwise procedure using XML schema definition and Extensible Stylesheet Language Transformations (XSLT) to ensure that the data constraints are not scarified after data conversion. The implementation of the data conversion is performed by decomposing the XML document of a hierarchical tree model into normalized relations interrelated with their artifact primary keys and foreign keys. The transformation process is performed by XSLT. This paper will also demonstrate the entire conversion process through a detailed case study.

APA, Harvard, Vancouver, ISO, and other styles

33

ZHANG, Jian-Mei, Shi-Qun TAO, and Ji-Ye LIANG. "Minimization of Path Expression Under Structural Integrity Constraints for XML." Journal of Software 20, no. 11 (2009): 2977–87. http://dx.doi.org/10.3724/sp.j.1001.2009.03422.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Klein, Shmuel T. "Processing queries with metrical constraints in XML-based IR systems." Journal of the American Society for Information Science and Technology 59, no. 1 (2007): 86–97. http://dx.doi.org/10.1002/asi.20734.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

FONG, JOSEPH, HERBERT SHIU, and YIN FEI YEUNG. "CONCURRENT DATA MATERIALIZATION FOR XML-ENABLED DATABASE WITH SEMANTIC METADATA." International Journal of Software Engineering and Knowledge Engineering 20, no. 03 (2010): 377–422. http://dx.doi.org/10.1142/s0218194010004748.

Full text

Abstract:

For a company with many databases in different data models, it is necessary to consolidate them into one interchangeable data model and present data in more than one data model concurrently to different users or individual users who need to access the data in more than one data model. The benefit is to let the user stick to his/her own data model to access database in another data model. This paper presents a semantic metadata to preserve database constraints for data materialization to support the user's view of database on an ad hoc basis. The semantic metadata can store the captured semantics of a relational or an XML-enabled database into classes. The stored constraints and data can be materialized into a target database upon user request. The user is allowed to perform data materialization many times alternatively. The process can provide a relational as well as an XML view to the users simultaneously. This concurrent data materialization function can be applied into data warehouse to consolidate heterogeneous database into a fact table in a data model of user's choice. Furthermore, a user can obtain either a relational view or an XML view of the same dataset of an XML-enabled database interchangeably.

APA, Harvard, Vancouver, ISO, and other styles

36

Papadakis, Nikos, Sokratis Kartakis, Kostas Papadakis, and Eva Papadaki. "A Tool for Spatial Reasoning in XML Documents." International Journal of Semantic Computing 09, no. 01 (2015): 67–103. http://dx.doi.org/10.1142/s1793351x15500038.

Full text

Abstract:

In this paper, we study the ramification problem in the setting of spatial xml data. Standard solutions from the literature on reasoning about action are inadequate because they cannot capture integrity constraints in spatial data. In this paper, we provide a solution to the ramification problem based on situation calculus. We present a tool that connects the theoretical results with the practical considerations, by producing the User Interface in C# in order to address the ramification problem in spatial XML file in specific time period. a

APA, Harvard, Vancouver, ISO, and other styles

37

Liu, Yunfeng, Dongqing Yang, Shiwei Tang, Tengjiao Wang, and Jun Gao. "Validating key constraints over XML document using XPath and structure checking." Future Generation Computer Systems 21, no. 4 (2005): 583–95. http://dx.doi.org/10.1016/j.future.2004.12.001.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Wahid, Norfaradilla, and Eric Pardede. "XSDyM: An XML graphical conceptual model for static and dynamic constraints." Computer Standards & Interfaces 37 (January 2015): 60–72. http://dx.doi.org/10.1016/j.csi.2014.06.001.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Chen, Yangjun, and Dunren Che. "Efficient Processing of XML Tree Pattern Queries." Journal of Advanced Computational Intelligence and Intelligent Informatics 10, no. 5 (2006): 738–43. http://dx.doi.org/10.20965/jaciii.2006.p0738.

Full text

Abstract:

In this paper, we present a polynomial-time algorithm for TPQ (tree pattern queries) minimization without XML constraints involved. The main idea of the algorithm is a dynamic programming strategy to find all the matching subtrees within a TPQ. A matching subtree implies a redundancy and should be removed in such a way that the semantics of the original TPQ is not damaged. Our algorithm consists of two parts: one for subtree recognization and the other for subtree deletion. Both of them needs only O(<I>n</I>2) time, where <I>n</I> is the number of nodes in a TPQ.

APA, Harvard, Vancouver, ISO, and other styles

40

Wichaiwong, Tanakorn. "An Exponentiation Method for XML Element Retrieval." Scientific World Journal 2014 (2014): 1–10. http://dx.doi.org/10.1155/2014/404518.

Full text

Abstract:

XML document is now widely used for modelling and storing structured documents. The structure is very rich and carries important information about contents and their relationships, for example, e-Commerce. XML data-centric collections require query terms allowing users to specify constraints on the document structure; mapping structure queries and assigning the weight are significant for the set of possibly relevant documents with respect to structural conditions. In this paper, we present an extension to the MEXIR search system that supports the combination of structural and content queries in the form of content-and-structure queries, which we call the Exponentiation function. It has been shown the structural information improve the effectiveness of the search system up to 52.60% over the baseline BM25 at MAP.

APA, Harvard, Vancouver, ISO, and other styles

41

Janzek-Hawlat, S., S. Sibinovic, G. Duftschmid, and C. Rinner. "Semantic Validation of Standard-based Electronic Health Record Documents with W3C XML Schema." Methods of Information in Medicine 49, no. 03 (2010): 271–80. http://dx.doi.org/10.3414/me09-02-0027.

Full text

Abstract:

Summary Objectives: The goal of this article is to examine whether W3C XML Schema provides a practicable solution for the semantic validation of standard-based electronic health record (EHR) documents. With semantic validation we mean that the EHR documents are checked for conformance with the underlying archetypes and reference model. Methods: We describe an approach that allows XML Schemas to be derived from archetypes based on a specific naming convention. The archetype constraints are augmented with additional components of the reference model within the XML Schema representation. A copy of the EHR document that is transformed according to the before-mentioned naming convention is used for the actual validation against the XML Schema. Results: We tested our approach by semantically validating EHR documents conformant to three different ISO/EN 13606 archetypes respective to three sections of the CDA implementation guide “Continuity of Care Document (CCD)” and an implementation guide for diabetes therapy data. We further developed a tool to automate the different steps of our semantic validation approach. Conclusions: For two particular kinds of archetype prescriptions, individual transformations are required for the corresponding EHR documents. Otherwise, a fully generic validation is possible. In general, we consider W3C XML Schema as a practicable solution for the semantic validation of standard-based EHR documents.

APA, Harvard, Vancouver, ISO, and other styles

42

Chen, Yangjun, and Dunren Che. "Minimization of XML Tree Pattern Queries in the Presence of Integrity Constraints." Journal of Advanced Computational Intelligence and Intelligent Informatics 10, no. 5 (2006): 744–51. http://dx.doi.org/10.20965/jaciii.2006.p0744.

Full text

Abstract:

In this paper, we provide a polynomial-time tree pattern query minimization algorithm whose efficiency stems from two key observations: (i) Inherent redundant “components” usually exist inside the rudimentary query provided by the user. (ii) Irredundant nodes may become redundant when constraints such as co-occurrence and required child/descendant are given. We show the result that the algorithm obtained by first augmenting the input tree pattern using the constraints, and then applying minimization, always finds the unique minimal equivalent to the original query. We complement our analytical results with an experimental study that shows the effectiveness of our tree pattern minimization techniques.

APA, Harvard, Vancouver, ISO, and other styles

43

Lee, Dongwon, and Wesley W. Chu. "CPI: Constraints-Preserving Inlining algorithm for mapping XML DTD to relational schema." Data & Knowledge Engineering 39, no. 1 (2001): 3–25. http://dx.doi.org/10.1016/s0169-023x(01)00028-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Yang, Chengsen, and Jinguang Sun. "The exchange from relational schemas to XML schemas based on semantic constraints." Wuhan University Journal of Natural Sciences 13, no. 4 (2008): 485–89. http://dx.doi.org/10.1007/s11859-008-0421-9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Pekunov, Vladimir Viktorovich. "Elements of XPath-like languages in problems of constructing semantic XML models of natural language texts." Кибернетика и программирование, no. 1 (January 2020): 29–41. http://dx.doi.org/10.25136/2644-5522.2020.1.32143.

Full text

Abstract:

The subject of the research is the possibility of using XPath-like micro-languages of programming in the generation systems of programs of the PGEN ++ class for the selection and completion of XML-models describing the plan for solving the original problem, according to which the solver program is generated. It is supposed to build such models according to the description of the problem in natural language, thus, we are talking about elements of artificial intelligence technologies. XPath-like language works in the layer of regular-logical expressions (highlighting elements of the primary XML document), performing primary processing of the data obtained in the layer of grammatical parsing of the source text. In addition, XPath-like elements are used to render the final XML models. The standard natural language parsing libraries are used. Non-standard XPath query language extensions are used. For the first time, the idea of expanding the XPath query language to the level of an algorithmic language by introducing the minimum required number of syntactic elements is proposed. It is also proposed to use syntactic elements with an XPath-like structure as both generating and controlling weak constraints of the process of direct inference of final semantic XML models.

APA, Harvard, Vancouver, ISO, and other styles

46

Chen, Liang, Shao Ping Zhang, Bin Huang, and Wei Wang. "Consistency Maintenance of Collaborative Product Design Based on the Semantics Reasoning." Advanced Materials Research 311-313 (August 2011): 987–91. http://dx.doi.org/10.4028/www.scientific.net/amr.311-313.987.

Full text

Abstract:

Consistency maintenance is a key problem in collaborative product design. Firstly, based on product design theory, the semantics relationships described by XML among components in collaborative product design system are made. Secondly, the associated components are determined through backward and forward semantics reasoning. Finally, the data is updated by constraints solving, and the consistency maintenance is achieved.

APA, Harvard, Vancouver, ISO, and other styles

47

Romanowski ,, Carol J., and Rakesh Nagi. "A Data Mining Approach to Forming Generic Bills of Materials in Support of Variant Design Activities." Journal of Computing and Information Science in Engineering 4, no. 4 (2004): 316–28. http://dx.doi.org/10.1115/1.1812556.

Full text

Abstract:

In variant design, the proliferation of bills of materials makes it difficult for designers to find previous designs that would aid in completing a new design task. This research presents a novel, data mining approach to forming generic bills of materials (GBOMs), entities that represent the different variants in a product family and facilitate the search for similar designs and configuration of new variants. The technical difficulties include: (i) developing families or categories for products, assemblies, and component parts; (ii) generalizing purchased parts and quantifying their similarity; (iii) performing tree union; and (iv) establishing design constraints. These challenges are met through data mining methods such as text and tree mining, a new tree union procedure, and embodying the GBOM and design constraints in constrained XML. The paper concludes with a case study, using data from a manufacturer of nurse call devices, and identifies a new research direction for data mining motivated by the domains of engineering design and information.

APA, Harvard, Vancouver, ISO, and other styles

48

Anicic, Nenad, and Nenad Ivezic. "Semantic web technologies for enterprise application integration." Computer Science and Information Systems 2, no. 1 (2005): 119–44. http://dx.doi.org/10.2298/csis0501119a.

Full text

Abstract:

Large industrial interoperability projects use syntax-based Enterprise Application Integration standards, such as XML Schema, to accomplish interoperable data exchange among enterprise applications. In this paper, we describe an approach to assess the potential impact of Semantic Web technologies on these standards and on testability of integration results when using these standards. The experimental approach includes an automated translation of an XML Schema-based representation of business document content models into an OWL-based ontology. Based on this ontology, we use the Semantic Web representation and reasoning mechanisms to validate ontological constructs and constraints in support of data exchange. We demonstrate novel model-based integration capabilities that go beyond the existing syntax-based approaches. These new capabilities are relevant when managing multiple enterprise ontologies derived from a common ontology.

APA, Harvard, Vancouver, ISO, and other styles

49

Malý, Jakub, and Martin Nečaský. "Model-driven approach to modeling and validating integrity constraints for XML with OCL and Schematron." Information Systems Frontiers 17, no. 4 (2013): 917–46. http://dx.doi.org/10.1007/s10796-013-9471-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Davidson, Susan, Wenfei Fan, and Carmem Hara. "Erratum to “Propagating XML constraints to relations” [J. Comput. System Sci. 73 (2007) 316–361]." Journal of Computer and System Sciences 74, no. 3 (2008): 404–5. http://dx.doi.org/10.1016/j.jcss.2007.09.002.

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!