Inherent complexity trade-offs for range query problems
type: Item
instance of: scholarly article
title: Inherent complexity trade-offs for range query problems
zbMATH Open document ID: 0522.68090
DOI: 10.1016/0304-3975(81)90099-2
author: Walter A. Burkhard
author: Michael L. Fredman
author: Daniel J. Kleitman
published in: Theoretical Computer Science
publication date: 1981-01-01T00:00:00Z
Mathematics Subject Classification ID: 68P20
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 3827250
zbMATH Keywords: range query problems
zbMATH Keywords: inherent trade-offs
zbMATH Keywords: average complexities
zbMATH Keywords: retrieve transactions
zbMATH Keywords: update transactions
MaRDI profile type: Publication
full work available at URL: 0304-3975(81)90099-2
OpenAlex ID: W2021182002
cites work: Lower Bounds on the Complexity of Some Optimal Data Structures
cites work: The Complexity of Maintaining an Array and Computing Its Partial Sums
cites work: A Lower Bound on the Complexity of Orthogonal Range Queries
cites work: Some Monotonicity Properties of Partial Orders
description: scientific article; zbMATH DE number 3827250