Explore or exploit? Effective strategies for disambiguating large databases

Proceedings of the VLDB Endowment

Volumn 3, Issue 1, 2010, Pages 815-825

  Cheng, Reynold ^a   Lo, Eric ^b   Yang, Xuan S ^a   Luk, Ming Hay ^b   Li, Xiang ^a   Xie, Xike ^a  

^a UNIVERSITY OF HONG KONG   (Hong Kong)

^b HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

BUDGET CONTROL; CLEANING; DATA INTEGRATION; DATABASE SYSTEMS; LOCATION; TELECOMMUNICATION SERVICES;

CLEANING EFFECTIVENESS; CONTEXT INFORMATION; EFFECTIVENESS AND EFFICIENCIES; EXPERIMENTAL EVALUATION; GREEDY HEURISTICS; SENSOR MONITORING; STATISTICAL INFORMATION; SYNTHETIC DATASETS;

LOCATION BASED SERVICES;

EID: 84859221546     PISSN: None     EISSN: 21508097     Source Type: Conference Proceeding    
DOI: 10.14778/1920841.1920945     Document Type: Article

References (34)

1. P. Andritsos, A. Fuxman, and R. Miller. Clean answers over dirty databases: A probabilistic approach. In ICDE, 2006.
2. D. Barbara, H. Garcia-Molina, and D. Porter. The management of probabilistic data. 4(5), 1992.
3. D. Berry and B. Fristedt. Bandit Problems: Sequential Allocation of Experiments. Chapman and Hall, 1985.
4. G. Beskales, M. A. Soliman, I. F. Ilyas, and S. Ben-David. Modeling and querying possible repairs in duplicate detection. VLDB, 2009.
5. D. Chakrabarti, R. Kumar, F. Radlinski, and E. Upfal. Mortal Multi-Armed Bandits. In NIPS, 2008.
6. J. Chen and R. Cheng. Quality-aware probing of uncertain data with resource constraints. In SSDBM, 2008.
7. R. Cheng, J. Chen, and X. Xie. Cleaning uncertain data with quality guarantees. VLDB, 2008.
8. R. Cheng, D. Kalashnikov, and S. Prabhakar. Evaluating probabilistic queries over imprecise data. In SIGMOD, 2003.
9. N. Dalvi and D. Suciu. Efficient query evaluation on probabilistic databases. In VLDB, 2004.
10. A. Deshpande, C. Guestrin, S. Madden, J. Hellerstein, and W. Hong. Model-driven data acquisition in sensor networks. In VLDB, 2004.
11. H.-H. Do and E. Rahm. Coma: a system for flexible combination of schema matching approaches. In VLDB, 2002.
12. A. K. Elmagarmid, P. G. Ipeirotis, and V. S. Verykios. Duplicate record detection: A survey. TKDE, 19(1), 2007.
13. J. C. Gittins and D. M. Jones. A dynamic allocation index for the sequential design of experiments. In Progress in Statistics, 1974.
14. N. Khoussainova, M. Balazinska, and D. Suciu. Towards correcting input data errors probabilistically using integrity constraints. In MobiDE, 2006.
15. Z. Liu, K. C. Sia, and J. Cho. Cost-efficient processing of min/max queries over distributed sensors with uncertainty. In ACM SAC, 2005.
16. M. Grossmann et al. Efficiently managing context information for large-scale scenarios. In PerCom, 2005.
17. O. Mar, A. Sarma, A. Halevy, and J. Widom. ULDBs: databases with uncertainty and lineage. In VLDB, 2006.
18. C. Olston, J. Jiang, and J. Widom. Adaptive filters for continuous queries over distributed data streams. In SIGMOD, 2003.
19. P. Sistla et al. Querying the uncertain position of moving objects. In Temporal Databases: Research and Practice. 1998.
20. J. Pei, B. Jiang, X. Lin, and Y. Yuan. Probabilistic skylines on uncertain data. In VLDB, 2007.
21. S. Singh, C. Mayfield, S. Prabhakar, R. Shah, and S. Hambrusch. Indexing uncertain categorical data. In ICDE, 2007.
22. Stanford University Infolab. Crime dataset. http://infolab.stanford.edu/trio/code/crimedata.triql.
23. Stanford University Infolab. Moving rating database. http://infolab.stanford.edu/trio/code/moviedata.triql.
24. Jeffrey S Banks and Rangarajan K Sundaram. Switching costs and the gittins index. Econometrica, 62(3):687-94, May 1994.
25. D. Berry and B. Fristedt. Bandit Problems: Sequential Allocation of Experiments. Chapman and Hall, 1985.
26. Avrim Blum and Yishay Mansour. From external to internal regret. In In COLT, pages 621-636, 2005.
27. Deepayan Chakrabarti, Ravi Kumar, Filip Radlinski, and Eli Upfal. Mortal Multi-Armed Bandits. In NIPS, 2008.
28. Yoav Freund, Robert E. Schapire, Yoram Singer, and Manfred K. Warmuth. Using and combining predictors that specialize. In STOC, pages 334-343, 1997.
29. J. C. Gittins and D. M. Jones. A dynamic allocation index for the sequential design of experiments. In Progress in Statistics, 1974.
30. Sandeep Pandey, Deepayan Chakrabarti, and Deepak Agarwal. Multi-armed bandit problems with dependent arms. In Proceedings of the 24th International Conference on Machine Learning, 2007.
31. Christos H. Papadimitriou and John N. Tsitsiklis. The complexity of optimal queuing network control. MATH. OPER. RES, 24:293-305, 1999.
32. Aleksandrs Slivkins and Eli Upfal. Adapting to a changing environment: the brownian restless bandits. In COLT, pages 343-354, 2008.
33. P. Whittle. Arm acquiring bandits. 9:284-292, 1981.
34. P. Whittle. Restless bandits: activity allocation in a changing world. In J. Gani, editor, A celebration of Applied Probability, Applied Probability Special Volume 25A, pages 287-298. Applied Probability Trust, 1988.