613 search results - page 9 / 123 » Query Evaluation on a Database Given by a Random Graph |
ALT
2007
Springer
15 years 6 months ago
2007
Springer
We consider the problem of learning and verifying hidden graphs and their properties given query access to the graphs. We analyze various queries (edge detection, edge counting, sh...
SIGMOD
2002
ACM
15 years 9 months ago
2002
ACM
Time-parameterized queries (TP queries for short) retrieve (i) the actual result at the time that the query is issued, (ii) the validity period of the result given the current mot...
90
Voted
STOC
2006
ACM
15 years 9 months ago
2006
ACM
Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexi...
122
click to vote
PSD
2004
Springer
15 years 2 months ago
2004
Springer
In an on-line statistical database, the query-answering system should prevent answers to statistical queries from leading to disclosure of confidential data. On the other hand, a s...
181
click to vote
ICDE
2003
IEEE
15 years 10 months ago
2003
IEEE
XKeyword provides efficient keyword proximity queries on large XML graph databases. A query is simply a list of keywords and does not require any schema or query language knowledg...