619 search results - page 52 / 124 » Query Planning in Infomaster |
122
click to vote
DKE
2006
15 years 2 months ago
2006
The K-Closest-Pairs Query (K-CPQ), a type of distance join in spatial databases, discovers the K pairs of objects formed from two different datasets with the K smallest distances....
232
Voted
ICDE
2001
IEEE
16 years 3 months ago
2001
IEEE
Semi-join reducers were introduced in the late seventies as a means to reduce the communication costs of distributed database systems. Subsequent work in the eighties showed, howe...
120
click to vote
VLDB
2005
ACM
15 years 7 months ago
2005
ACM
We present DITN, a new method of parallel querying based on dynamic outsourcing of join processing tasks to non-dedicated, heterogeneous computers. In DITN, partitioning is not th...
142
click to vote
EDBTW
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. Peer-to-peer (P2P) computing is currently attracting enormous attention. In P2P systems a very large number of autonomous computing nodes (the peers) pool together their ...
108
click to vote
ISRR
2001
Springer
15 years 6 months ago
2001
Springer
This paper describes the foundations and algorithms of a new probabilistic roadmap (PRM) planner that is: (1) singlequery –i.e., it does not pre-compute a roadmap, but uses the ...