Sciweavers

282 search results - page 46 / 57
» Merging Databases Under Constraints
Sort
View
STOC
2009
ACM
167views Algorithms» more  STOC 2009»
16 years 8 days ago
Universally utility-maximizing privacy mechanisms
A mechanism for releasing information about a statistical database with sensitive data must resolve a trade-off between utility and privacy. Publishing fully accurate information ...
Arpita Ghosh, Tim Roughgarden, Mukund Sundararajan
EDBT
2010
ACM
208views Database» more  EDBT 2010»
15 years 6 months ago
Stream schema: providing and exploiting static metadata for data stream processing
Schemas, and more generally metadata specifying structural and semantic constraints, are invaluable in data management. They facilitate conceptual design and enable checking of da...
Peter M. Fischer, Kyumars Sheykh Esmaili, Ren&eacu...
KDD
2004
ACM
139views Data Mining» more  KDD 2004»
16 years 2 days ago
Machine learning for online query relaxation
In this paper we provide a fast, data-driven solution to the failing query problem: given a query that returns an empty answer, how can one relax the query's constraints so t...
Ion Muslea
VLDB
2004
ACM
227views Database» more  VLDB 2004»
15 years 5 months ago
Approximate NN queries on Streams with Guaranteed Error/performance Bounds
In data stream applications, data arrive continuously and can only be scanned once as the query processor has very limited memory (relative to the size of the stream) to work with...
Nick Koudas, Beng Chin Ooi, Kian-Lee Tan, Rui Zhan...
VLDB
1997
ACM
78views Database» more  VLDB 1997»
15 years 3 months ago
Recovering Information from Summary Data
Data is often stored in summarized form, as a histogram of aggregates (COUNTs, SUMs, or AVeraGes) over speci ed ranges. We study how to estimate the original detail data from the ...
Christos Faloutsos, H. V. Jagadish, Nikolaos Sidir...