Sciweavers

806 search results - page 100 / 162
» An Optimal Dynamic Data Structure for Stabbing-Semigroup Que...
Sort
View
CORR
2006
Springer
142views Education» more  CORR 2006»
15 years 1 months ago
Decentralized Erasure Codes for Distributed Networked Storage
We consider the problem of constructing an erasure code for storage over a network when the data sources are distributed. Specifically, we assume that there are n storage nodes wit...
Alexandros G. Dimakis, Vinod M. Prabhakaran, Kanna...
SODA
2012
ACM
174views Algorithms» more  SODA 2012»
13 years 3 months ago
Using hashing to solve the dictionary problem
We consider the dictionary problem in external memory and improve the update time of the wellknown buffer tree by roughly a logarithmic factor. For any λ ≥ max{lg lg n, logM/B(...
John Iacono, Mihai Patrascu
ICDE
2010
IEEE
184views Database» more  ICDE 2010»
15 years 5 months ago
On optimal anonymization for l+-diversity
-- Publishing person specific data while protecting privacy is an important problem. Existing algorithms that enforce the privacy principle called l-diversity are heuristic based d...
Junqiang Liu, Ke Wang
PVLDB
2010
204views more  PVLDB 2010»
14 years 11 months ago
Cheetah: A High Performance, Custom Data Warehouse on Top of MapReduce
Large-scale data analysis has become increasingly important for many enterprises. Recently, a new distributed computing paradigm, called MapReduce, and its open source implementat...
Songting Chen
ICDE
2007
IEEE
178views Database» more  ICDE 2007»
16 years 2 months ago
Efficient Skyline Query Processing on Peer-to-Peer Networks
Skyline query has been gaining much interest in database research communities in recent years. Most existing studies focus mainly on centralized systems, and resolving the problem...
Shiyuan Wang, Beng Chin Ooi, Anthony K. H. Tung, L...