Inferring structure in semistructured data

Inferring Class Composition Structures in Semistructured Data

Inferring Task Structure From Data

An algorithm is presented for fitting an expression composed of continuous and discontinuous primitive functions to real-valued data points. The data modeling problem comes from the need to infer task structure for making coordination decisions for multi-agent systems. The presence of discontinuous primitive functions requires a novel approach.

Query Processing using Dynamic Relational Structure for Semistructured Data

The most promising and dominant data format for data processing and representation on the Internet is the semistructured data form termed XML. XML data has no fixed schema; it evolved and is self describing which results in management difficulties compared to, for example, relational data. It is therefore a major challenge for the database community to design query processing techniques and sto...

Path Rewriting in Semistructured Data

We consider in this paper rooted labeled directed graphs as models for semistructured data. A path inclusion constraint, in such graphs, is an expression p q where p and q are regular expressions over the alphabet of labels. An path inclusion constraint p q is satisfied by a rooted labeled directed graph if the set of nodes reached, from the root, by the words of the language described by p is ...

Path constraints in semistructured data

We consider semistructured data as multi rooted edge-labeled directed graphs, and path inclusion constraints on these graphs. A path inclusion constraint p q is satisfied by a semistructured data if any node reached by the regular query p is also reached by the regular query q. In this paper, two problems are mainly studied: the implication problem and the problem of the existence of a finite e...