Sciweavers

203 search results - page 27 / 41
» An O(nlogn) time algorithm for optimal buffer insertion
Sort
View
DASFAA
2010
IEEE
141views Database» more  DASFAA 2010»
14 years 1 months ago
Optimizing Write Performance for Read Optimized Databases
Compression in column-oriented databases has been proven to offer both performance enhancements and reductions in storage consumption. This is especially true for read access as c...
Jens Krüger, Martin Grund, Christian Tinnefel...
ICDE
1996
IEEE
103views Database» more  ICDE 1996»
14 years 8 months ago
Using Partial Differencing for Efficient Monitoring of Deferred Complex Rule Conditions
This paper presents a difference calculus for determining changes to rule conditions in an active DBMS. The calculus has been used for implementing an algorithm to efficiently mon...
Martin Sköld, Tore Risch
SODA
2012
ACM
174views Algorithms» more  SODA 2012»
11 years 9 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
CIKM
2009
Springer
13 years 11 months ago
RS-Wrapper: random write optimization for solid state drive
Solid State Drive (SSD), emerging as new data storage media with high random read speed, has been widely used in laptops, desktops, and data servers to replace hard disk during th...
Da Zhou, Xiaofeng Meng
ALGORITHMICA
2008
95views more  ALGORITHMICA 2008»
13 years 6 months ago
Optimality in External Memory Hashing
Hash tables on external memory are commonly used for indexing in database management systems. In this paper we present an algorithm that, in an asymptotic sense, achieves the best...
Morten Skaarup Jensen, Rasmus Pagh