We consider two-player games played for an infinite number of rounds, with -regular winning conditions. The games may be concurrent, in that the players choose their moves simulta...
The interaction between recursion in XPATH and recursion in DTDs makes it challenging to answer XPATH queries on XML data that is stored in an RDBMS via schema-based shredding. We...
In this paper, we study semistructured data and indexes preserving inclusion constraints. A semistructured datum is modelled by multi-rooted edge-labeled directed graphs. We consi...
We consider the problem of finding the optimal pair of string patterns for discriminating between two sets of strings, i.e. finding the pair of patterns that is best with respect...
In the past, quite a few fast algorithms have been developed to mine frequent patterns over graph data, with the large spectrum covering many variants of the problem. However, the...