<--- Back to Details
First PageDocument Content
File sharing / Computing / Distributed data storage / Computer programming / Distributed hash table / Disjoint-set data structure / Peer-to-peer / Information science
Date: 2008-09-25 05:48:21
File sharing
Computing
Distributed data storage
Computer programming
Distributed hash table
Disjoint-set data structure
Peer-to-peer
Information science

Optimized Union of Non-disjoint Distributed Data Sets Itay Dar Tova Milo ∗

Add to Reading List

Source URL: www.cs.tau.ac.il

Download Document from Source Website

File Size: 341,78 KB

Share Document on Facebook

Similar Documents

Optimized Union of Non-disjoint Distributed Data Sets Itay Dar Tova Milo  ∗

Optimized Union of Non-disjoint Distributed Data Sets Itay Dar Tova Milo ∗

DocID: 1qZUQ - View Document

Data Min Knowl Disc:176–193 DOIs10618Identifying the components Matthijs van Leeuwen · Jilles Vreeken · Arno Siebes

Data Min Knowl Disc:176–193 DOIs10618Identifying the components Matthijs van Leeuwen · Jilles Vreeken · Arno Siebes

DocID: 1qYET - View Document

Worst-Case Analysis of Set Union Algorithms ROBERT E. TAR JAN AT&T Bell Laboratories, Murray Hdl, New Jersey AND JAN VAN LEEUWEN

Worst-Case Analysis of Set Union Algorithms ROBERT E. TAR JAN AT&T Bell Laboratories, Murray Hdl, New Jersey AND JAN VAN LEEUWEN

DocID: 1pSri - View Document

Optimized Union of Non-disjoint Distributed Data Sets Itay Dar Tova Milo  ∗

Optimized Union of Non-disjoint Distributed Data Sets Itay Dar Tova Milo ∗

DocID: 1poiO - View Document

PROD. TYPE: COM PP: 1-12 (col.fig.: nil) ED: Prathiba PAGN: Vidya -- SCAN: global

PROD. TYPE: COM PP: 1-12 (col.fig.: nil) ED: Prathiba PAGN: Vidya -- SCAN: global

DocID: 1mRsU - View Document