Sciweavers

439 search results - page 12 / 88
» Unnesting Arbitrary Queries
Sort
View
DASFAA
2009
IEEE
147views Database» more  DASFAA 2009»
14 years 4 months ago
SUITS: Faceted User Interface for Constructing Structured Queries from Keywords
Keyword search and database query are two ways for retrieving data in real world settings. In this demonstration, we show SUITS, a novel search interface over relational databases ...
Elena Demidova, Xuan Zhou, Gideon Zenz, Wolfgang N...
PODS
2006
ACM
121views Database» more  PODS 2006»
14 years 10 months ago
On the efficiency of checking perfect privacy
Privacy-preserving query-answering systems answer queries while provably guaranteeing that sensitive information is kept secret. One very attractive notion of privacy is perfect p...
Ashwin Machanavajjhala, Johannes Gehrke
BIOINFORMATICS
2011
13 years 1 months ago
libfbi: a C++ implementation for fast box intersection and application to sparse mass spectrometry data
Abstract. This document is a preprint of the following publication: Bioinformatics (2011) 27(8): 1166-1167. Algorithms for sparse data require fast search and subset selection capa...
Marc Kirchner, Buote Xu, Hanno Steen, Judith A. J....
CINQ
2004
Springer
118views Database» more  CINQ 2004»
14 years 3 months ago
Boolean Formulas and Frequent Sets
We consider the problem of how one can estimate the support of Boolean queries given a collection of frequent itemsets. We describe an algorithm that truncates the inclusion-exclus...
Jouni K. Seppänen, Heikki Mannila
FOCS
2010
IEEE
13 years 8 months ago
Boosting and Differential Privacy
Boosting is a general method for improving the accuracy of learning algorithms. We use boosting to construct improved privacy-preserving synopses of an input database. These are da...
Cynthia Dwork, Guy N. Rothblum, Salil P. Vadhan