958 search results - page 64 / 192 » Efficient data structures for range-aggregate queries on tre... |
FGCS
2000
15 years 11 days ago
2000
This paper focuses on parallel query optimization. We consider the operator problem and introduce a new class of execution strategies called Linear-Oriented Bushy Trees (LBTs). Co...
104
Voted
ISVC
2007
Springer
15 years 6 months ago
2007
Springer
Many computer graphics rendering algorithms and techniques use ray tracing for generation of natural and photo-realistic images. The efficiency of the ray tracing algorithms depend...
205
click to vote
SIGMOD
2008
ACM
16 years 21 days ago
2008
ACM
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...
174
Voted
SIGMOD
2006
ACM
16 years 21 days ago
2006
ACM
Modern scientific applications consume massive volumes of data produced by computer simulations. Such applications require new data management capabilities in order to scale to te...
110
click to vote
SDM
2010
SIAM
15 years 2 months ago
2010
SIAM
Large graph databases are commonly collected and analyzed in numerous domains. For reasons related to either space efficiency or for privacy protection (e.g., in the case of socia...