The variance of a partial match retrieval in a multidimensional symmetric trie
From MaRDI portal
Publication:4847397
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
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
Information storage and retrieval of data (68P20) Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10)
Cites Work
Cited In (5)
- Distributional Results for Costs of Partial Match Queries in Asymmetric K-Dimensional Tries
- Title not available (Why is that?)
- MULTIDIMENSIONAL DIGITAL SEARCHING AND SOME NEW PARAMETERS IN TRIES
- Expected worst-case partial match in random quadtries
- The variance for partial match retrievals in \(k\)-dimensional bucket digital trees
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)