Given a user-specified minimum correlation threshold and a market basket database with N items and T transactions, an all-strong-pairs correlation query finds all item pairs with...
When a digital library is decomposed into many geographically distributed repositories,searchefficiencybecomesan issue. Increasing network congestion makes this a compelling issue...
James C. French, Allison L. Powell, Walter R. Crei...
SALSA is a link-based ranking algorithm that takes the result set of a query as input, extends the set to include additional neighboring documents in the web graph, and performs a...
We give the first algorithm that is both query-efficient and time-efficient for testing whether an unknown function f : {0, 1}n {-1, 1} is an s-sparse GF(2) polynomial versus -far ...
Ilias Diakonikolas, Homin K. Lee, Kevin Matulef, R...
This paper presents a parallel algorithm for recursive query processing and shows how it can be efficiently implemented in a local computer network. The algorithm relies on an int...