643 search results - page 54 / 129 » Dynamic prioritization of database queries |
167
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...
177
click to vote
VLDB
2007
ACM
15 years 10 months ago
2007
ACM
This paper addresses the efficient processing of similarity queries in metric spaces, where data is horizontally distributed across a P2P network. The proposed approach does not r...
115
click to vote
DASFAA
2008
IEEE
14 years 11 months ago
2008
IEEE
An important issue arising from XML query relaxation is how to efficiently search the top-k best answers from a large number of XML data sources, while minimizing the searching cos...
156
click to vote
SEDE
2010
14 years 7 months ago
2010
Enterprise-level applications are becoming complex with the need for event and stream processing, multiple query processing and data analysis over heterogeneous data sources such ...