Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

scientific article; zbMATH DE number 176243

From MaRDI portal
Publication:4035347
Jump to:navigation, search

zbMATH Open0766.68028MaRDI QIDQ4035347FDOQ4035347


Authors: Guozhu Dong Edit this on Wikidata


Publication date: 18 May 1993



Title of this publication is not available (Why is that?)



Recommendations

  • Linearisability on Datalog programs
  • On decompositions of chain datalog programs into P (left-)linear 1-rule components
  • Grammars and automata to optimize chain logic queries
  • The pushdown method to optimize chain logic programs
  • Parallel complexity of logical query programs


zbMATH Keywords

deductive databasesaddressably linearizablepositive programmed grammar


Mathematics Subject Classification ID

Formal languages and automata (68Q45) Logic programming (68N17) Database theory (68P15)



Cited In (6)

  • Grammars and automata to optimize chain logic queries
  • Generalization of ZYT-linearizability for bilinear datalog programs
  • Linearisability on Datalog programs
  • On the data complexity of consistent query answering over graph databases
  • The pushdown method to optimize chain logic programs
  • On the index of positive programmed formal languages

Uses Software

  • Datalog





This page was built for publication:

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4035347&oldid=17752632"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 6 February 2024, at 02:55. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki