0.25
0.5
0.75
1.25
1.5
1.75
2
Answers Partitioning and Lazy Joins for Efficient Query Relaxation and Application to Similarity Search
Published on Jul 10, 2018498 Views
Query relaxation has been studied as a way to find approximate answers when user queries are too specific or do not align well with the data schema. We are here interested in the application of quer
Related categories
Chapter list
Answers Partitioning and Lazy Joins for Efficient Query Relaxation and Application to Similarity Search00:00
Overview - 100:09
Query Relaxation in RDF00:34
Research Question - 102:02
Research Question - 203:49
Our results in short for PARTITION+LAZYJOINS03:57
Overview - 205:52
Relaxation of Query Elements06:03
Relaxation of Queries07:53
Approximate Answers and Proper Relaxed Queries10:41
Application to similarity search13:02
Overview - 315:05
Algorithm PARTITION: principle15:14
Algorithm PARTITION: description16:52
Algorithm PARTITION: illustration - 116:57
Algorithm PARTITION: illustration - 217:34
Algorithm PARTITION: illustration - 318:00
Algorithm PARTITION: illustration - 418:14
Algorithm PARTITION: illustration - 518:16
Intractability of Relaxed Query Evaluation18:42
Algorithm PARTITION+LAZYJOINS19:49
Overview - 420:54
Efficiency of Query Relaxation20:56
Efficiency of Similarity Search21:45
Overview - 522:21
Conclusion22:23
Perspectives23:09