613 search results - page 62 / 123 » Query Evaluation on a Database Given by a Random Graph |
119
Voted
VLDB
1994
ACM
15 years 7 months ago
1994
ACM
Index structures for multiple sets can be classified into those that group entries according to their key values and those that group entries according to their set membership. Th...
94
Voted
EDBT
2009
ACM
15 years 10 months ago
2009
ACM
Given a set Q of keywords, conventional keyword search (KS) returns a set of tuples, each of which (i) is obtained from a single relation, or by joining multiple relations, and (i...
142
Voted
WEBI
2005
Springer
15 years 9 months ago
2005
Springer
This work presents a new perspective on characterizing the similarity between elements of a database or, more generally, nodes of a weighted, undirected, graph. It is based on a M...
230
Voted
SIGMOD
2009
ACM
16 years 3 months ago
2009
ACM
An approximate search query on a collection of strings finds those strings in the collection that are similar to a given query string, where similarity is defined using a given si...
119
Voted
SIGIR
1998
ACM
15 years 7 months ago
1998
ACM
This paper addresses the problem of topic distillation on the World Wide Web, namely, given a typical user query to find quality documents related to the query topic. Connectivity...