SEPARATING AUXILIARY ARITY HIERARCHY OF FIRST-ORDER INCREMENTAL EVALUATION SYSTEMS USING (3K+1)-ary INPUT RELATIONS

DOI10.1142/S0129054100000302zbMath1038.68042MaRDI QIDQ4528763

Louxin Zhang, Guozhu Dong

Publication date: 2000

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

query languagesdatabase views

Mathematics Subject Classification ID

Database theory (68P15)

Related Items (2)

Unnamed Item ⋮ On the quantifier-free dynamic complexity of reachability

Cites Work

• Lower bounds for constant-depth circuits in the presence of help bits
• Arity bounds in first-order incremental evaluation and definition of polynomial time database queries
• Incremental and decremental evaluation of transitive closure by first- order queries
• Nonrecursive incremental evaluation of Datalog queries

This page was built for publication: SEPARATING AUXILIARY ARITY HIERARCHY OF FIRST-ORDER INCREMENTAL EVALUATION SYSTEMS USING (3K+1)-ary INPUT RELATIONS