356 search results - page 16 / 72 » Robust and efficient algorithms for rank join evaluation |
216
click to vote
ICDE
2003
IEEE
16 years 3 months ago
2003
IEEE
Structural join operations are central to evaluating queries against XML data, and are typically responsible for consuming a lion's share of the query processing time. Thus, ...
WWW
2004
ACM
16 years 2 months ago
2004
ACM
Maximizing only the relevance between queries and documents will not satisfy users if they want the top search results to present a wide coverage of topics by a few representative...
120
click to vote
COOPIS
2002
IEEE
15 years 6 months ago
2002
IEEE
: This work investigates the integration of heterogeneous resources, such as data and programs, in a fully distributed peer-to-peer mediation architecture. The challenge in making ...
121
click to vote
DKE
2006
15 years 1 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....
114
Voted
WWW
2005
ACM
16 years 2 months ago
2005
ACM
Finding all the occurrences of a twig pattern in an XML database is a core operation for efficient evaluation of XML queries. A number of algorithms have been proposed to process ...