17541 search results - page 3265 / 3509 » Complexity in scalable computing |
170
Voted
ICALP
2009
Springer
16 years 4 months ago
2009
Springer
The central goal of data stream algorithms is to process massive streams of data using sublinear storage space. Motivated by work in the database community on outsourcing database...
232
click to vote
VLDB
2007
ACM
16 years 4 months ago
2007
ACM
The growing nature of databases, and the flexibility inherent in the SQL query language that allows arbitrarily complex formulations, can result in queries that take inordinate am...
219
Voted
SIGMOD
2009
ACM
16 years 4 months ago
2009
ACM
In the rank join problem we are given a relational join R1 1 R2 and a function that assigns numeric scores to the join tuples, and the goal is to return the tuples with the highes...
184
Voted
SIGMOD
2004
ACM
16 years 4 months ago
2004
ACM
Virtually every commercial query optimizer chooses the best plan for a query using a cost model that relies heavily on accurate cardinality estimation. Cardinality estimation erro...
160
click to vote
PODS
2005
ACM
16 years 4 months ago
2005
ACM
Suppose we have a large table T of items i, each with a weight wi, e.g., people and their salary. In a general preprocessing step for estimating arbitrary subset sums, we assign e...