1007 search results - page 87 / 202 » Worst-Case Optimal Algorithms for Parallel Query Processing |
133
click to vote
IDEAS
2006
IEEE
15 years 9 months ago
2006
IEEE
In this paper, we present SURCH, a novel decentralized algorithm for efficient processing of queries generated in sensor networks. Unlike existing techniques, SURCH is fully dist...
142
click to vote
VLDB
1989
ACM
15 years 7 months ago
1989
ACM
An Event-Join combinestemporaljoin and outerjoin properties into a single operation. It is mostly used to group temporal attributes of an entity into a single relation. In this pa...
121
click to vote
CIKM
2009
Springer
15 years 9 months ago
2009
Springer
This paper proposes a strategy to reduce the amount of hardware involved in the solution of search engine queries. It proposes using a secondary compact cache that keeps minimal i...
139
click to vote
IPPS
2009
IEEE
15 years 9 months ago
2009
IEEE
—We consider a scheduling problem in which a bounded number of jobs can be processed simultaneously by a single machine. The input is a set of n jobs J = {J1, . . . , Jn}. Each j...
130
click to vote
EDBT
2006
ACM
16 years 3 months ago
2006
ACM
Abstract. Many different index structures have been proposed for spatial databases to support efficient query processing. However, most of these index structures suffer from an exp...