1007 search results - page 42 / 202 » Worst-Case Optimal Algorithms for Parallel Query Processing |
225
Voted
SIGMOD
2011
ACM
14 years 5 months ago
2011
ACM
We present the design, implementation, and evaluation of ArrayStore, a new storage manager for complex, parallel array processing. ArrayStore builds on prior work in the area of m...
120
click to vote
IDEAS
2005
IEEE
15 years 8 months ago
2005
IEEE
Adaptive operator scheduling algorithms for continuous query processing are usually designed to serve a single performance objective, such as minimizing memory usage or maximizing...
134
click to vote
EDBT
2008
ACM
16 years 2 months ago
2008
ACM
Many systems such as Tukwila and YFilter combine automaton and algebra techniques to process queries over tokenized XML streams. Typically in this architecture, an automaton is fi...
121
click to vote
PODS
2005
ACM
16 years 2 months ago
2005
ACM
In sensor networks, data acquisition frequently takes place at lowcapability devices. The acquired data is then transmitted through a hierarchy of nodes having progressively incre...
VLDB
1998
ACM
15 years 6 months ago
1998
ACM
: Structural queries constitute a special form of content-basedretrieval where the user specifiesa set of spatial constraints among query variables and asks for all configurations ...