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

On the bottom-up evaluation of recursive queries

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

DOI<807::AID-INT7>3.0.CO;2-2 10.1002/(SICI)1098-111X(199610)11:10<807::AID-INT7>3.0.CO;2-2zbMath0862.68045OpenAlexW2135542610MaRDI QIDQ4332202

Yangjun Chen

Publication date: 1996

Full work available at URL: https://doi.org/10.1002/(sici)1098-111x(199610)11:10<807::aid-int7>3.0.co;2-2


zbMATH Keywords

bottom-up evaluation method


Mathematics Subject Classification ID

Database theory (68P15)


Related Items

On the graph traversal method for evaluating linear binary-chain programs



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