| Document Date: 2014-09-29 11:40:17
Open Document File Size: 578,73 KBShare Result on Facebook
City Bernoulli / Bern / / Company Distinct-Item Sampling / AES / Hp / IBM / / Currency pence / IDR / / / Facility R. Gemulla Max Planck Institute / P. J. Haas IBM Almaden Research Center / / IndustryTerm subsequent processing / sample-maintenance algorithm / query processing / uniform sampling algorithm / set-sampling algorithms / switch-over algorithm / sample-maintenance algorithms / earlier algorithms / random pairing algorithm / reservoir sampling algorithm / uniform set-sampling algorithms / incorrect algorithms / computing / workaround algorithm / memory management / / Organization P. J. Haas IBM Almaden Research Center / R. Gemulla Max Planck Institute for Informatics / RPR BSP / U.S. Securities and Exchange Commission / / Person Peter J. Haas / Wolfgang Lehner / / Position Pr rT / editor / rT / item rT / / ProvinceOrState Si / / PublishedMedium The VLDB Journal / / Technology set-sampling algorithms / sampling algorithm / uniform sampling algorithm / reservoir sampling algorithm / sample-maintenance algorithm / resulting algorithm / uniform set-sampling algorithms / sample-maintenance algorithms / random pairing algorithm / switch-over algorithm / incorrect algorithms / workaround algorithm / /
SocialTag |
The VLDB Journal manuscript No. (will be inserted by the editor) Non-Uniformity Issues and Workarounds in Bounded-Size Sampling Rainer Gemulla · Peter J. Haas · Wolfgang Lehner