ABSTRACT
The UQBE is a mashup tool for non-programmers that supports query-by-example (QBE) over a schema made up by the user without knowing the schema of the original sources. Based on automated schema matching with uncertainty, the UQBE system returns the best confident results. The system lets the user refine them interactively. A tuple in the query result is associated with lineage that is a boolean formula over schema matching decisions representing underlying conditions on which the corresponding tuple is included in the result. Given binary feedbacks on tuples by the user, which are possibly imprecise, the system solves it as an optimization problem to refine confidence values of matching decisions. The demo features graphical user interaction on the UQBE system, including querying and refinement.
- Bogdan Alexe, Laura Chiticariu, Renee J. Miller, and Wang-Chiew Tan. Muse: Mapping understanding and design by example. In ICDE 2008, 2008. Google ScholarDigital Library
- Bogdan Alexe, Laura Chiticariu, and Wang-Chiew Tan. Spider: a schema mapping debugger. In VLDB 2006, pages 1179--1182, 2006. Google ScholarDigital Library
- Omar Benjelloun, Anish Das Sarma, Alon Y. Halevy, and Jennifer Widom. Uldbs: Databases with uncertainty and lineage. In VLDB 2006, pages 953--964, 2006. Google ScholarDigital Library
- Xin Luna Dong, Alon Y. Halevy, and Cong Yu. Data integration with uncertainty. In VLDB 2007, pages 687--698, 2007. Google ScholarDigital Library
- Alon Halevy, Michael Franklin, and David Maier. Principles of dataspace systems. In PODS 2006, pages 1--9, 2006. Google ScholarDigital Library
- Jorge Nocedal and Stephen Wright. Numerical Optimization. Springer, 2000.Google Scholar
- Utkarsh Srivastava, Kamesh Munagala, Jennifer Widom, and Rajeev Motwani. Query optimization over web services. In VLDB 2006, pages 355--366, 2006. Google ScholarDigital Library
Index Terms
UQBE: uncertain query by example for web service mashup
Recommendations
Efficient processing of probabilistic set-containment queries on uncertain set-valued data
Set-valued data is a natural and concise representation for modeling complex objects. As an important operation of object-oriented or object-relational database, set containment query processing over set-valued data has been extensively studied in ...
Sensitivity analysis and explanations for robust query evaluation in probabilistic databases
SIGMOD '11: Proceedings of the 2011 ACM SIGMOD International Conference on Management of dataProbabilistic database systems have successfully established themselves as a tool for managing uncertain data. However, much of the research in this area has focused on efficient query evaluation and has largely ignored two key issues that commonly ...
Skyline query processing for uncertain data
CIKM '10: Proceedings of the 19th ACM international conference on Information and knowledge managementRecently, several research efforts have addressed answering skyline queries efficiently over large datasets. However, this research lacks methods to compute these queries over uncertain data, where uncertain values are represented as a range. In this ...
Comments