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

Magic sets revisited

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

DOI10.1007/BF02943154zbMath0881.68044MaRDI QIDQ1368187

Yangjun Chen

Publication date: 16 February 1998

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


zbMATH Keywords

linear recursionmagic-set method


Mathematics Subject Classification ID

Database theory (68P15)


Related Items (2)

Counting and topological order ⋮ Graph traversal and top-down evaluation of logic queries


Uses Software

  • Datalog


Cites Work

  • Unnamed Item
  • On the power of magic
  • Comparison of methods for logic-query implementation
  • Implementation of logical query languages for databases
  • On compiling queries in recursive first-order databases
  • Worst case analysis of two heuristics for the set partitioning problem
  • Efficient bottom-up computation of queries on stratified databases
  • Graphic representation of linear recursive rules
  • Towards an algebraic theory of recursion
  • Depth-First Search and Linear Graph Algorithms




This page was built for publication: Magic sets revisited

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1368187&oldid=13511903"
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 15:00.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki