Abstract
AbstractWe analyze the average cost of partial match queries in M‐dimensional Digital Search Trees and Patricia Tries. Our results allow a precise comparison of the average behavior of these data structures with the M‐dimensional Tries studied by Flajolet and Puech [J. Assoc. Comput. Mach., 33, 371–407 (1986)]. It turns out that Patricia is superior to Digital Search Tres, the latter ones being superior to Tries. © 1994 John Wiley & Sons, Inc.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
