Name
Abstract | ||
|---|---|---|
A part of a query that will never contribute data to the query answer should be regarded as an error. This principle has been recently accepted into mainstream XML query languages, but was still waiting for a complete treatment. We provide here a precise definition for this class of errors, and define a type system that is sound and complete, in its search for such errors, for a core language, under mild restrictions on the use of recursion in type definitions. In the process, we describe a dichotomy among existential and universal type systems, which is essential to understand some specific features of our type system. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1017/S0956796806005983 | J. Funct. Program. |
Keywords | Field | DocType |
complete treatment,mainstream xml query language,core language,path correctness,universal type system,query answer,mild restriction,precise definition,type definition,type system,static analysis,specific feature,query language | Query optimization,Web search query,Query language,RDF query language,Programming language,Query expansion,Computer science,Sargable,Web query classification,Theoretical computer science,Object Query Language | Journal |
Volume | Issue | ISSN |
16 | 4-5 | 0956-7968 |
Citations | PageRank | References |
14 | 0.65 | 16 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dario Colazzo | 1 | 283 | 34.21 |
| Giorgio Ghelli | 2 | 1300 | 255.19 |
| Paolo Manghi | 3 | 196 | 47.95 |
| Carlo Sartiani | 4 | 240 | 28.54 |