The variance for partial match retrievals in k-dimensional bucket digital trees

zbMATH Open1355.68063MaRDI QIDQ2959909FDOQ2959909

Authors: Michael Fuchs 

Publication date: 10 February 2017

Full work available at URL: http://www.dmtcs.org/dmtcs-ojs/index.php/proceedings/article/view/dmAM0118

Recommendations

• The variance of a partial match retrieval in a multidimensional symmetric trie
• scientific article; zbMATH DE number 1545683
• MULTIDIMENSIONAL DIGITAL SEARCHING AND SOME NEW PARAMETERS IN TRIES
• On The variance of the extremal path length in a symmetric digital trie
• Multidimensional digital searching—alternative data structures

zbMATH Keywords

Mellin transformvariancepartial match retrievalJS-admissibility\(k\)-dimensional digital trees

Mathematics Subject Classification ID

Data structures (68P05)

Cited In (5)

• Partial match retrieval of multidimensional data
• The variance of a partial match retrieval in a multidimensional symmetric trie
• An analytic approach to the asymptotic variance of trie statistics and related structures
• MULTIDIMENSIONAL DIGITAL SEARCHING AND SOME NEW PARAMETERS IN TRIES
• A multivariate view of random bucket digital search trees

This page was built for publication: The variance for partial match retrievals in \(k\)-dimensional bucket digital trees

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