Type Less, Find More: Fast Autocompletion Search with a...
From Google TechTalks · 54:39
Show by Google TechTalks
Google TechTalksAugust 14, 2006Holger BastABSTRACTWe consider the following full-text search autocompletion feature. Imagine a user of a search engine typing a query. Then with every letter being typed, we would like an instant display of completions of the last query word which would lead to good hits. At the same time, the best hits for any of these completions should be displayed. Known indexing data structures that apply to this problem either incur large processing times for a substantial class of queries, or they use a lot of space. We present a new indexing data structure that uses no more space than a state-of-the-art compressed inverted index, but that yields an order of magnitude...Uploaded 08-10-07
More episodes of Google TechTalks
More episodes
- Threat Models for Memorization: Privacy, Copyright, and Everything In-Between
- Technology Assisted Reading Acquisition: Children Acquiring Literacy Naturally
- sex on the internet, the realities of porn, sexual privacy,
- Privacy Auditing of Large Language Models
- The Limits and Possibilities of One Run Auditing
- PhotoTechEDU Day 29: Photographing VR Panoramas
- Privacy Ripple Effects from Adding or Removing Personal Information in Language Model Training
- Inside VMware Fusion
- Java Posse Episode 100 (Live Special)
- Cascading Adversarial Bias from Injection to Distillation in Language Models
PodSearch is a free, independent podcast search engine. Read about PodSearch, the privacy policy or contact us.