The variance of a partial match retrieval in a multidimensional symmetric trie

DOI10.1002/RSA.3240070106zbMATH Open0844.68034OpenAlexW2038853840MaRDI QIDQ4847397FDOQ4847397

Authors Werner Schachinger

Publication date 18 August 1996

Published in Random Structures \& Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/rsa.3240070106

zbMATH Keywords

partial match retrieval\(M\)-dimensional trie

Mathematics Subject Classification ID

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

Recommendations

• MULTIDIMENSIONAL DIGITAL SEARCHING AND SOME NEW PARAMETERS IN TRIES
• Partial match queries in relaxed multidimensional search trees
• The variance for partial match retrievals in \(k\)-dimensional bucket digital trees
• Distributional Results for Costs of Partial Match Queries in Asymmetric K-Dimensional Tries
• scientific article; zbMATH DE number 1545683

Cites work

• scientific article; zbMATH DE number 53861 (Why is no real title available?)
• Lectures on summability

Cited in

(5)

• The variance for partial match retrievals in \(k\)-dimensional bucket digital trees
• Expected worst-case partial match in random quadtries
• scientific article; zbMATH DE number 1545683 (Why is no real title available?)
• MULTIDIMENSIONAL DIGITAL SEARCHING AND SOME NEW PARAMETERS IN TRIES
• Distributional Results for Costs of Partial Match Queries in Asymmetric K-Dimensional Tries

This page was built for publication: The variance of a partial match retrieval in a multidimensional symmetric trie

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