Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Graph traversal and top-down evaluation of logic queries

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

DOI10.1007/BF02946620zbMath0903.68068MaRDI QIDQ1130171

Yangjun Chen

Publication date: 20 August 1998

Published in: Journal of Computer Science and Technology (Search for Journal in Brave)


zbMATH Keywords

linear recursive querieslogic query


Mathematics Subject Classification ID

Database theory (68P15)



Uses Software

  • Datalog


Cites Work

  • Magic sets revisited
  • Counting and topological order
  • On the power of magic
  • Comparison of methods for logic-query implementation
  • Efficient bottom-up computation of queries on stratified databases
  • Towards an algebraic theory of recursion
  • Depth-First Search and Linear Graph Algorithms
  • Unnamed Item
  • Unnamed Item




This page was built for publication: Graph traversal and top-down evaluation of logic queries

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1130171&oldid=13179303"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 03:20.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki