613 search results - page 73 / 123 » Query Evaluation on a Database Given by a Random Graph |
113
click to vote
SIGMOD
2012
ACM
13 years 2 months ago
2012
ACM
Query substitution is an important problem in information retrieval. Much work focuses on how to find substitutes for any given query. In this paper, we study how to efficiently ...
201
click to vote
ICDE
2003
IEEE
16 years 1 months ago
2003
IEEE
XML documents are typically queried with a combination of value search and structure search. While querying by values can leverage traditional database technologies, evaluating st...
108
click to vote
WEBDB
2005
Springer
15 years 5 months ago
2005
Springer
In recent years it has been argued that when XML encodings become complex, DOM trees are no longer adequate for query processing. Alternative representations of XML documents, suc...
116
click to vote
SIGMOD
2011
ACM
14 years 2 months ago
2011
ACM
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
106
click to vote
KDD
2010
ACM
14 years 10 months ago
2010
ACM
Assume a network (V, E) where a subset of the nodes in V are active. We consider the problem of selecting a set of k active nodes that best explain the observed activation state, ...