Two-way chaining for non-uniform distributions

DOI10.1080/00207160802132871zbMATH Open1185.68365OpenAlexW2016356949MaRDI QIDQ5852152FDOQ5852152

Authors: Ebrahim Malalla 

Publication date: 26 January 2010

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160802132871

Recommendations

• Two-Way Chaining with Reassignment
• The expected length of the longest probe sequence for bucket searching when the distribution is not uniform
• Efficient hashing with lookups in two memory accesses
• Hashing with Linear Probing under Nonuniform Probabilities
• The analysis of double hashing

zbMATH Keywords

non-uniform distributionsworst-case search timetwo-way chainingmultiple choice allocation processwitness tree

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Probability and random processes.
• Title not available (Why is that?)
• Storing a Sparse Table with 0 (1) Worst Case Access Time
• Title not available (Why is that?)
• Dynamic Perfect Hashing: Upper and Lower Bounds
• How asymmetry helps load balancing
• Title not available (Why is that?)
• Title not available (Why is that?)
• Balanced Allocations
• Efficient PRAM simulation on a distributed memory machine
• Randomized allocation processes
• Expected Length of the Longest Probe Sequence in Hash Code Searching
• Fast probabilistic algorithms for Hamiltonian circuits and matchings
• Using the Power of Two Choices to Improve Bloom Filters
• Balanced allocation and dictionaries with tightly packed constant size bins
• Balanced Allocations: The Heavily Loaded Case
• Two-Way Chaining with Reassignment
• An algorithmic and complexity analysis of interpolation search
• Title not available (Why is that?)
• The expected length of the longest probe sequence for bucket searching when the distribution is not uniform
• Studying Balanced Allocations with Differential Equations
• Title not available (Why is that?)
• Neighborhood preserving hashing and approximate queries
• Multidimensional balanced allocations

Cited In (2)

• Efficient hashing with lookups in two memory accesses
• Two-Way Chaining with Reassignment

This page was built for publication: Two-way chaining for non-uniform distributions

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