1168 search results - page 163 / 234 » Optimization strategies for complex queries |
147
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
We study the computational complexity of some central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs. O...
146
click to vote
SIGMOD
1999
ACM
15 years 10 months ago
1999
ACM
Pre-computation and materialization of views with aggregate functions is a common technique in Data Warehouses. Due to the complex structure of the warehouse and the different pro...
197
click to vote
FOCS
2009
IEEE
16 years 11 days ago
2009
IEEE
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
180
click to vote
INFOCOM
2006
IEEE
15 years 11 months ago
2006
IEEE
Abstract— A bloom filter is a simple, space-efficient, randomized data structure for concisely representing a static data set, in order to support approximate membership querie...
175
click to vote
PDP
2010
IEEE
15 years 10 months ago
2010
IEEE
The increasing numbers of cores, shared caches and memory nodes within machines introduces a complex hardware topology. High-performance computing applications now have to carefull...