1007 search results - page 123 / 202 » Worst-Case Optimal Algorithms for Parallel Query Processing |
130
Voted
SIGMOD
2002
ACM
16 years 2 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...
119
Voted
GECCO
2007
Springer
15 years 8 months ago
2007
Springer
This paper describes the application of evolutionary search to the problem of Flash memory wear-out. The operating parameters of Flash memory are notoriously difficult to determin...
118
Voted
ICDCS
2009
IEEE
15 years 11 months ago
2009
IEEE
Spatial alarms are considered as one of the basic capabilities in future mobile computing systems for enabling personalization of location-based services. In this paper, we propos...
146
Voted
CIKM
2010
Springer
15 years 18 days ago
2010
Springer
Search nodes are single-purpose components of large Web search engines and their efficient implementation is critical to sustain thousands of queries per second and guarantee indi...
127
Voted
WWW
2007
ACM
16 years 3 months ago
2007
ACM
As XML database sizes grow, the amount of space used for storing the data and auxiliary data structures becomes a major factor in query and update performance. This paper presents...