Sciweavers

23 search results - page 4 / 5
» Sorting and Searching in Faulty Memories
Sort
View
SIGMOD
2009
ACM
213views Database» more  SIGMOD 2009»
14 years 7 months ago
Dictionary-based order-preserving string compression for main memory column stores
Column-oriented database systems [19, 23] perform better than traditional row-oriented database systems on analytical workloads such as those found in decision support and busines...
Carsten Binnig, Stefan Hildenbrand, Franz Fär...
SIGMETRICS
2004
ACM
106views Hardware» more  SIGMETRICS 2004»
14 years 23 days ago
Performance analysis of BSTs in system software
Binary search tree (BST) based data structures, such as AVL trees, red-black trees, and splay trees, are often used in system software, such as operating system kernels. Choosing ...
Ben Pfaff
CRYPTO
2010
Springer
157views Cryptology» more  CRYPTO 2010»
13 years 8 months ago
Oblivious RAM Revisited
We reinvestigate the oblivious RAM concept introduced by Goldreich and Ostrovsky, which enables a client, that can store locally only a constant amount of data, to store remotely ...
Benny Pinkas, Tzachy Reinman
ICDT
2001
ACM
124views Database» more  ICDT 2001»
13 years 11 months ago
Mining for Empty Rectangles in Large Data Sets
Abstract. Many data mining approaches focus on the discovery of similar (and frequent) data values in large data sets. We present an alternative, but complementary approach in whic...
Jeff Edmonds, Jarek Gryz, Dongming Liang, Ren&eacu...

Book
747views
15 years 3 months ago
Data Structures and Algorithms with Object-Oriented Design Patterns in C++
"This book is about the fundamentals of data structures and algorithms--the basic elements from which large and complex software artifacts are built. To develop a solid unders...
Bruno R. Preiss