785 search results - page 37 / 157 » Efficient Processing of Top-k Queries in Uncertain Databases |
ADBIS
1998
Springer
14 years 1 months ago
1998
Springer
In order to answer efficiently range queries in 2-d R-trees, first we sort queries by means of a space filling curve, then we group them together, and finally pass them for process...
IS
2007
13 years 8 months ago
2007
Despite the importance of ranked queries in numerous applications involving multi-criteria decision making, they are not efficiently supported by traditional database systems. In ...
SIGMOD
2002
ACM
14 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...
ICDE
2008
IEEE
14 years 10 months ago
2008
IEEE
Text documents often embed data that is structured in nature, and we can expose this structured data using information extraction technology. By processing a text database with inf...
PARLE
1993
14 years 27 days ago
1993
: Parallel database systems aim at providing high throughput for OLTP transactions as well as short response times for complex and data-intensive queries. Shared nothing systems re...