4198 search results - page 316 / 840 » In search of lost time |
179
click to vote
DKE
1998
15 years 6 months ago
1998
Disk I/O is a major bottleneck for query processing in database applications. This bottleneck is especially a problem for temporal databases because of their large size. Reduction...
189
click to vote
WADS
2009
Springer
16 years 1 months ago
2009
Springer
Abstract We show that if one can find the optimal value of an integer programming problem min{cx : Ax ≥ b, x ∈ Zn +} in polynomial time, then one can find an optimal solution...
215
click to vote
COMPGEOM
2005
ACM
15 years 8 months ago
2005
ACM
We present a near linear time algorithm for constructing hierarchical nets in finite metric spaces with constant doubling dimension. This data-structure is then applied to obtain...
160
click to vote
ICDE
2010
IEEE
16 years 6 months ago
2010
IEEE
Testing and debugging database software is often challenging and time consuming. A very arduous task for DB testers is finding a min-repro ? the "simplest possible setup"...
207
click to vote
IEEEPACT
2009
IEEE
16 years 1 months ago
2009
IEEE
—Analytical models have been used to estimate optimal values for parameters such as tile sizes in the context of loop nests. However, important algorithms such as fast Fourier tr...