Partial match retrieval of multidimensional data

DOI10.1145/5383.5453zbMath1430.68087OpenAlexW2014771275MaRDI QIDQ5216437

Claude Puech, Philippe Flajolet

Publication date: 17 February 2020

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/inria-00076325/file/RR-0233.pdf

Mathematics Subject Classification ID

Data structures (68P05) Information storage and retrieval of data (68P20)

Related Items (18)

Sequence positivity through numeric analytic continuation: uniqueness of the Canham model for biomembranes ⋮ On the cost of fixed partial match queries in \(K\)-d trees ⋮ Gkd-trees: Binary trees that combine multi-dimensional data handling, node size and fringe reorganization ⋮ On the cost of searching signature trees ⋮ Intersections with random geometric objects ⋮ On the expected cost of partial match queries in random quad-\(K\)-d trees ⋮ Median and hybrid median \(K\)-dimensional trees ⋮ Computing error bounds for asymptotic expansions of regular P-recursive sequences ⋮ Quad-\(k\mathrm d\) trees: a general framework for \(k\mathrm d\) trees and quad trees ⋮ An analytic approach to the asymptotic variance of trie statistics and related structures ⋮ A characterization of digital search trees from the successful search viewpoint ⋮ Mellin transforms and asymptotics: Harmonic sums ⋮ On the variance of a class of inductive valuations of data structures for digital search ⋮ Singularity analysis, Hadamard products, and tree recurrences ⋮ A limit field for orthogonal range searches in two-dimensional random point search trees ⋮ Analytic analysis of algorithms ⋮ Partial match queries in random quadtrees ⋮ Expected worst-case partial match in random quadtries

This page was built for publication: Partial match retrieval of multidimensional data