語系:
繁體中文
English
說明(常見問題)
圖資館首頁
登入
回首頁
切換:
標籤
|
MARC模式
|
ISBD
Hash-based data structures for extre...
~
Harvard University.
Hash-based data structures for extreme conditions.
紀錄類型:
書目-語言資料,印刷品 : Monograph/item
正題名/作者:
Hash-based data structures for extreme conditions.
作者:
Kirsch, Adam Lavitt.
面頁冊數:
160 p.
附註:
Adviser: Michael Mitzenmacher.
附註:
Source: Dissertation Abstracts International, Volume: 69-05, Section: B, page: 3094.
Contained By:
Dissertation Abstracts International69-05B.
標題:
Computer Science.
電子資源:
http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3312412
ISBN:
9780549616108
Hash-based data structures for extreme conditions.
Kirsch, Adam Lavitt.
Hash-based data structures for extreme conditions.
- 160 p.
Adviser: Michael Mitzenmacher.
Thesis (Ph.D.)--Harvard University, 2008.
First, we show that a wide class of Bloom filter variants can be effectively implemented using very easily computable combinations of only two fully random hash functions. From a theoretical perspective, these results show that Bloom filters and related data structures can often be substantially derandomized with essentially no loss in performance. From a practical perspective, this derandomization allows for a significant speedup in certain query intensive applications.
ISBN: 9780549616108Subjects--Topical Terms:
212513
Computer Science.
Hash-based data structures for extreme conditions.
LDR
:03148nam _2200289 _450
001
206879
005
20090413125934.5
008
090730s2008 ||||||||||||||||| ||eng d
020
$a
9780549616108
035
$a
00372091
040
$a
UMI
$c
UMI
100
$a
Kirsch, Adam Lavitt.
$3
321814
245
1 0
$a
Hash-based data structures for extreme conditions.
300
$a
160 p.
500
$a
Adviser: Michael Mitzenmacher.
500
$a
Source: Dissertation Abstracts International, Volume: 69-05, Section: B, page: 3094.
502
$a
Thesis (Ph.D.)--Harvard University, 2008.
520
$a
First, we show that a wide class of Bloom filter variants can be effectively implemented using very easily computable combinations of only two fully random hash functions. From a theoretical perspective, these results show that Bloom filters and related data structures can often be substantially derandomized with essentially no loss in performance. From a practical perspective, this derandomization allows for a significant speedup in certain query intensive applications.
520
$a
For scenarios where we can afford the parallelization above, the space utilization of standard multiple choice hash table constructions can be improved by allowing items to be moved within the hash table after they are initially inserted. While there are a number of known hash table constructions with this property, the worst case insertion times are too large for the applications we consider. To address this problem, we introduce and analyze a wide variety of hash table constructions that move at most one item in the during the insertion of a new item. Using differential equation approximations and numerical methods, we are able to quantify the performance of our schemes tightly and show that they are superior to standard constructions that do not allow moves.
520
$a
The rest of this work focuses on designing space-efficient, open-addressed, multiple choice hash tables for implementation in high-performance router hardware. Using multiple hash functions conserves space, but requires every hash table operation to consider multiple hash buckets, forcing a tradeoff between the slow speed of examining these buckets serially and the hardware complications of parallel examinations. Improving on previous constructions, we show that a small Bloom filter-based data structure in fast memory can essentially allow us to use multiple hash functions while only examining a single bucket during a hash table operation.
520
$a
This thesis is about the design and analysis of Bloom filter and multiple choice hash table variants for application settings with extreme resource requirements. We employ a very flexible methodology, combining theoretical, numerical, and empirical techniques to obtain constructions that are both analyzable and practical.
590
$a
School code: 0084.
650
$a
Computer Science.
$3
212513
690
$a
0984
710
$a
Harvard University.
$3
212445
773
0
$g
69-05B.
$t
Dissertation Abstracts International
790
$a
0084
790
1 0
$a
Mitzenmacher, Michael,
$e
advisor
791
$a
Ph.D.
792
$a
2008
856
4 0
$u
http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3312412
$z
http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3312412
筆 0 讀者評論
全部
電子館藏
館藏
1 筆 • 頁數 1 •
1
條碼號
館藏地
館藏流通類別
資料類型
索書號
使用類型
借閱狀態
預約狀態
備註欄
附件
000000024310
電子館藏
1圖書
電子書
TH
一般使用(Normal)
在架
0
1 筆 • 頁數 1 •
1
多媒體
多媒體檔案
http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3312412
評論
新增評論
分享你的心得
Export
取書館別
處理中
...
變更密碼
登入