Nonrecursive incremental evaluation of Datalog queries (Q1924723): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Q3138873 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undecidable boundedness problems for datalog programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line computation of transitive closures of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Amortized efficiency of a path retrieval data structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: A time bound on the materialization of some recursively defined views / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial evaluation in logic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integrity constraint checking in stratified databases / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Semantics of Predicate Logic as a Programming Language / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01530820 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2011697756 / rank
 
Normal rank

Latest revision as of 09:56, 30 July 2024

scientific article
Language Label Description Also known as
English
Nonrecursive incremental evaluation of Datalog queries
scientific article

    Statements

    Identifiers