1007 search results - page 53 / 202 » Worst-Case Optimal Algorithms for Parallel Query Processing |
129
click to vote
PPSN
1998
Springer
15 years 6 months ago
1998
Springer
The production of specimen for microsystems or microcomponents is both, time and material-consuming. In a traditional design process the number of possible variations which can be ...
111
click to vote
CIKM
2007
Springer
15 years 8 months ago
2007
Springer
We present a general method of parallel query processing that allows scalable performance on distributed inverted files. The method allows the realization of a hybrid that combin...
95
Voted
WWW
2006
ACM
16 years 3 months ago
2006
ACM
Current web search engines are retrospective in that they limit users to searches against already existing pages. Prospective search engines, on the other hand, allow users to upl...
132
click to vote
IPPS
2009
IEEE
15 years 9 months ago
2009
IEEE
Graph-theoretic abstractions are extensively used to analyze massive data sets. Temporal data streams from socioeconomic interactions, social networking web sites, communication t...
138
Voted
CIKM
2005
Springer
15 years 8 months ago
2005
Springer
Modern query optimizers select an efficient join ordering for a physical execution plan based essentially on the average join selectivity factors among the referenced tables. In ...