• Publications
  • Influence
Placing search in context: the concept revisited
TLDR
A new conceptual paradigm for performing search in context is presented, that largely automates the search process, providing even non-professional users with highly relevant results.
The space complexity of approximating the frequency moments
TLDR
It turns out that the numbers F0;F1 and F2 can be approximated in logarithmic space, whereas the approximation of Fk for k 6 requires n (1) space.
Spectral bloom filters
TLDR
The Spectral Bloom Filter is introduced, an extension of the original Bloom Filter to multi-sets, allowing the filtering of elements whose multiplicities are below a threshold given at query time.
Tracking join and self-join sizes in limited storage
TLDR
This paper presents a join signature scheme based on tug-ofwar signatures that probvides guarantees on join size estimation as a function of t:he self-join sizes of the joining relations; this scheme can significantly improve upon the sampling scheme.
Wavelet-based histograms for selectivity estimation
TLDR
This paper presents a technique based upon a multiresolution wavelet decomposition for building histograms on the underlying data distributions, with applications to databases, statistics, and simulation.
New sampling-based summary statistics for improving approximate query answers
TLDR
This paper introduces two new sampling-based summary statistics, concise samples and counting samples, and presents new techniques for their fast incremental maintenance regardless of the data distribution, and considers their application to providing fast approximate answers to hot list queries.
Placing search in context: the concept revisited
TLDR
A new conceptual paradigm for performing search in context is presented, that largely automates the search process, providing even non-professional users with highly relevant results.
Suggesting friends using the implicit social graph
TLDR
The implicit social graph which is formed by users' interactions with contacts and groups of contacts, and which is distinct from explicit social graphs in which users explicitly add other individuals as their "friends" is described.
Scheduling space-sharing for internet advertising
TLDR
This paper provides an efficient algorithm that finds the optimal solution to a restricted version of the new bin packing problem and obtains a 2-approximation to the problem of minimizing the space requirements of a given set of ads, as well as of determining the best subset of the ads that can be scheduled with a given space constraint.
Fast incremental maintenance of approximate histograms
TLDR
By scheduling updates to the histogram based on the Updates to the database, these techniques are the first to maintain histograms effectively up to date at all times and avoid computing overheads when unnecessary.
...
...