Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

7

PODS
2002
ACM

favoriteEmaildiscussreport

70views Database» more PODS 2002»

The View-Selection Problem Has an Exponential-Time Lower Bound for Conjunctive Queries and Views

14 years 4 months ago

The View-Selection Problem Has an Exponential-Time Lower Bound for Conjunctive Queries and Views

Download dbgroup.ncsu.edu

Rada Chirkova

Real-time Traffic

Conjunctive Queries | Database | PODS 2002 |

claim paper

Related Content

» A formal perspective on the view selection problem

» Optimization Properties for Classes of Conjunctive Regular Path Queries

» Relative information completeness

» On randomized representations of graphs using short labels

Post Info
More Details (n/a)

Added	08 Dec 2009
Updated	08 Dec 2009
Type	Conference
Year	2002
Where	PODS
Authors	Rada Chirkova

Comments (0)