Sciweavers

291 search results - page 38 / 59
» Dynamic Memory Allocation for Large Query Execution
Sort
View
CIKM
2011
Springer
13 years 11 months ago
MTopS: scalable processing of continuous top-k multi-query workloads
A continuous top-k query retrieves the k most preferred objects in a data stream according to a given preference function. These queries are important for a broad spectrum of appl...
Avani Shastri, Di Yang, Elke A. Rundensteiner, Mat...
IDEAS
2005
IEEE
149views Database» more  IDEAS 2005»
15 years 5 months ago
An Adaptive Multi-Objective Scheduling Selection Framework for Continuous Query Processing
Adaptive operator scheduling algorithms for continuous query processing are usually designed to serve a single performance objective, such as minimizing memory usage or maximizing...
Timothy M. Sutherland, Yali Zhu, Luping Ding, Elke...
ICS
2007
Tsinghua U.
15 years 5 months ago
GridRod: a dynamic runtime scheduler for grid workflows
Grid Workflows are emerging as practical programming models for solving large e-scientific problems on the Grid. However, it is typically assumed that the workflow components eith...
Shahaan Ayyub, David Abramson
SIGMOD
2005
ACM
133views Database» more  SIGMOD 2005»
15 years 12 months ago
Semantics and Evaluation Techniques for Window Aggregates in Data Streams
A windowed query operator breaks a data stream into possibly overlapping subsets of data and computes results over each. Many stream systems can evaluate window aggregate queries....
Jin Li, David Maier, Kristin Tufte, Vassilis Papad...
VLDB
1995
ACM
97views Database» more  VLDB 1995»
15 years 3 months ago
Processing Object-Oriented Queries with Invertible Late Bound Functions
New demandsare put on query processing in Object-Oriented(00) databasesto provide efficient andrelationally completequery languages. A flexible 00 data model requires overloading ...
Staffan Flodin, Tore Risch