| UQBE: uncertain query by example for web service mashup |
| Full text |
Pdf
(406 KB)
|
Source
|
International Conference on Management of Data
archive
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
table of contents
Vancouver, Canada
DEMONSTRATION SESSION: Group 2
table of contents
Pages 1275-1280
Year of Publication: 2008
ISBN:978-1-60558-102-6
|
|
Authors
|
|
Junichi Tatemura
|
NEC Laboratories America, Cupertino, CA, USA
|
|
Songting Chen
|
NEC Laboratories America, Cupertino, CA, USA
|
|
Fenglin Liao
|
University of California, Santa Barbara, Santa Barbara, CA, USA
|
|
Oliver Po
|
NEC Laboratories America, Cupertino, CA, USA
|
|
K. Selcuk Candan
|
NEC Laboratories America, Cupertino, CA, USA
|
|
Divyakant Agrawal
|
NEC Laboratories America, Cupertino, CA, USA
|
|
| Sponsors |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Citation Count: 1
|
|
|
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.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
Bogdan Alexe, Laura Chiticariu, Renee J. Miller, and Wang-Chiew Tan. Muse: Mapping understanding and design by example. In ICDE 2008, 2008.
|
| |
2
|
|
| |
3
|
|
| |
4
|
|
 |
5
|
Alon Halevy , Michael Franklin , David Maier, Principles of dataspace systems, Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, p.1-9, June 26-28, 2006, Chicago, IL, USA
[doi> 10.1145/1142351.1142352]
|
| |
6
|
Jorge Nocedal and Stephen Wright. Numerical Optimization. Springer, 2000.
|
| |
7
|
|
CITED BY
|
|
Gengxin Miao , Junichi Tatemura , Wang-Pin Hsiung , Arsany Sawires , Louise E. Moser, Extracting data records from the web using tag path clustering, Proceedings of the 18th international conference on World wide web, April 20-24, 2009, Madrid, Spain
|
|