Sciweavers

1778 search results - page 277 / 356
» The Theory of Probabilistic Databases
Sort
View
SIGMOD
2007
ACM
156views Database» more  SIGMOD 2007»
15 years 10 months ago
M-invariance: towards privacy preserving re-publication of dynamic datasets
The previous literature of privacy preserving data publication has focused on performing "one-time" releases. Specifically, none of the existing solutions supports re-pu...
Xiaokui Xiao, Yufei Tao
PODS
2006
ACM
216views Database» more  PODS 2006»
15 years 10 months ago
Cache-oblivious string B-trees
B-trees are the data structure of choice for maintaining searchable data on disk. However, B-trees perform suboptimally ? when keys are long or of variable length, ? when keys are...
Michael A. Bender, Martin Farach-Colton, Bradley C...
PODS
2006
ACM
122views Database» more  PODS 2006»
15 years 10 months ago
Space- and time-efficient deterministic algorithms for biased quantiles over data streams
Skew is prevalent in data streams, and should be taken into account by algorithms that analyze the data. The problem of finding "biased quantiles"-- that is, approximate...
Graham Cormode, Flip Korn, S. Muthukrishnan, Dives...
PODS
2006
ACM
134views Database» more  PODS 2006»
15 years 10 months ago
Approximate quantiles and the order of the stream
Recently, there has been an increased focus on modeling uncertainty by distributions. Suppose we wish to compute a function of a stream whose elements are samples drawn independen...
Sudipto Guha, Andrew McGregor
PODS
2008
ACM
158views Database» more  PODS 2008»
15 years 10 months ago
Local Hoare reasoning about DOM
The W3C Document Object Model (DOM) specifies an XML update library. DOM is written in English, and is therefore not compositional and not complete. We provide a first step toward...
Philippa Gardner, Gareth Smith, Mark J. Wheelhouse...