Sciweavers

2642 search results - page 347 / 529
» Merge-by-Wire: Algorithms and System Support
Sort
View
142
Voted
KDD
2009
ACM
185views Data Mining» more  KDD 2009»
16 years 4 months ago
On compressing social networks
Motivated by structural properties of the Web graph that support efficient data structures for in memory adjacency queries, we study the extent to which a large network can be com...
Flavio Chierichetti, Ravi Kumar, Silvio Lattanzi, ...
224
Voted
VLDB
2001
ACM
151views Database» more  VLDB 2001»
16 years 4 months ago
Approximate query mapping: Accounting for translation closeness
Abstract In this paper we present a mechanism for approximately translating Boolean query constraints across heterogeneous information sources. Achieving the best translation is ch...
Kevin Chen-Chuan Chang, Hector Garcia-Molina
240
Voted
VLDB
2006
ACM
172views Database» more  VLDB 2006»
16 years 4 months ago
Hierarchical hippocratic databases with minimal disclosure for virtual organizations
Abstract The protection of customer privacy is a fundamental issue in today's corporate marketing strategies. Not surprisingly, many research efforts have proposed new privacy...
Fabio Massacci, John Mylopoulos, Nicola Zannone
235
Voted
SIGMOD
2007
ACM
157views Database» more  SIGMOD 2007»
16 years 3 months ago
Compiling mappings to bridge applications and databases
Translating data and data access operations between applications and databases is a longstanding data management problem. We present a novel approach to this problem, in which the...
Sergey Melnik, Atul Adya, Philip A. Bernstein
150
Voted
PODS
2008
ACM
250views Database» more  PODS 2008»
16 years 3 months ago
Approximating predicates and expressive queries on probabilistic databases
We study complexity and approximation of queries in an expressive query language for probabilistic databases. The language studied supports the compositional use of confidence com...
Christoph Koch