Sciweavers

2853 search results - page 157 / 571
» On the Efficiency of Provenance Queries
Sort
View
KDD
2004
ACM
134views Data Mining» more  KDD 2004»
16 years 6 months ago
Exploiting a support-based upper bound of Pearson's correlation coefficient for efficiently identifying strongly correlated pair
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...
Hui Xiong, Shashi Shekhar, Pang-Ning Tan, Vipin Ku...
DL
1998
Springer
113views Digital Library» more  DL 1998»
15 years 10 months ago
Efficient Searching in Distributed Digital Libraries
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...
CIKM
2008
Springer
15 years 8 months ago
Efficient and effective link analysis with precomputed salsa maps
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...
Marc Najork, Nick Craswell
CORR
2008
Springer
84views Education» more  CORR 2008»
15 years 6 months ago
Efficiently Testing Sparse GF(2) Polynomials
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...
VLDB
1989
ACM
155views Database» more  VLDB 1989»
15 years 10 months ago
Parallel Processing of Recursive Queries in Distributed Architectures
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...
Guy Hulin