On the complexity of equivalence between recursive and nonrecursive datalog programs

Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Volumn , Issue , 1994, Pages 107-116

  Chaudhuri, Surajit ^a   Vardi, Moshe Y ^a  

^a HEWLETT PACKARD LABORATORIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; LOGIC PROGRAMMING; OPTIMIZATION; QUERY LANGUAGES;

DATALOG; EQUIVALENCE; RECURSIVE PROGRAMS;

DATABASE SYSTEMS;

EID: 0027963989     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/182591.182604     Document Type: Conference Paper

References (0)