Name
Abstract | ||
|---|---|---|
TQL is a query language for semi-structured data. TQL binding mechanism is based upon the ambient logic. 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, here we first extend it with tree operations, hence obtaining an algebra for the full TQL language. Then we shortly describe the evaluation techniques that we exploit in the actual implementation. |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1007/978-0-387-35608-2_35 | IFIP TCS |
Keywords | Field | DocType |
tql algebra | Query language,Algebra,Negation,Computer science,Exploit,Operator (computer programming),Universal quantification,Recursion | Conference |
Volume | ISSN | ISBN |
96 | 1571-5736 | 1-4020-7181-7 |
Citations | PageRank | References |
10 | 2.08 | 11 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Giovanni Conforti | 1 | 103 | 12.13 |
| Orlando Ferrara | 2 | 10 | 2.08 |
| Giorgio Ghelli | 3 | 1300 | 255.19 |