Sciweavers

48 search results - page 9 / 10
» Key Range Locking Strategies for Improved Concurrency
Sort
View
ICDE
2012
IEEE
277views Database» more  ICDE 2012»
13 years 3 days ago
Lookup Tables: Fine-Grained Partitioning for Distributed Databases
—The standard way to scale a distributed OLTP DBMS is to horizontally partition data across several nodes. Ideally, this results in each query/transaction being executed at just ...
Aubrey Tatarowicz, Carlo Curino, Evan P. C. Jones,...
85
Voted
ISCA
2010
IEEE
232views Hardware» more  ISCA 2010»
14 years 8 months ago
Evolution of thread-level parallelism in desktop applications
As the effective limits of frequency and instruction level parallelism have been reached, the strategy of microprocessor vendors has changed to increase the number of processing ...
Geoffrey Blake, Ronald G. Dreslinski, Trevor N. Mu...
VLDB
2008
ACM
110views Database» more  VLDB 2008»
15 years 10 months ago
Enhancing histograms by tree-like bucket indices
Histograms are used to summarize the contents of relations into a number of buckets for the estimation of query result sizes. Several techniques (e.g., MaxDiff and V-Optimal) have ...
Francesco Buccafurri, Gianluca Lax, Domenico SaccÃ...
TON
2010
175views more  TON 2010»
14 years 4 months ago
Cooperative Adaptive Spectrum Sharing in Cognitive Radio Networks
The cognitive radio (CR) paradigm calls for open spectrum access according to a predetermined etiquette. Under this paradigm, CR nodes access the spectrum opportunistically by cont...
Haythem Bany Salameh, Marwan Krunz, Ossama Younis
ICFP
2009
ACM
15 years 10 months ago
Causal commutative arrows and their optimization
re a popular form of abstract computation. Being more general than monads, they are more broadly applicable, and in parare a good abstraction for signal processing and dataflow co...
Hai Liu, Eric Cheng, Paul Hudak