Compact indexing of versioned data

author: Ronny Lempel, Yahoo! Research, Yahoo! Research

Categories

Top: Computer Science: Information Retrieval
Top: Computer Science: Algorithms and Data Structures

You might be experiencing some problems with Your Video player.

*Slides*
0:00	Efficient Indexing of Versioned Document Sequences
0:08	Motivation
1:22	Related Work - Stringology
1:53	Related Work – Indexing Shared Content
3:09	Related Work – Indexing Shared Content
3:32	Related Work – Indexing Shared Content
3:47	Related Work – Indexing Shared Content
4:14	Our Problem - Running Example
4:51	Alignment Matrix
5:29	Alignment Matrix – Runs of 1
6:42	From Runs to Virtual Documents
7:44	From Runs to Virtual Documents
8:30	From Virtual Documents to Inverted Index
8:50	Multiple Versioned Groups
9:29	Index Representation and Query Evaluation
10:21	Example: +A +B –C (Step 1)
10:31	Interval Algebra with Virtual Documents
12:40	Index Size Analysis
13:35	Back to the String Alignment Problem
14:43	Optimizing the Alignment Matrix
16:31	Greedy Algorithm example
16:48	Greedy Algorithm example
17:22	Experimental Results
18:18	Experimental Results
19:03	Conclusions and Future Work

Lecture rating

People found this lecture:
Worth seeing
because it is:
Valuable and informative
Well presented
Easily understandable
Acceptably recorded
You need to login to cast your vote.

Report a problem or upload files

If 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.