Query time versus redundancy trade-offs for range queries

DOI10.1016/0022-0000(81)90071-4zbMath0549.68098OpenAlexW1995911648MaRDI QIDQ800105

Michael L. Fredman, Dennis James Volper

Publication date: 1981

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(81)90071-4

zbMATH Keywords

binary treedata structuresdegree of redundancyquery timerange query problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Information storage and retrieval of data (68P20)

Related Items (2)

On the time-space complexity of reachability queries for preprocessed graphs ⋮ Unnamed Item

Cites Work

• Inherent complexity trade-offs for range query problems
• Lower Bounds on the Complexity of Some Optimal Data Structures
• A Lower Bound on the Complexity of Orthogonal Range Queries

This page was built for publication: Query time versus redundancy trade-offs for range queries