|
Volumn , Issue , 1995, Pages 266-276
|
On the complexity of bounded-variable queries
a |
Author keywords
[No Author keywords available]
|
Indexed keywords
COMPUTATIONAL COMPLEXITY;
DATABASE SYSTEMS;
EVALUATION;
OPTIMIZATION;
POLYNOMIALS;
BOUNDED VARIABLE QUERIES;
DATA COMPLEXITY;
EXISTENTIAL SECOND ORDER LOGIC;
EXPRESSION COMPLEXITY;
FIRST ORDER LOGIC;
FIX POINT LOGIC;
PARTIAL FIX POINT LOGIC;
RELATIONAL DATABASES;
TAXONOMY;
QUERY LANGUAGES;
|
EID: 0029204108
PISSN: None
EISSN: None
Source Type: Conference Proceeding
DOI: None Document Type: Conference Paper |
Times cited : (157)
|
References (0)
|