๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Optimizing complex queries based on similarities of subqueries

โœ Scribed by Qiang Zhu; Yingying Tao; Calisto Zuzarte


Book ID
106280231
Publisher
Springer-Verlag
Year
2005
Tongue
English
Weight
886 KB
Volume
8
Category
Article
ISSN
0219-1377

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


On the Complexity of Database Queries
โœ Christos H. Papadimitriou; Mihalis Yannakakis ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 223 KB

We revisit the issue of the complexity of database queries, in the light of the recent parametric refinement of complexity theory. We show that, if the query size (or the number of variables in the query) is considered as a parameter, then the relational calculus and its fragments (conjunctive queri