1 / 1

IQR: An Interactive Query Relaxation System for the Empty-Answer Problem

IQR: An Interactive Query Relaxation System for the Empty-Answer Problem . Davide Mottin (U of Trento), A. Marascu (IBM Research - Ireland), S. Basu Roy (U of Washigton Tacoma), G. Das (U of Texas Arligton ), T. Palpanas (Paris Descartes U) and Y. Velegrakis (U of Trento).

taji
Download Presentation

IQR: An Interactive Query Relaxation System for the Empty-Answer Problem

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. IQR: An Interactive Query Relaxation System for the Empty-Answer Problem DavideMottin (U of Trento), A. Marascu (IBM Research - Ireland), S. Basu Roy (U of Washigton Tacoma), G. Das (U of Texas Arligton), T. Palpanas (Paris Descartes U) and Y. Velegrakis (U of Trento) Full technical details in: DavideMottin, A. Marascu, S. Basu Roy, G. Das, T. Palpanas and Y. Velegrakis, "A Probabilistic Optimization Framework for the Empty-Answer Problem", Proceedings of VLDB, 6(14), 2013 A Database The Theory • For a relaxation Q’ of Q • Prior • Belief of the user that an answer will be found in the database • Prefer • The likelihood the user will like the relaxed query answers • Relaxation Preference Function • Probability to reject the a relaxation • Probability to accept the relaxation • Cost for a relaxation A Query Cars with ABS, DSL & Manual Transmission The Answer: None What Users Want The Relaxation Tree The Algorithms The Performance • Full Tree • Precompute the whole Relaxation Tree • Fast Optimal • Start from the root and construct the tree on demand, computing min and max cost bounds • Approximate (CDR) • Approximate the cost of each relaxation

More Related