Article thumbnail

TQL Algebra and its Implementation (Extended Abstract)

By Giovanni Conforti, Orlando Ferrara and Giorgio Ghelli

Abstract

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 based on a logic which includes "difficult" operators such as negation, universal quantification, recursion, and new tree-related operators. In [6] an "implementation model" is presented, in the form of an alternative definition of the semantics of the binding machanism, based on an algebra of infinite relations over trees. Here we first extend that algebra with tree operations, hence obtaining an algebra for the full TQL language. Then we describe the evaluation and optimization techniques that we employ in our implementation

Publisher: Kluwer Academic Publishers
Year: 2002
OAI identifier: oai:CiteSeerX.psu:10.1.1.16.3115
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://tql.di.unipi.it/papers/... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.