34170 search results - page 6270 / 6834 » Optimization |
215
click to vote
ICALP
2009
Springer
16 years 7 months ago
2009
Springer
We initiate the study of sublinear-time algorithms in the external memory model [14]. In this model, the data is stored in blocks of a certain size B, and the algorithm is charged...
241
click to vote
ICALP
2009
Springer
16 years 7 months ago
2009
Springer
We develop new structural results for apex-minor-free graphs and show their power by developing two new approximation algorithms. The first is an additive approximation for colorin...
302
click to vote
VLDB
2002
ACM
16 years 7 months ago
2002
ACM
Relational database systems have traditionally optimized for I/O performance and organized records sequentially on disk pages using the N-ary Storage Model (NSM) (a.k.a., slotted ...
298
click to vote
VLDB
2004
ACM
16 years 7 months ago
2004
ACM
Ranking queries produce results that are ordered on some computed score. Typically, these queries involve joins, where users are usually interested only in the top-k join results....
347
Voted
VLDB
2005
ACM
16 years 7 months ago
2005
ACM
Estimating the selectivity of multidimensional range queries over real valued attributes has significant applications in data exploration and database query optimization. In this p...