Sciweavers

1221 search results - page 92 / 245
» Balanced graph partitioning
Sort
View
ICDE
2010
IEEE
201views Database» more  ICDE 2010»
13 years 9 months ago
Vertical partitioning of relational OLTP databases using integer programming
A way to optimize performance of relational row store databases is to reduce the row widths by vertically partitioning tables into table fractions in order to minimize the number ...
Rasmus Resen Amossen
SPAA
2005
ACM
14 years 2 months ago
The expansion and mixing time of skip graphs with applications
We prove that with high probability a skip graph contains a 4-regular expander as a subgraph, and estimate the quality of the expansion via simulations. As a consequence skip grap...
James Aspnes, Udi Wieder
PE
2011
Springer
167views Optimization» more  PE 2011»
13 years 3 months ago
Passage-time computation and aggregation strategies for large semi-Markov processes
High-level semi-Markov modelling paradigms such as semi-Markov stochastic Petri nets and process algebras are used to capture realistic performance models of computer and communic...
Marcel C. Guenther, Nicholas J. Dingle, Jeremy T. ...
ISPASS
2005
IEEE
14 years 2 months ago
Partitioning Multi-Threaded Processors with a Large Number of Threads
Today’s general-purpose processors are increasingly using multithreading in order to better leverage the additional on-chip real estate available with each technology generation...
Ali El-Moursy, Rajeev Garg, David H. Albonesi, San...
SIGMOD
2012
ACM
253views Database» more  SIGMOD 2012»
11 years 11 months ago
Skew-aware automatic database partitioning in shared-nothing, parallel OLTP systems
The advent of affordable, shared-nothing computing systems portends a new class of parallel database management systems (DBMS) for on-line transaction processing (OLTP) applicatio...
Andrew Pavlo, Carlo Curino, Stanley B. Zdonik