Sciweavers

470 search results - page 85 / 94
» Privacy-Preserving Queries over Relational Databases
Sort
View
SSDBM
2005
IEEE
148views Database» more  SSDBM 2005»
14 years 2 months ago
A Fast Approximation Scheme for Probabilistic Wavelet Synopses
Several studies have demonstrated the effectiveness of Haar wavelets in reducing large amounts of data down to compact wavelet synopses that can be used to obtain fast, accurate a...
Antonios Deligiannakis, Minos N. Garofalakis, Nick...
PODS
1994
ACM
138views Database» more  PODS 1994»
14 years 20 days ago
Dyn-FO: A Parallel, Dynamic Complexity Class
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
Sushant Patnaik, Neil Immerman
DASFAA
2007
IEEE
150views Database» more  DASFAA 2007»
14 years 2 months ago
TinTO: A Tool for the View-Based Analysis of Streams of Stock Market Data
TinTO is an experimental system aiming at demonstrating the usefulness and feasibility of applying conventional SQL queries for analyzing a wide spectrum of data streams. As applic...
Andreas Behrend, Christian Dorau, Rainer Manthey
VLDB
1999
ACM
118views Database» more  VLDB 1999»
14 years 25 days ago
Similarity Search in High Dimensions via Hashing
The nearest- or near-neighbor query problems arise in a large variety of database applications, usually in the context of similarity searching. Of late, there has been increasing ...
Aristides Gionis, Piotr Indyk, Rajeev Motwani
BMCBI
2010
205views more  BMCBI 2010»
13 years 8 months ago
A fast indexing approach for protein structure comparison
Background: Protein structure comparison is a fundamental task in structural biology. While the number of known protein structures has grown rapidly over the last decade, searchin...
Lei Zhang, James Bailey, Arun Siddharth Konagurthu...