610 search results - page 88 / 122 » Efficient Query Evaluation on Probabilistic Databases |
192
Voted
SIGMOD
2007
ACM
16 years 25 days ago
2007
ACM
An emerging challenge in modern distributed querying is to efficiently process multiple continuous aggregation queries simultaneously. Processing each query independently may be i...
106
Voted
SIGMOD
1998
ACM
15 years 4 months ago
1998
ACM
For an increasing number of modern database applications, efficient support of similarity search becomes an important task. Along with the complexity of the objects such as images...
200
Voted
ICDE
2003
IEEE
16 years 2 months ago
2003
IEEE
Structural join operations are central to evaluating queries against XML data, and are typically responsible for consuming a lion's share of the query processing time. Thus, ...
114
click to vote
SIGMOD
2002
ACM
16 years 25 days ago
2002
ACM
This paper addresses the problem of evaluating ranked top-? queries with expensive predicates. As major DBMSs now all support expensive user-defined predicates for Boolean queries...
188
Voted
SIGMOD
2008
ACM
16 years 25 days ago
2008
ACM
A variety of web sites and web based services produce textual lists at varying time granularities ranked according to several criteria. For example, Google Trends produces lists o...