1007 search results - page 45 / 202 » Worst-Case Optimal Algorithms for Parallel Query Processing |
131
click to vote
ADC
2003
Springer
15 years 7 months ago
2003
Springer
Selectivity estimation of queries not only provides useful information to the query processing optimization but also may give users a preview of processing results. In this paper,...
131
click to vote
IPPS
2007
IEEE
15 years 8 months ago
2007
IEEE
We study efficient query processing in distributed web search engines with global index organization. The main performance bottleneck in this case is due to the large amount of i...
106
Voted
SIGMOD
2010
ACM
15 years 7 months ago
2010
ACM
Parameterized queries are commonly used in database applications. In a parameterized query, the same SQL statement is potentially executed multiple times with different parameter ...
134
click to vote
DASFAA
2007
IEEE
15 years 8 months ago
2007
IEEE
With the increasing in demand on location-based aware services and RFIDs, efficient processing of continuous queries over moving object streams becomes important. In this paper, w...
116
click to vote
ICDE
2007
IEEE
15 years 8 months ago
2007
IEEE
Main memory is a critical resource when processing non-blocking queries with state intensive operators that require real-time responses. While partitioned parallel processing can ...