25167 search results - page 4904 / 5034 » Parallel and Distributed Algorithms |
138
click to vote
SIGMOD
2003
ACM
16 years 2 months ago
2003
ACM
Most relational query optimizers make use of information about the costs of accessing tuples and data structures on various storage devices. This information can at times be off b...
124
click to vote
SIGMOD
2002
ACM
16 years 2 months ago
2002
ACM
Dwarf is a highly compressed structure for computing, storing, and querying data cubes. Dwarf identifies prefix and suffix structural redundancies and factors them out by coalesci...
115
click to vote
SIGMOD
2001
ACM
16 years 2 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...
115
Voted
EDBT
2008
ACM
16 years 2 months ago
2008
ACM
Peer Data Management Systems (PDMSs) have been introduced as a solution to the problem of large-scale sharing of semantically rich data. A PDMS consists of semantic peers connecte...
122
click to vote
MOBIHOC
2007
ACM
16 years 2 months ago
2007
ACM
We address the problem of balancing the traffic load in multi-hop wireless networks. We consider a point-to-point communicating network with a uniform distribution of source-sink ...