|
Volumn , Issue , 1999, Pages 21-32
|
Hypertree decompositions and tractable queries
a a a |
Author keywords
[No Author keywords available]
|
Indexed keywords
COMPUTATIONAL COMPLEXITY;
DATA STRUCTURES;
THEOREM PROVING;
TREES (MATHEMATICS);
HYPERTREE DECOMPOSITION;
TRACTABLE QUERY;
QUERY LANGUAGES;
|
EID: 0032650621
PISSN: None
EISSN: None
Source Type: Conference Proceeding
DOI: 10.1145/303976.303979 Document Type: Article |
Times cited : (77)
|
References (40)
|