610 search results - page 88 / 122 » Efficient Query Evaluation on Probabilistic Databases |
166
click to vote
SIGMOD
2007
ACM
15 years 10 months 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...
SIGMOD
1998
ACM
15 years 2 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...
168
click to vote
ICDE
2003
IEEE
15 years 11 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, ...
SIGMOD
2002
ACM
15 years 10 months 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...
166
Voted
SIGMOD
2008
ACM
15 years 10 months 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...