Sciweavers

2514 search results - page 373 / 503
» On the Computation of Approximations of Database Queries
Sort
View
SIGMOD
2011
ACM
179views Database» more  SIGMOD 2011»
14 years 9 months ago
No free lunch in data privacy
Differential privacy is a powerful tool for providing privacypreserving noisy query answers over statistical databases. It guarantees that the distribution of noisy query answers...
Daniel Kifer, Ashwin Machanavajjhala
ICDE
2003
IEEE
133views Database» more  ICDE 2003»
16 years 8 months ago
Text Joins for Data Cleansing and Integration in an RDBMS
An organization's data records are often noisy because of transcription errors, incomplete information, lack of standard formats for textual data or combinations thereof. A f...
Luis Gravano, Panagiotis G. Ipeirotis, Nick Koudas...
VLDB
2005
ACM
86views Database» more  VLDB 2005»
16 years 10 days ago
One-Pass Wavelet Synopses for Maximum-Error Metrics
We study the problem of computing waveletbased synopses for massive data sets in static and streaming environments. A compact representation of a data set is obtained after a thre...
Panagiotis Karras, Nikos Mamoulis
SIGMOD
2010
ACM
196views Database» more  SIGMOD 2010»
15 years 10 months ago
Connected substructure similarity search
Substructure similarity search is to retrieve graphs that approximately contain a given query graph. It has many applications, e.g., detecting similar functions among chemical com...
Haichuan Shang, Xuemin Lin, Ying Zhang, Jeffrey Xu...
WWW
2004
ACM
16 years 7 months ago
RDFPeers: a scalable distributed RDF repository based on a structured peer-to-peer network
Centralized Resource Description Framework (RDF) repositories have limitations both in their failure tolerance and in their scalability. Existing Peer-to-Peer (P2P) RDF repositori...
Min Cai, Martin R. Frank