Sciweavers

4747 search results - page 837 / 950
» Shuffle Memory System
Sort
View
PPOPP
2009
ACM
15 years 11 months ago
Turbocharging boosted transactions or: how i learnt to stop worrying and love longer transactions
Boosted transactions offer an attractive method that enables programmers to create larger transactions that scale well and offer deadlock-free guarantees. However, as boosted tran...
Chinmay Eishan Kulkarni, Osman S. Unsal, Adri&aacu...
ICCS
2009
Springer
15 years 11 months ago
GRID Resource Searching on the GridSim Simulator
Nowadays, the Grid is the focus of multiple researches. Our work is centered on Resource Management for Grids as it is an opened and current research area. Decentralized, scalable ...
Antonia Gallardo, Luis Díaz de Cerio, Roc M...
MMMACNS
2001
Springer
15 years 10 months ago
Typed MSR: Syntax and Examples
Abstract. Many design flaws and incorrect analyses of cryptographic protoAppeared in the Proceedings of the First International Workshop on Mathematical Methods, Models and Archit...
Iliano Cervesato
VLDB
2001
ACM
121views Database» more  VLDB 2001»
15 years 10 months ago
Weaving Relations for Cache Performance
Relational database systems have traditionally optimzed for I/O performance and organized records sequentially on disk pages using the N-ary Storage Model (NSM) (a.k.a., slotted p...
Anastassia Ailamaki, David J. DeWitt, Mark D. Hill...
IDEAS
2000
IEEE
96views Database» more  IDEAS 2000»
15 years 10 months ago
A Cost Function for Uniformly Partitioned UB-Trees
Most operations of the relational algebra or SQL - like projection with duplicate elimination, join, ordering, group by and aggregations - are efficiently processed using a sorted...
Volker Markl, Rudolf Bayer