2635 search results - page 24 / 527 » Algorithms for the Database Layout Problem |
137
click to vote
ADC
2009
Springer
15 years 9 months ago
2009
Springer
Transaction throughput is a crucial issue for database systems. Multi-level transactions have been proposed in an attempt to offer improved concurrency of transaction processing ...
131
click to vote
SPAA
2004
ACM
15 years 7 months ago
2004
ACM
This paper presents the first polylogarithmic-competitive online algorithms for two-metric network design problems. These problems arise naturally in the design of computer netwo...
135
click to vote
PPSN
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. This paper introduces a generator that creates problem instances for the Euclidean symmetric travelling salesman problem. To fit real world problems, we look at maps con...
97
Voted
IWPEC
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. We explore the effects of using graph width metrics as restrictions on the input to online problems. It seems natural to suppose that, for graphs having some form of bou...
107
click to vote
PODS
2010
ACM
15 years 7 months ago
2010
ACM
We give the first optimal algorithm for estimating the number of distinct elements in a data stream, closing a long line of theoretical research on this problem begun by Flajolet...