MétaCan
Menu
Back to cohort
Record W2122306245 · doi:10.1109/wise.2001.996477

Mapping DTDs to object-oriented schemas

2005· article· en· W2122306245 on OpenAlex
Yangjun Chen, Ron McFadyen, Fung-Yee Chan

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Database Systems and Queries
Canadian institutionsUniversity of Winnipeg
Fundersnot available
KeywordsComputer scienceDocument Structure DescriptionDocument type definitionXMLInformation retrievalRelational databaseXML validationSGMLXML Schema (W3C)Programming languageDatabaseWorld Wide Web

Abstract

fetched live from OpenAlex

As a subset of SGML, XML (Extensible Markup Language) is becoming a dominant standard for representing data in the World Wide Web and therefore the efficient treatment of XML data is important for information transfer over a network. One way towards this goal is to integrate database technology into document management and bring the very nature of database systems into this area, such as query processing, efficient management of secondary storage, version and update control, etc. We propose a new method to map DTDs (Document Type Definition) into object-oriented schemas. In this way, any complicated DTD structure can be treated uniformly. That is, using the concepts of classification/generalization and aggregation of the object-oriented model, any complex nested and recursive structure in a DTD as well as multiple appearance of element types can be represented. These issues can not be addressed if we map a DTD into a relational schema.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Not applicable · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.980
Threshold uncertainty score0.783

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.001

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.015
GPT teacher head0.255
Teacher spread0.240 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Quick stats

Citations2
Published2005
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Database Systems and QueriesFrench-language works237,207