The Complexity of Hashing with Lazy Deletion

被引：8

作者：

Van Wyk, Christopher J. ^{[1
]}

Vitter, Jeffrey Scott ^{[2
]}

机构：

[1] AT&T Bell Labs, Murray Hill, NJ 07974 USA

[2] Brown Univ, Dept Comp Sci, Providence, RI 02912 USA

来源：

ALGORITHMICA | 1986年 / 1卷 / 1-4期

关键词：

Hashing algorithms; Complexity; Lazy deletion strategies; Birth-death process; Laplace's method;

D O I：

10.1007/BF01840434

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

We examine a version of the dynamic dictionary problem in which stored items have expiration times and can be removed from the dictionary once they have expired. We show that under several reasonable assumptions about the distribution of the items, hashing with lazy deletion uses little more space than methods that use eager deletion. The simple algorithm suggested by this observation was used in a program for analyzing integrated circuit artwork.

引用

页码：17 / 29

页数：13

共 50 条

[1] A QUEUING ANALYSIS OF HASHING WITH LAZY DELETION
MORRISON, JA
SHEPP, LA
VANWYK, CJ
[J]. SIAM JOURNAL ON COMPUTING, 1987, 16 (06) : 1155 - 1164
[2] MAXIMUM QUEUE SIZE AND HASHING WITH LAZY DELETION
KENYON, CM
VITTER, JS
[J]. ALGORITHMICA, 1991, 6 (04) : 597 - 619
[3] MAXIMUM SIZE OF A DYNAMIC DATA STRUCTURE - HASHING WITH LAZY DELETION REVISITED
ALDOUS, D
HOFRI, M
SZPANKOWSKI, W
[J]. SIAM JOURNAL ON COMPUTING, 1992, 21 (04) : 713 - 732
[4] HASHING LAZY NUMBERS
BENOUAMER, MO
JAILLON, P
MICHELUCCI, D
MOREAU, JM
[J]. COMPUTING, 1994, 53 (3-4) : 205 - 217
[5] THE ANALYSIS OF HASHING WITH LAZY DELETIONS
CELIS, P
FRANCO, J
[J]. INFORMATION SCIENCES, 1992, 62 (1-2) : 13 - 26
[6] DELETION ALGORITHMS FOR COALESCED HASHING
CHEN, WC
VITTER, JS
[J]. COMPUTER JOURNAL, 1986, 29 (05): : 436 - 450
[7] Feature Hashing with Insertion and Deletion of Features
Pratap, Rameshwar
Bhardwaj, Suryakant
Sarode, Hrushikesh Sudam
Kulkarni, Raghav
[J]. 2021 IEEE INTERNATIONAL CONFERENCE ON BIG DATA (BIG DATA), 2021, : 888 - 898
[8] DELETION ALGORITHMS FOR HASHING THAT PRESERVE RANDOMNESS
VITTER, JS
[J]. JOURNAL OF ALGORITHMS, 1982, 3 (03) : 261 - 275
[9] THE COMPUTATIONAL-COMPLEXITY OF UNIVERSAL HASHING
MANSOUR, Y
NISAN, N
TIWARI, P
[J]. THEORETICAL COMPUTER SCIENCE, 1993, 107 (01) : 121 - 133
[10] ON THE COMPLEXITY OF BOOLEAN FUNCTIONS COMPUTED BY LAZY ORACLES
DUNNE, PE
LENG, PH
NWANA, GF
[J]. IEEE TRANSACTIONS ON COMPUTERS, 1995, 44 (04) : 495 - 502

← 1 2 3 4 5 →