Sciweavers

197 search results - page 14 / 40
» Efficiently approximating query optimizer plan diagrams
Sort
View
SIGMOD
2009
ACM
202views Database» more  SIGMOD 2009»
14 years 7 months ago
ZStream: a cost-based query processor for adaptively detecting composite events
Composite (or Complex) event processing (CEP) systems search sequences of incoming events for occurrences of userspecified event patterns. Recently, they have gained more attentio...
Yuan Mei, Samuel Madden
AGI
2008
13 years 9 months ago
A computational approximation to the AIXI model
Universal induction solves in principle the problem of choosing a prior to achieve optimal inductive inference. The AIXI theory, which combines control theory and universal induct...
Sergey Pankov
ICDE
2007
IEEE
124views Database» more  ICDE 2007»
14 years 8 months ago
On MBR Approximation of Histories for Historical Queries: Expectations and Limitations
Traditional approaches for efficiently processing historical queries, where a history is a multidimensional timeseries, employ a two step filter-and-refine scheme. In the filter s...
Reza Sherkat, Davood Rafiei
SODA
2004
ACM
137views Algorithms» more  SODA 2004»
13 years 9 months ago
The Bloomier filter: an efficient data structure for static support lookup tables
We introduce the Bloomier filter, a data structure for compactly encoding a function with static support in order to support approximate evaluation queries. Our construction gener...
Bernard Chazelle, Joe Kilian, Ronitt Rubinfeld, Ay...
EDBT
2000
ACM
13 years 12 months ago
Spatial Distributions Server Based on Linear Quadtree
The paper presents Spatial Distributions Server – an analytical tool aimed at efficient creation, storing and analyzing of spatial distributions. Methods of approximation of spat...
Piotr Bajerski