631 search results - page 79 / 127 » Answering relationship queries on the web |
SIGCOMM
2009
ACM
15 years 6 months ago
2009
ACM
To search the web quickly, search engines partition the web index over many machines, and consult every partition when answering a query. To increase throughput, replicas are adde...
ICDE
2010
IEEE
15 years 6 months ago
2010
IEEE
– Keyword search (KWS) over relational data, where the answers are multiple tuples connected via joins, has received significant attention in the past decade. Numerous solutions ...
117
click to vote
ECAI
2000
Springer
15 years 4 months ago
2000
Springer
Abstract. Defeasible reasoning is a direction in nonmonotonic reasoning that is based on the use of rules that may be defeated by other rules. It is a simple, but often more effic...
103
click to vote
ACL
2010
14 years 10 months ago
2010
Is it possible to use sense inventories to improve Web search results diversity for one word queries? To answer this question, we focus on two broad-coverage lexical resources of ...
SIGSOFT
2009
ACM
16 years 19 days ago
2009
ACM
Search computing is a novel discipline whose goal is to answer complex, multi-domain queries. Such queries typically require combining in their results domain knowledge extracted ...