scientific article; zbMATH DE number 3907783

MaRDI QIDQ3685210zbMATH OpenFDO

Authors Dan E. Willard

Publication date 1985

zbMATH Keywords

orthogonal range queriesrectangle intersectionrelational data basesVLSI-design

Mathematics Subject Classification ID

Trees (05C05) Data structures (68P05) Searching and sorting (68P10) Information storage and retrieval of data (68P20) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 3876615
• Efficient multiway radix search trees
• scientific article; zbMATH DE number 1947390
• Space efficient algorithms for breadth-depth search
• Reductions in binary search trees
• Space saving by dynamic algebraization based on tree-depth
• Improving time and space efficiency in generalized binary search trees
• A polynomial-time algorithm for memory space reduction
• Limited memory space dilation and reduction algorithms
• Memory-tight reductions

Cited in

(11)

• Efficient multiway radix search trees
• Memory-tight reductions
• Space saving generalization of \(B\)-trees with \(2/3\) utilization
• Space saving by dynamic algebraization based on tree-depth
• ON MULTI-LEVEL k-RANGES FOR RANGE SEARCH
• A linear in memory non-exhaustive algorithm to solve a two-dimensional interval search problem
• New Data Structures for Orthogonal Range Queries
• Space-Time Trade-Offs for Orthogonal Range Queries
• scientific article; zbMATH DE number 140471 (Why is no real title available?)
• scientific article; zbMATH DE number 2086648 (Why is no real title available?)
• Minimizing access pointers into trees and arrays

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3685210)