![]() |
Volumn , Issue , 2002, Pages 159-168
|
The view-selection problem has an exponential-time lower bound for conjunctive queries and views
|
Author keywords
[No Author keywords available]
|
Indexed keywords
ALGORITHMS;
COMPUTATIONAL COMPLEXITY;
DATA STORAGE EQUIPMENT;
DATA WAREHOUSES;
MATHEMATICAL MODELS;
OPTIMIZATION;
POLYNOMIALS;
PROBLEM SOLVING;
QUERY LANGUAGES;
INFORMATION INTEGRATION;
QUERY OPTIMIZATION;
QUERY WORKLOAD;
VIEW SELECTION ALGORITHM;
VIEW SELECTION PROBLEM;
RELATIONAL DATABASE SYSTEMS;
|
EID: 0036036852
PISSN: None
EISSN: None
Source Type: Conference Proceeding
DOI: 10.1145/543613.543634 Document Type: Conference Paper |
Times cited : (13)
|
References (16)
|