/
Space-Efficient Data Structures for Top-k Completion Space-Efficient Data Structures for Top-k Completion

Space-Efficient Data Structures for Top-k Completion - PowerPoint Presentation

ellena-manuel
ellena-manuel . @ellena-manuel
Follow
415 views
Uploaded On 2015-11-11

Space-Efficient Data Structures for Top-k Completion - PPT Presentation

Giuseppe Ottaviano Università di Pisa BoJune Paul Hsu Microsoft Research WWW 2013 String autocompletion Scored string sets Topk Completion query Given prefix p return k strings prefixed by p with highest scores ID: 190042

bits trie completion score trie bits score completion data space top rmq decomposed gle triangle strings based range structure

Share:

Link:

Embed:

Download Presentation from below link

Download Presentation The PPT/PDF document "Space-Efficient Data Structures for Top-..." is the property of its rightful owner. Permission is granted to download and print the materials on this web site for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.


Presentation Transcript