2703 search results - page 297 / 541 » Working Class Hero |
167
click to vote
ICALP
2009
Springer
16 years 7 months ago
2009
Springer
In the interference scheduling problem, one is given a set of n communication requests described by sourcedestination pairs of nodes from a metric space. The nodes correspond to d...
159
Voted
SIGMOD
2001
ACM
16 years 6 months ago
2001
ACM
Estimating the result size of complex queries that involve selection on multiple attributes and the join of several relations is a difficult but fundamental task in database query...
192
click to vote
SIGMOD
2001
ACM
16 years 6 months ago
2001
ACM
Virtually all proposals for querying XML include a class of query we term "containment queries". It is also clear that in the foreseeable future, a substantial amount of...
178
click to vote
PODS
2002
ACM
16 years 6 months ago
2002
ACM
In multidimensional data models intended for online analytic processing (OLAP), data are viewed as points in a multidimensional space. Each dimension has structure, described by a...
190
click to vote
PODS
2008
ACM
16 years 6 months ago
2008
ACM
We revisit the classical chase procedure, studying its properties as well as its applicability to standard database problems. We settle (in the negative) the open problem of decid...