Abstract. When querying XML collections, users cannot always express their need in a precise way. Systems should therefore support vagueness at both the content and structural leve...
Karen Sauvagnat, Mohand Boughanem, Claude Chrismen...
We show how to partition data structures representable by directed acyclic graphs, i.e. rooted trees, to allow for efficient complex operations, which lie beyond inserts, deletes ...
: Two main problems arise in modelling data warehouse structures. The first consists in establishing an adequate representation of dimensions in order to facilitate and to control ...
In this paper we first present a novel approach to determine the structural information content (graph entropy) of a network represented by an undirected and connected graph. Such...
We study the existence of automatic presentations for various algebraic structures. An automatic presentation of a structure is a description of the universe of the structure by a...