Sciweavers

735 search results - page 63 / 147
» Evaluating Probabilistic Queries over Imprecise Data
Sort
View
EDBT
2002
ACM
141views Database» more  EDBT 2002»
16 years 10 hour ago
Efficient OLAP Query Processing in Distributed Data Warehouses
Abstract. The success of Internet applications has led to an explosive growth in the demand for bandwidth from ISPs. Managing an IP network requires collecting and analyzing networ...
Michael O. Akinde, Michael H. Böhlen, Theodor...
SSDBM
2008
IEEE
131views Database» more  SSDBM 2008»
15 years 6 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...
WADS
1989
Springer
84views Algorithms» more  WADS 1989»
15 years 3 months ago
Skip Lists: A Probabilistic Alternative to Balanced Trees
rees can be used for representing abstract data types such as dictionaries and ordered lists. They work well when the elements are inserted in a random order. Some sequences of ope...
William Pugh
PODS
1998
ACM
152views Database» more  PODS 1998»
15 years 4 months ago
A Cost Model for Similarity Queries in Metric Spaces
We consider the problem of estimating CPU (distance computations) and I/O costs for processing range and k-nearest neighbors queries over metric spaces. Unlike the specific case ...
Paolo Ciaccia, Marco Patella, Pavel Zezula
SIGMOD
2006
ACM
150views Database» more  SIGMOD 2006»
16 years 1 days ago
On-the-fly sharing for streamed aggregation
Data streaming systems are becoming essential for monitoring applications such as financial analysis and network intrusion detection. These systems often have to process many simi...
Sailesh Krishnamurthy, Chung Wu, Michael J. Frankl...