1007 search results - page 99 / 202 » Worst-Case Optimal Algorithms for Parallel Query Processing |
238
Voted
GIS
2006
ACM
16 years 3 months ago
2006
ACM
Given a query point and a collection of spatial features, a multi-type nearest neighbor (MTNN) query finds the shortest tour for the query point such that only one instance of eac...
144
Voted
HPDC
2008
IEEE
15 years 9 months ago
2008
IEEE
If the model of free-form queries, which has proved successful for HTML based search on the Web, is made available for Grid services, it will serve as a powerful tool for scientis...
116
Voted
PODS
2008
ACM
16 years 2 months ago
2008
ACM
In the rank join problem, we are given a set of relations and a scoring function, and the goal is to return the join results with the top K scores. It is often the case in practic...
132
Voted
INFOCOM
2008
IEEE
15 years 9 months ago
2008
IEEE
Abstract—Recent advances in computer technology and wireless communications have enabled the emergence of stream-based sensor networks. In such sensor networks, real-time data ar...
103
Voted
VLDB
1998
ACM
15 years 7 months ago
1998
ACM
The problem of finding an optimal bipartition of a rectangle set has a direct impact on query performance of dynamic R-trees. During update operations, overflowed nodes need to be...