TQL is a query language for semi-structured data. TQL binding mechanism is based upon the ambient logic, a logic to describe trees, originally defined to model properties of distributed processes. This binding mechanism is the key feature of TQL, but its implementation is far from obvious, being

of queries that can be declaratively expressed in TQL is quite wide. The implementation of TQL binding mechanism requires the adoption of non-standard techniques, and some of its aspects are still open. In this paper we implicitly report about the current status of the implementation by writing all queries

This work presents the query language TQL, a query language for semistructured data, that can be used to query XML files. TQL substitutes

CQL, a Continuous Query Language, is supported by the STREAM prototype Data Stream Management System at Stanford. CQL is an expressive SQL-based declarative language for registering continuous queries against streams and updatable relations. We begin by presenting an abstract semantics that relies only on "black box" mappings among streams and relations.

this paper we present TQL, a query language for semistructured data that is based on the ambient logic

This paper presents a new approach to analyse Building Information Models. Firstly, a domain-specific language in its textual notation is introduced. It is tailored to domain experts with little programming experience. Based on an uncomplicated pattern, the language offers a formal and general

-time data models. We evaluate temporal and real-time query languages along several dimensions. Temporal and real-time DBMS implementation is examined. We conclude with a summary of the major accomplishments of the research to date, and list several research questions that should be addressed next. Keywords

. The motivating principle behind its design is that a simple, clean, and powerful type system for XML processing can be based directly on the theory of regular tree automata

implement this algorithm (e.g. TRED2 and TQL2 from EISPACK [21]) perform very well on sequential computers. But, the classical algorithm may be reorganized to exploit the hardware of high performance computers. On modern supercomputers with vector- and/or parallel--processing capabilities, it is very

The power of two well-known consistency conditions for shared-memory multiprocessors, sequential consistency and linearizability, is compared. The cost measure studied is the worst-case response time in distributed implementations of virtual shared memory supporting one of the two conditions. Three