4 search results - page 1 / 1 » URank: formulation and efficient evaluation of top-k queries... |
SIGMOD
2007
ACM
14 years 4 months ago
2007
ACM
Top-k processing in uncertain databases is semantically and computationally different from traditional top-k processing. The interplay between query scores and data uncertainty ma...
ICDE
2003
IEEE
14 years 5 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...
ICDE
2009
IEEE
14 years 6 months ago
2009
IEEE
Large databases with uncertain information are becoming more common in many applications including data integration, location tracking, and Web search. In these applications, ranki...
EDBT
2009
ACM
13 years 11 months ago
2009
ACM
There has been an explosion of hyperlinked data in many domains, e.g., the biological Web. Expressive query languages and effective ranking techniques are required to convert this...