|
|
|
                                          
|
Return to Session 5: Approximate and Ranked Query Processing
Current approaches for answering queries with imprecise constraints require users to provide distance metrics and importance measures for attributes of interest. In this paper we focus on providing a domain and end-user independent solution for supporting imprecise queries over Web databases without affecting the underlying database. We propose a query processing framework that integrates techniques from IR and database research to efficiently determine answers for imprecise queries. We mine and use approximate functional dependencies between attributes to create precise queries having tuples relevant to the given imprecise query. An approach to automatically estimate the semantic distances between values of categorical attributes is also proposed. We provide preliminary results showing the utility of our approach.
@inproceedings {DBLP:conf/webdb/NambiarK04, author = {Ullas Nambiar and Subbarao Kambhampati}, title = {Mining Approximate Functional Dependencies and Concept Similarities to Answer Imprecise Queries}, pages = {73-78}, ee = {http://webdb2004.cs.columbia.edu/papers/5-3.pdf}, booktitle = {Seventh International Workshop on the Web and Databases}, month = Jun, year = 2004, crossref = {conf/webdb/2004} }  ©2005 Association for Computing Machinery |
