Internal Profile Representation

Matthias Eichstädt · Deutscher Universitätsverlag eBooks · 1999

The foundation of the presented profile matching algorithms is a compact data structure for organizing a large collection of profiles called profile index (PI for brevity). This chapter introduces the design objectives and the data structures to represent a profile index.

Read the paper · More papers on PaperTik