Sciweavers

2514 search results - page 249 / 503
» On the Computation of Approximations of Database Queries
Sort
View
CCGRID
2005
IEEE
16 years 9 days ago
Secret sequence comparison on public grid computing resources
Once a new gene has been sequenced, it must be verified whether or not it is similar to previously sequenced genes. In many cases, the organization that sequenced a potentially n...
Ken-ichi Kurata, Hiroshi Nakamura, Vincent Breton
EDBT
2004
ACM
142views Database» more  EDBT 2004»
16 years 2 days ago
Computing and Handling Cardinal Direction Information
Qualitative spatial reasoning forms an important part of the commonsense reasoning required for building intelligent Geographical Information Systems (GIS). Previous research has c...
Spiros Skiadopoulos, Christos Giannoukos, Panos Va...
FOCS
2004
IEEE
15 years 10 months ago
An Optimal Randomised Cell Probe Lower Bound for Approximate Nearest Neighbour Searching
We consider the approximate nearest neighbour search problem on the Hamming cube {0, 1}d. We show that a randomised cell probe algorithm that uses polynomial storage and word size...
Amit Chakrabarti, Oded Regev
PODS
2003
ACM
158views Database» more  PODS 2003»
16 years 6 months ago
Computing full disjunctions
Full disjunctions are an associative extension of the outerjoin operator to an arbitrary number of relations. Their main advantage is the ability to maximally combine data from di...
Yaron Kanza, Yehoshua Sagiv
VLDB
2004
ACM
158views Database» more  VLDB 2004»
16 years 1 days ago
REHIST: Relative Error Histogram Construction Algorithms
Histograms and Wavelet synopses provide useful tools in query optimization and approximate query answering. Traditional histogram construction algorithms, such as V-Optimal, optim...
Sudipto Guha, Kyuseok Shim, Jungchul Woo