78 search results - page 15 / 16 » Finding Top-k Approximate Answers to Path Queries |
WWW
2009
ACM
14 years 5 months ago
2009
ACM
Traditional information systems return answers after a user submits a complete query. Users often feel "left in the dark" when they have limited knowledge about the unde...
ICDE
2009
IEEE
14 years 6 months ago
2009
IEEE
A common approach to performing keyword search over relational databases is to find the minimum Steiner trees in database graphs. These methods, however, are rather expensive as th...
EMNLP
2008
13 years 6 months ago
2008
Most Web-based Q/A systems work by finding pages that contain an explicit answer to a question. These systems are helpless if the answer has to be inferred from multiple sentences...
WWW
2008
ACM
14 years 5 months ago
2008
ACM
Because of the high volume and unpredictable arrival rate, stream processing systems may not always be able to keep up with the input data streams-- resulting in buffer overflow a...
PODS
2006
ACM
14 years 4 months ago
2006
ACM
Skew is prevalent in data streams, and should be taken into account by algorithms that analyze the data. The problem of finding "biased quantiles"-- that is, approximate...