A fundamental problem in XML query processing is tree pattern query (TPQ) matching which computes all data instances in an XML database that match an input TPQ. There is a lot of r...
Many enterprise applications prefer to store XML data as a rich data type, i.e. a sequence of bytes, in a relational database system to avoid the complexity of decomposing the dat...
Shankar Pal, Istvan Cseri, Oliver Seeliger, Michae...
We propose an efficient approach for finding relevant XML data twigs defined by unordered query tree specifications. We use the tree signatures as the index structure and find...
Pavel Zezula, Federica Mandreoli, Riccardo Martogl...
Internet has changed many aspects of our society, transforming it in e-society, and is having special importance in business world, Internet has converted business in e-business. ...
A simple extension to the relational model that permits metadata (more generally metaknowledge) to be stored and manipulated as first class data is proposed. The accompanying que...