Sciweavers

116 search results - page 9 / 24
» Measuring the Complexity of Join Enumeration in Query Optimi...
Sort
View
PVLDB
2010
85views more  PVLDB 2010»
14 years 10 months ago
Xplus: A SQL-Tuning-Aware Query Optimizer
The need to improve a suboptimal execution plan picked by the query optimizer for a repeatedly run SQL query arises routinely. Complex expressions, skewed or correlated data, and ...
Herodotos Herodotou, Shivnath Babu
SIGMOD
2007
ACM
136views Database» more  SIGMOD 2007»
15 years 11 months ago
Progressive optimization in a shared-nothing parallel database
Commercial enterprise data warehouses are typically implemented on parallel databases due to the inherent scalability and performance limitation of a serial architecture. Queries ...
Wook-Shin Han, Jack Ng, Volker Markl, Holger Kache...
126
Voted
SIGMOD
2003
ACM
161views Database» more  SIGMOD 2003»
15 years 11 months ago
Approximate Join Processing Over Data Streams
We consider the problem of approximating sliding window joins over data streams in a data stream processing system with limited resources. In our model, we deal with resource cons...
Abhinandan Das, Johannes Gehrke, Mirek Riedewald
CORR
2000
Springer
91views Education» more  CORR 2000»
14 years 11 months ago
Algorithmic Theories of Everything
The probability distribution P from which the history of our universe is sampled represents a theory of everything or TOE. We assume P is formally describable. Since most (uncount...
Jürgen Schmidhuber
GIS
1995
ACM
15 years 3 months ago
Measuring the Complexity of Polygonal Objects
Polygonal objects are characterized by the following well-known parameters: number of vertices, area, perimeter and so on. These parameters describe the data sets that are used in...
Thomas Brinkhoff, Hans-Peter Kriegel, Ralf Schneid...