Assume that each object in a database has m grades, or scores, one for each of m attributes. For example, an object can have a color grade, that tells how red it is, and a shape g...
Given a document D in the form of an unordered labeled tree, we study the expressibility on D of various fragments of XPath, the core navigational language on XML documents. We gi...
Marc Gyssens, Jan Paredaens, Dirk Van Gucht, Georg...
In the study of data exchange one usually assumes an openworld semantics, making it possible to extend instances of target schemas. An alternative closed-world semantics only move...
In this study we propose sketching algorithms for computing similarities between hierarchical data. Specifically, we look at data objects that are represented using leaf-labeled t...
One of the main objectives of developing component-based software systems is to enable efficient building of systems through the integration of components. All component models def...