DTD (Document Type Definition)
Anna van Raaphorst · 2006
Cited by 7
Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.
About 2,453 papers for “Document Type Definition”
Anna van Raaphorst · 2006
Cited by 7
Liam Quin · Balisage series on markup technologies · 2024
The XML specification defines a syntax for, and semantics for, a document type definition (DTD). An XML document can optionally reference a DTD, which it does by means of a document type declaration. The DTD may contain constraints on the elements that can be found in the XML document, and what attributes they may contain. It may also define entities, which associate names with strings or with external resources such as XML fragments or images. The constraints can be checked using a process termed validation. The XML Data Model (XDM) does not expose declarations found in a document’s document type definition. As a result, XSLT stylesheets, XPath expressions, XQuery expressions, and anything else using the XDM, cannot reference them. Sometimes one might want (or need) to access declarations from a DTD. The author in the past has written programs in procedural languages such as C or Perl in order to access such declarations. This paper describes an XSLT stylesheet that parses DTD syntax and constructs a simple XML representation that can then be processed using XSLT or other XML-aware languages directly. Some use cases and examples are given. The work is publicly available on gitlab.
Cited by 1
Dongwon Lee, Wesley W. Chu · 2000
. As Extensible Markup Language (XML) [5] is emerging as the data format of the internet era, there are increasing needs to efficiently store and query XML data. One way towards this goal is using relational database by transforming XML data into relational format. In this paper, we argue that existing transformation algorithms are not complete in the sense that they focus only on structural aspects and ignoring semantic aspects. We present the semantic knowledge that needs to be captured during the transformation to ensure a correct relational schema. Further, we show a simple algorithm that can 1) derive such semantic knowledge from the given XML Document Type Definition (DTD) and 2) preserve the knowledge by representing them in terms of semantic constraints in relational database terms. By combining the existing transformation algorithms and our constraints-preserving algorithm, one can transform XML DTD to relational schema where correct semantics and behaviors are ...
Cited by 20
CALS TEST NETWORK WRIGHT-PATTERSON AFB OH · 1994
Cited by 0
Chang Yi · 2003
This paper presents an approach to adding true semantic to extensible markup language(XML) documents. Frame is the appropriate medium between the information and the XML document. The frame is mapped to the XML document to integrate conceptual modeling, inheritance and inference mechanism with popularity, simplicity and flexibility of XML. By deriving the Document Type Definition from a frame, XML is more semantic expressive and by this way, it becomes easy to share and exchange data.
Cited by 0
Andrea Romei · 2006
KDDML System Version: 2.0.16 beta Knowledge discovery in databases (KDD) covers a wide range of application domains (retail, marketing, finance, e-commerce, biology, privacy, only to cite a few ones), several models of rep-resenting extracted patterns and rules (including classification models, association rules, sequential patterns, clusters) and a large number of algorithms for data preprocessing, model extraction and model reasoning. KDDML is a middleware XML-based language (and system) needed to support the development of final applications or higher level systems which need a mixture of database access, data pre-processing, mining extraction and deployment. As the name suggests, KDDML is heavily based on XML as a representation language for data, models and queries. The language is primarily intended as a middleware language on the basis of which higher abstraction levels can be built, such as vertical applications or more declarative languages. Also, the language tries to be as much as possible independent from lower level imple-mentations of data mining algorithms, with the aim of confining the technicalities at the level of the implementation of the KDDML system. This document describes in detail KDDML as KDD language whose design principles are moti-vated by requirements derived from recurring patterns in the KDD process.
Cited by 0
CALS TEST NETWORK WRIGHT-PATTERSON AFB OH · 1994
Cited by 0
dblp Team · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 2016
This file contains the dblp XML document type definition (DTD) of dblp XML record data. The dblp computer science bibliography is the open indexing service and knowledge graph of the computer science community. dblp provides quality-checked and curated bibliographic metadata on major computer science journals, proceedings, and monographs, as well as metadata and identifiers about their authors and the venues they have been published in.
Cited by 0Open access
dblp Team · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 2019
This file contains the dblp XML document type definition (DTD) of dblp XML record data. The dblp computer science bibliography is the open indexing service and knowledge graph of the computer science community. dblp provides quality-checked and curated bibliographic metadata on major computer science journals, proceedings, and monographs, as well as metadata and identifiers about their authors and the venues they have been published in.
Cited by 0Open access
Böhm, Klemens, Aberer, Karl, Ãszu, Tamer M. et al. · Infoscience (Ecole Polytechnique Fédérale de Lausanne) · 1998
Cited by 0Open access
dblp Team · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 2023
This file contains the dblp XML document type definition (DTD) of dblp XML record data. The dblp computer science bibliography is the open indexing service and knowledge graph of the computer science community. dblp provides quality-checked and curated bibliographic metadata on major computer science journals, proceedings, and monographs, as well as metadata and identifiers about their authors and the venues they have been published in.
Cited by 0Open access
dblp Team · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 2017
This file contains the dblp XML document type definition (DTD) of dblp XML record data. The dblp computer science bibliography is the open indexing service and knowledge graph of the computer science community. dblp provides quality-checked and curated bibliographic metadata on major computer science journals, proceedings, and monographs, as well as metadata and identifiers about their authors and the venues they have been published in.
Cited by 0Open access
Janice E. Ruth · 2024
Although there has been recent speculation about applying the Encoded Archival Description (EAD) Document Type Definition (DTD) to a host of descriptive outputs, including catalog records and subject guides, its perceived need, design, and development emerged from the American archival community’s focus on that special subset of finding aids known as collection inventories and registers. This article briefly analyzes the traditional function and structure of these finding aids in a paper-based form and explores how longtime interest in disseminating these guides electronically led to the formation of the Berkeley Finding Aid Project in 1993, and five years later, to the version 1.0 release of EAD. The author provides a basic outline of EAD’s structure and demonstrates that although much of its design stems from American archival practice, its developers tried from the outset to create a data model that would merit international support and address the needs of a wide variety of archival institutions both in the United States and abroad.
Cited by 0
CALS TEST NETWORK WRIGHT-PATTERSON AFB OH · 1994
Cited by 0
David S. Curry · Medical Entomology and Zoology · 2004
Cited by 104
Toni Dietze, Toni Dietze, Simple Dtds et al. · 2009
From XML to unranked Trees <b o o k C o l l e c t i o n> <book> < t i t l e>The Lord o f the Rings< / t i t l e> < / book> <book> <r e l a t e d>
Cited by 0
CALS TEST NETWORK WRIGHT-PATTERSON AFB OH · 1994
Cited by 0
Rebecca Moore · Carolina Digital Repository (University of North Carolina at Chapel Hill) · 2019
This paper focuses on the development of an XML (eXtensible Markup Language) DTD (Document Type Definition) for South Asian Studies (SAS.dtd). The goal was to develop a DTD that could be used to markup content, rather than form. The assumption was made that this DTD would be used in conjunction with another DTD that focused on form, such as the TEI DTD (Text Encoding Initiative). The first part of the paper describes the process involved in writing the DTD. This portion relies heavily on the use of examples. The second part of the paper discusses implications of the DTD design; specifically problems of attempting to markup document content. This part of the paper deals with philosophical issues and questions of responsibility.
Cited by 0Open access
David G. Nohle, Leona W. Ayers · BMC Medical Informatics and Decision Making · 2005
ACSR implementation of the TMA DES demonstrated the utility of the specification and allowed application of a DTD to validate the language of the API specified XML elements and to identify possible enhancements within our TMA data management application. Improvements to the specification have additionally been suggested by our experience in importing other institution's exported TMA data. Enhancements to TMA DES to remove ambiguous situations and clarify the data should be considered. Better specified identifiers and hierarchical relationships will make automatic use of the data possible. Our tool can be used to reorder data and add identifiers; upgrading data for changes in the specification can be automatically accomplished. Using a DTD (optionally reflecting our proposed enhancements) can provide stronger validation of exported TMA data.
Cited by 12Open access
CALS TEST NETWORK WRIGHT-PATTERSON AFB OH · 1994
Cited by 0