Name
Abstract | ||
|---|---|---|
We study the dynamic data structure management technique called Hashing with LazyDeletion (HwLD). A table managed under HwLD is built via a sequence of insertions anddeletions of items. When hashing with lazy deletions, one does not delete items as soonas possible, but keeps more items in the data structure than immediate-deletion strategieswould. This deferral allows the use of a simpler deletion algorithm, leading to a loweroverhead---in space and time---for the HwLD implementation. It... |
Year | DOI | Venue |
|---|---|---|
1992 | 10.1137/0221043 | SIAM J. Comput. |
Keywords | Field | DocType |
dynamic data structure,lazy deletion,maximum size,data structure | Data structure,Discrete mathematics,Lazy deletion,Combinatorics,Queue,Algorithm,Queueing theory,Hash function,Probabilistic logic,Poisson distribution,Dynamic perfect hashing,Mathematics | Journal |
Volume | Issue | ISSN |
21 | 4 | 0097-5397 |
Citations | PageRank | References |
2 | 0.77 | 7 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| David Aldous | 1 | 2 | 0.77 |
| Micha Hofri | 2 | 342 | 127.96 |
| Wojciech Szpankowski | 3 | 1557 | 192.33 |