Language Bindings to XML

F. Simeoni, D. Lievens, R. Connor, P. Manghi

Research output: Contribution to journalArticle

10 Citations (Scopus)

Abstract

In this paper, we investigate the issues that arise when binding statically typed languages to XML data. In particular, our motivation is to exploit the computational facilities of mainstream languages when computing over real-world entities encoded as XML documents or document fragments. These include completeness, strong typing, efficiency, as well as user-base and support. We first show that standard binding solutions, such as the SAX and DOM APIs, do not preserve the semantics of such entities, and thus hinder program specification, verification, and optimisation. We then compare two novel approaches, which rely on type information to preserve semantics. The first is Sun's JAXB architecture, in which types are automatically generated from document descriptions. The second is our SNAQue architecture, where types are directly specified by binding computations. For certain classes of applications, we show that the latter offers substantial advantages in terms of simplicity and flexibility. In previous work we have formally proven that SNAQue bindings can be correctly built for a representative, canonical language. Here, we extend that work and present SNAQue/J, a binding mechanism specific to the Java language.
LanguageEnglish
Pages19-27
Number of pages8
JournalIEEE Internet Computing
Volume7
Issue number1
Publication statusPublished - 2003

Fingerprint

XML
Semantics
Sun
Specifications

Cite this

Simeoni, F., Lievens, D., Connor, R., & Manghi, P. (2003). Language Bindings to XML. IEEE Internet Computing, 7(1), 19-27.
Simeoni, F. ; Lievens, D. ; Connor, R. ; Manghi, P. / Language Bindings to XML. In: IEEE Internet Computing. 2003 ; Vol. 7, No. 1. pp. 19-27.
@article{e0d65a1ee15d470e97d354c522d3456c,
title = "Language Bindings to XML",
abstract = "In this paper, we investigate the issues that arise when binding statically typed languages to XML data. In particular, our motivation is to exploit the computational facilities of mainstream languages when computing over real-world entities encoded as XML documents or document fragments. These include completeness, strong typing, efficiency, as well as user-base and support. We first show that standard binding solutions, such as the SAX and DOM APIs, do not preserve the semantics of such entities, and thus hinder program specification, verification, and optimisation. We then compare two novel approaches, which rely on type information to preserve semantics. The first is Sun's JAXB architecture, in which types are automatically generated from document descriptions. The second is our SNAQue architecture, where types are directly specified by binding computations. For certain classes of applications, we show that the latter offers substantial advantages in terms of simplicity and flexibility. In previous work we have formally proven that SNAQue bindings can be correctly built for a representative, canonical language. Here, we extend that work and present SNAQue/J, a binding mechanism specific to the Java language.",
author = "F. Simeoni and D. Lievens and R. Connor and P. Manghi",
year = "2003",
language = "English",
volume = "7",
pages = "19--27",
journal = "IEEE Internet Computing",
issn = "1089-7801",
number = "1",

}

Simeoni, F, Lievens, D, Connor, R & Manghi, P 2003, 'Language Bindings to XML' IEEE Internet Computing, vol. 7, no. 1, pp. 19-27.

Language Bindings to XML. / Simeoni, F.; Lievens, D.; Connor, R.; Manghi, P.

In: IEEE Internet Computing, Vol. 7, No. 1, 2003, p. 19-27.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Language Bindings to XML

AU - Simeoni, F.

AU - Lievens, D.

AU - Connor, R.

AU - Manghi, P.

PY - 2003

Y1 - 2003

N2 - In this paper, we investigate the issues that arise when binding statically typed languages to XML data. In particular, our motivation is to exploit the computational facilities of mainstream languages when computing over real-world entities encoded as XML documents or document fragments. These include completeness, strong typing, efficiency, as well as user-base and support. We first show that standard binding solutions, such as the SAX and DOM APIs, do not preserve the semantics of such entities, and thus hinder program specification, verification, and optimisation. We then compare two novel approaches, which rely on type information to preserve semantics. The first is Sun's JAXB architecture, in which types are automatically generated from document descriptions. The second is our SNAQue architecture, where types are directly specified by binding computations. For certain classes of applications, we show that the latter offers substantial advantages in terms of simplicity and flexibility. In previous work we have formally proven that SNAQue bindings can be correctly built for a representative, canonical language. Here, we extend that work and present SNAQue/J, a binding mechanism specific to the Java language.

AB - In this paper, we investigate the issues that arise when binding statically typed languages to XML data. In particular, our motivation is to exploit the computational facilities of mainstream languages when computing over real-world entities encoded as XML documents or document fragments. These include completeness, strong typing, efficiency, as well as user-base and support. We first show that standard binding solutions, such as the SAX and DOM APIs, do not preserve the semantics of such entities, and thus hinder program specification, verification, and optimisation. We then compare two novel approaches, which rely on type information to preserve semantics. The first is Sun's JAXB architecture, in which types are automatically generated from document descriptions. The second is our SNAQue architecture, where types are directly specified by binding computations. For certain classes of applications, we show that the latter offers substantial advantages in terms of simplicity and flexibility. In previous work we have formally proven that SNAQue bindings can be correctly built for a representative, canonical language. Here, we extend that work and present SNAQue/J, a binding mechanism specific to the Java language.

UR - http://doi.ieeecomputersociety.org/10.1109/MIC.2003.1167335

M3 - Article

VL - 7

SP - 19

EP - 27

JO - IEEE Internet Computing

T2 - IEEE Internet Computing

JF - IEEE Internet Computing

SN - 1089-7801

IS - 1

ER -

Simeoni F, Lievens D, Connor R, Manghi P. Language Bindings to XML. IEEE Internet Computing. 2003;7(1):19-27.