613 search results - page 104 / 123 » Query Evaluation on a Database Given by a Random Graph |
WEBDB
2007
Springer
15 years 6 months ago
2007
Springer
The Internet has changed the way people look for information. Users now expect the answers to their questions to be available through a simple web search. Web search engines are i...
191
click to vote
SIGMOD
2008
ACM
15 years 12 months ago
2008
ACM
Computing statistical information on probabilistic data has attracted a lot of attention recently, as the data generated from a wide range of data sources are inherently fuzzy or ...
SISAP
2008
IEEE
15 years 6 months ago
2008
IEEE
All pivot-based algorithms for similarity search use a set of reference points called pivots. The pivot-based search algorithm precomputes some distances to these reference points...
183
click to vote
ICDE
2007
IEEE
16 years 1 months ago
2007
IEEE
Recent work on distributed, in-network aggregation assumes a benign population of participants. Unfortunately, modern distributed systems are plagued by malicious participants. In...
APPROX
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. Given a directed graph G = (V, E) and an integer k 1, a ktransitive-closure-spanner (k-TC-spanner) of G is a directed graph H = (V, EH ) that has (1) the same transitive...