A Data Model for XML Databases

Wuwongse, Vilas; Akama, Kiyoshi; Anutariya, Chutiporn; Nantajeewarawat, Ekawit

doi:10.1007/3-540-45490-x_28

Cited by 7 publications

(7 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The model has been applied to knowledge processing in several data domains such as NLP [8], RDF [6], UML [12], and XML [13]. Experience shows several appealing features, including a simple basis for guaranteeing correct computation results, a variety of computation and flexible control, e.g.…”

Section: Equivalent Transformationmentioning

confidence: 99%

Using an automatic marking system for programming courses

Koike

Akama

Morita

et al. 2006

Proceedings of the 34th Annual ACM SIGUCCS Fall Conference: Expanding the Boundaries

Self Cite

View full text Add to dashboard Cite

All students (about 1000) at Sapporo Gakuin University are required to take a Computer Literacy course. At Hokkaido University, we teach courses, such as AI Programming, with approximately 100 students. By using automatic marking systems of our own design we can check student work and obtain the results immediately. It reduces our labor, enables us to grasp individual students' learning states, and allows us to tailor our instruction to each student's needs. Automatic marking is a key technology for determining the current individual learning state of each student in a large class. By using automatic marking we can conduct short tests many times, mark the tests automatically, and collect detailed information about the learning states of students from the test results. However, developing reliable and efficient marking systems is a difficult and time-consuming job using conventional methods. In this paper, we introduce our automatic marking systems, share our experiences developing and using the systems in our classes, and discuss the possibility of expanding its use to object-oriented programming language courses.

show abstract

Section: Equivalent Transformationmentioning

confidence: 99%

Using an automatic marking system for programming courses

Koike

Akama

Morita

et al. 2006

Proceedings of the 34th Annual ACM SIGUCCS Fall Conference: Expanding the Boundaries

Self Cite

View full text Add to dashboard Cite

show abstract

“…XML Declarative Description (XDD) [4,6,20,21]-a data model for XML databases, developed by employment of Declarative Description theory [2]-extends ordinary, well-formed XML elements by incorporation of variables for an enhancement of expressive power and representation of implicit information into so-called XML expressions. Ordinary XML elements-XML expressions without variable-are called ground XML expressions.…”

Section: Xdd: An Informal Reviewmentioning

confidence: 99%

“…In the proposed data model for XML databases [4,6,20], ordinary XML elements can be mapped directly onto ground XML expressions, while a collection of XML documents, consisting of sequences of XML elements, is represented as a set of ground expressions, each describing an element in the documents. Integrity and structural constraints imposed on elements in the documents as well as rules, axioms and conditional relationships among them are formalized as a corresponding set of XML clauses.…”

Section: Xml Database Modelingmentioning

confidence: 99%

“…Based on the functionality requirements for an XML query language, identified by [10,17], a declarative description approach is presented for both formulation and evaluation of queries on XML databases by employment of XML Declamtive Description (XDD) theory [4,6,20,21]. In the developed approach, an XML database is formalized as an XDD description which comprises a set of XML elements, representing a collection of XML elements/documents in the database, and a set of XML clauses, describing relationships, axioms as well as some other derivable information.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Query Formulation and Evaluation for XML Databases

Akama¹,

Anutariya

Wuwongse

et al. 2002

IFIP Advances in Information and Communication Technology

Self Cite

View full text Add to dashboard Cite

The proposed approach to XML query formulation and evaluation developed by means of XML Declamtive Description (XDD) theory formalizes a query as an XDD description comprising one or more XML clauses the syntax of which can be subdivided into the three specifications: pattern of XML elements to be selected, the query's selection criteria and the structure of the resulting elements. It supports formulation of essential functionality requirements for an XML query language such as selection and extraction, combination, transformation, closure and nested queries. Evaluation of a query on a specified XML database is carried out by employment of Equivalent 'I'ransformation paradigm. Moreover, since XDD theory provides a simple mechanism for representation of knowledge and relationships among elements in a The original version of this chapter was revised: The copyright line was incorrect. This has been corrected. The Erratum to this chapter is available at

show abstract

“…Based on the theory of the Extensible Markup Language (XML) declarative descriptions, 5,6 this study proposes a solid practical framework for knowledge representation and reasoning in the domain of UML. In this framework, UML diagrams will be represented as textual structured data in XML, 7 and the general knowledge about the UML domain as an XML declarative description.…”

Section: Introductionmentioning

confidence: 99%

Toward reasoning with unified modeling language diagrams based on extensible markup language declarative description theory

Nantajeewarawat¹,

Wuwongse²,

Anutariya³

et al. 2004

Int. J. Intell. Syst.

Self Cite

View full text Add to dashboard Cite

A practical framework for representing knowledge and reasoning in the domain of Unified Modeling Language (UML) is proposed. In this framework, graphical diagrams in a UML model are encoded as Extensible Markup Language (XML)/Metadata Interchange (XMI) elements, which are regarded as facts about a specific problem instance in a knowledge base, and the general knowledge on UML, such as inherent interrelationships among diagram components and implicit properties of diagrams, is represented as a set of XML definite clauses. Equivalent transformation (ET) is used as a fundamental computation mechanism for reasoning with the represented diagrams.

show abstract

A Data Model for XML Databases

Cited by 7 publications

References 7 publications

Using an automatic marking system for programming courses

Using an automatic marking system for programming courses

Query Formulation and Evaluation for XML Databases

Toward reasoning with unified modeling language diagrams based on extensible markup language declarative description theory

Contact Info

Product

Resources

About