The L ? = NL question remains one of the major unresolved problems in complexity theory. Both L and NL have logical characterizations as the sets of totally ordered ( ) structures...
Research in temporal databases has mainly focused on defining temporal data models by extending existing models, and developing access structures for temporal data. Little has bee...
An important direction in database research for non-standard applications (e.g. engineering or design applications) deals with adequate support for complex objects. Without doubt,...
Abstract. In the area of networks, a common method to enforce a security policy expressed in a high-level language is based on an ad-hoc and manual rewriting process [24]. We argue...
: Relational database systems are highly efficient hosts to table-shaped data. It is all the more interesting to see how a careful inspection of both, the XML tree structure as wel...