Multidimensional digital searching—alternative data structures

DOI10.1002/RSA.3240050112MaRDI QIDQ4288883zbMATH OpenOpenAlexFDO

Authors Peter Kirschenhofer, Helmut Prodinger

Publication date 2 January 1995

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

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

zbMATH Keywords

digital search treestriesPatricia triespartial match queries

Mathematics Subject Classification ID

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

Recommendations

• MULTIDIMENSIONAL DIGITAL SEARCHING AND SOME NEW PARAMETERS IN TRIES
• Digital Search Trees Revisited
• Patricia tries again revisited
• A characterization of digital search trees from the successful search viewpoint

Cited in

(11)

• Digital Search Trees Revisited
• On the variance of a class of inductive valuations of data structures for digital search
• Improving the performance of multidimensional search using fingers
• Mellin transforms and asymptotics: Finite differences and Rice's integrals
• A Functional Approach to Data Structures and Its Use in Multidimensional Searching
• scientific article; zbMATH DE number 4014072 (Why is no real title available?)
• A characterization of digital search trees from the successful search viewpoint
• scientific article; zbMATH DE number 140469 (Why is no real title available?)
• scientific article; zbMATH DE number 194610 (Why is no real title available?)
• MULTIDIMENSIONAL DIGITAL SEARCHING AND SOME NEW PARAMETERS IN TRIES
• The variance for partial match retrievals in k-dimensional bucket digital trees

This page was built for publication: Multidimensional digital searching—alternative data structures

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