Sciweavers

525 search results - page 89 / 105
» On Query Algebras for Probabilistic Databases
Sort
View
IDEAS
2005
IEEE
149views Database» more  IDEAS 2005»
14 years 1 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...
PODS
2007
ACM
225views Database» more  PODS 2007»
14 years 7 months ago
Sketching unaggregated data streams for subpopulation-size queries
IP packet streams consist of multiple interleaving IP flows. Statistical summaries of these streams, collected for different measurement periods, are used for characterization of ...
Edith Cohen, Nick G. Duffield, Haim Kaplan, Carste...
ICDE
1999
IEEE
106views Database» more  ICDE 1999»
14 years 8 months ago
Processing Operations with Restrictions in RDBMS without External Sorting: The Tetris Algorithm
Most operations of the relational algebra or SQL require a sorted stream of tuples for efficient processing. Therefore, processing complex relational queries relies on efficient a...
Volker Markl, Martin Zirkel, Rudolf Bayer
CIDR
2009
98views Algorithms» more  CIDR 2009»
13 years 8 months ago
From Declarative Languages to Declarative Processing in Computer Games
Recent work has shown that we can dramatically improve the performance of computer games and simulations through declarative processing: Character AI can be written in an imperati...
Ben Sowell, Alan J. Demers, Johannes Gehrke, Nitin...
EDBT
2009
ACM
162views Database» more  EDBT 2009»
14 years 2 months ago
A data model for trip planning in multimodal transportation systems
This paper introduces the problem of modeling urban transportation systems in a database where certain aspects of the data are probabilistic in nature. The transportation network ...
Joel Booth, A. Prasad Sistla, Ouri Wolfson, Isabel...