Tries are the fastest tree-based data structures for managing strings in-memory, but are space-intensive. The burst-trie is almost as fast but reduces space by collapsing trie-cha...
Structured peer-to-peer overlay networks or Distributed Hash Tables (DHTs) are distributed systems optimized for storage and retrieval of read-only data. In this paper we elaborate...
Data Warehousing for INventory management DWIN is a production project at Telcordia aimed at providing telecommunications service providers with decision support functions for i...
: Simplifying data programming is a core mission of data management research. The issue at stake is to help engineers build efficient and robust data-centric applications. The fron...
Privacy-preserving data mining has concentrated on obtaining valid results when the input data is private. An extreme example is Secure Multiparty Computation-based methods, where...