Sciweavers

3341 search results - page 64 / 669
» On Bounded Queries and Approximation
Sort
View
SSDBM
2008
IEEE
131views Database» more  SSDBM 2008»
15 years 4 months ago
Linked Bernoulli Synopses: Sampling along Foreign Keys
Random sampling is a popular technique for providing fast approximate query answers, especially in data warehouse environments. Compared to other types of synopses, random sampling...
Rainer Gemulla, Philipp Rösch, Wolfgang Lehne...
FAW
2009
Springer
177views Algorithms» more  FAW 2009»
15 years 4 months ago
Bounds on the Geometric Mean of Arc Lengths for Bounded-Degree Planar Graphs
Data access time becomes the main bottleneck in applications dealing with large-scale graphs. Cache-oblivious layouts, constructed to minimize the geometric mean of arc lengths of ...
Mohammad Khairul Hasan, Sung-Eui Yoon, Kyung-Yong ...
PODS
2007
ACM
108views Database» more  PODS 2007»
15 years 10 months ago
Machine models and lower bounds for query processing
This paper gives an overview of recent work on machine models for processing massive amounts of data. The main focus is on generalizations of the classical data stream model where...
Nicole Schweikardt
PODS
2009
ACM
118views Database» more  PODS 2009»
15 years 4 months ago
Size and treewidth bounds for conjunctive queries
Georg Gottlob, Stephanie Tien Lee, Gregory Valiant
LATA
2009
Springer
15 years 4 months ago
Bounded Delay and Concurrency for Earliest Query Answering
Olivier Gauwin, Joachim Niehren, Sophie Tison