scientific article; zbMATH DE number 140456

zbMATH Open0794.68024MaRDI QIDQ4028872FDOQ4028872

Authors: Walter Cunto, Gustavo Lau, Philippe Flajolet 

Publication date: 28 March 1993

Title of this publication is not available (Why is that?)

Recommendations

• Generalized \(k\)-\(d\)-trees and local reorganizations
• Analysis of range search for random \(k-d\) trees
• Partial match retrieval of multidimensional data
• Choosing optimal branching factors for k-d-B trees
• Gkd-trees: Binary trees that combine multi-dimensional data handling, node size and fringe reorganization

zbMATH Keywords

multidimensional datamultidimensional dictionary

Mathematics Subject Classification ID

Data structures (68P05) Searching and sorting (68P10)

Cited In (15)

• The DR-tree: A main memory data structure for complex multi-dimensional objects
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the average performance of orthogonal range search in multidimensional data structures
• Partial match retrieval of multidimensional data
• On the cost of fixed partial match queries in \(K\)-d trees
• Median and hybrid median \(K\)-dimensional trees
• Use of the spatial \(k\)D-tree in computational physics applications
• Analysis of range search for random \(k-d\) trees
• Quad-\(k\mathrm d\) trees: a general framework for \(k\mathrm d\) trees and quad trees
• Choosing optimal branching factors for k-d-B trees
• Gkd-trees: Binary trees that combine multi-dimensional data handling, node size and fringe reorganization
• A counter example to a monotonicity property of k-d trees
• Quad-\(K\)-d trees
• Generalized \(k\)-\(d\)-trees and local reorganizations

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 Q4028872)