42 search results - page 3 / 9 » A unified approach to ranking in probabilistic databases |
SIGMOD
2009
ACM
14 years 5 months ago
2009
ACM
Ranking queries are essential tools to process large amounts of probabilistic data that encode exponentially many possible deterministic instances. In many applications where unce...
EDBT
2009
ACM
14 years 4 days ago
2009
ACM
Twig queries have been extensively studied as a major fragment of XPATH queries to query XML data. In this paper, we study PXMLRANK query, (Q, k), which is to rank top-k probabili...
SCCC
1997
IEEE
13 years 9 months ago
1997
IEEE
A cooperative database allows the user to specify approximate or vague query conditions. A vague query requires the database system to rank the retrieved answers according to thei...
TKDE
2010
13 years 3 months ago
2010
—Recently, many new applications, such as sensor data monitoring and mobile device tracking, raise up the issue of uncertain data management. Compared to “certain” data, the ...
ICDE
2007
IEEE
13 years 11 months ago
2007
IEEE
To better serve users’ information needs without requiring comprehensive queries from users, a simple yet effective technique is to explore the preferences of users. Since these...