Incremental and decremental evaluation of transitive closure by first- order queries
type: Item
instance of: scholarly article
title: Incremental and decremental evaluation of transitive closure by first- order queries
zbMATH Open document ID: 0835.68031
author: Guozhu Dong
author: Jianwen Su
published in: Information and Computation
publication date: 1995-09-17T00:00:00Z
Mathematics Subject Classification ID: 68P15
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 797322
zbMATH Keywords: first-order queries
zbMATH Keywords: transitive closure
MaRDI profile type: Publication
full work available at URL: inco.1995.1102
OpenAlex ID: W2009489912
DOI: 10.1006/INCO.1995.1102
Recommended article: Q4414535
Recommended article: On the decidability of termination of query evaluation in transitive-closure logics for polynomial constraint databases
Recommended article: Nonrecursive incremental evaluation of Datalog queries
Recommended article: Arity bounds in first-order incremental evaluation and definition of polynomial time database queries
Recommended article: An Experimental Study of Dynamic Algorithms for Transitive Closure
Recommended article: An experimental study of algorithms for fully dynamic transitive closure
description: scientific article; zbMATH DE number 797322