Referenced Items are not available for this document.
A large number of online databases are hidden behind form-like interfaces which allow users to execute search queries by specifying selection conditions in the interface. Most of these interfaces return restricted answers (e.g., only top-k of the selected tuples), while many of them also accompany each answer with the COUNT of the selected tuples. In this paper, we propose techniques which leverage the COUNT information to efficiently acquire unbiased samples of the hidden database. We also discuss variants for interfaces which do not provide COUNT information. We conduct extensive experiments to illustrate the efficiency and accuracy of our techniques.
Published in:
Data Engineering, 2009. ICDE '09. IEEE 25th International Conference on
Date of Conference: March 29 2009-April 2 2009
- Page(s):
- 329 - 340
- ISSN :
- 1084-4627
- E-ISBN :
- 978-0-7695-3545-6
- Print ISBN:
- 978-1-4244-3422-0
- INSPEC Accession Number:
- 10571528
- Conference Location :
- Shanghai
- Digital Object Identifier :
- 10.1109/ICDE.2009.112
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
