Sciweavers

1937 search results - page 230 / 388
» Conditioning Probabilistic Databases
Sort
View
DEXA
2003
Springer
149views Database» more  DEXA 2003»
15 years 4 months ago
Capturing Uncertainty in Spatial Queries over Imprecise Data
Emerging applications using miniature electronic devices (e.g., tracking mobile objects using sensors) generate very large amounts of highly dynamic data that poses very high overh...
Xingbo Yu, Sharad Mehrotra
SSDBM
2010
IEEE
188views Database» more  SSDBM 2010»
15 years 4 months ago
Similarity Estimation Using Bayes Ensembles
Similarity search and data mining often rely on distance or similarity functions in order to provide meaningful results and semantically meaningful patterns. However, standard dist...
Tobias Emrich, Franz Graf, Hans-Peter Kriegel, Mat...
IDEAS
2000
IEEE
96views Database» more  IDEAS 2000»
15 years 3 months ago
A Cost Function for Uniformly Partitioned UB-Trees
Most operations of the relational algebra or SQL - like projection with duplicate elimination, join, ordering, group by and aggregations - are efficiently processed using a sorted...
Volker Markl, Rudolf Bayer
PODS
2000
ACM
146views Database» more  PODS 2000»
15 years 3 months ago
Analysis and Application of Adaptive Sampling
An estimation algorithm for a query is a probabilistic algorithm that computes an approximation for the size (number of tuples) of the query. One class of estimation algorithms us...
James F. Lynch
PODS
1998
ACM
152views Database» more  PODS 1998»
15 years 3 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