On the power of incremental evaluation in SQL-Like languages

DOI10.1007/3-540-44543-9_2MaRDI QIDQ4473152zbMATH OpenFDO

Authors Limsoon Wong, Leonid Libkin

Publication date 4 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/1949/19490017.htm

Mathematics Subject Classification ID

Database theory (68P15)

Recommendations

• Nonrecursive incremental evaluation of Datalog queries
• Logic Programming
• On the expressive power of database queries with intermediate types
• scientific article; zbMATH DE number 176244
• Comparison of expressive power of some query languages for databases
• On the bottom-up evaluation of recursive queries
• On compiling queries in recursive first-order databases
• Expressive power of SQL

Cited in

(4)

• Approximate well-founded semantics, query answering and generalized normal logic programs over lattices
• Incremental recomputation in local languages.
• Expressive power of SQL
• Logic Programming

This page was built for publication: On the power of incremental evaluation in SQL-Like languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4473152)