Holistic and Compact Selectivity Estimation for Hybrid Queries over RDF Graphs
published: Dec. 19, 2014, recorded: October 2014, views: 10
Report a problem or upload filesIf you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Many RDF descriptions today are text-rich: besides struc- tured data they also feature much unstructured text. Text-rich RDF data is frequently queried via predicates matching structured data, combined with string predicates for textual constraints (hybrid queries). Evaluating hybrid queries eficiently requires means for selectivity estimation. Previous works on selectivity estimation, however, sufer from inherent drawbacks, which are reflected in eficiency and efectiveness issues. We propose a novel estimation approach, TopGuess, which exploits topic models as data synopsis. This way, we capture correlations between structured and unstructured data in a holistic and compact manner. We study TopGuess in a theoretical analysis and show it to guarantee a linear space complexity w.r.t. text data size. Further, we show selectivity estimation time complexity to be independent from the synopsis size. In experiments on real-world data, TopGuess allowed for great improvements in estimation accuracy, without sacrificing eficiency.
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !