Error analysis for superimposed random coding

Abstract

The capability of superimposed random coding to support queries against large databases with sparsely populated search attributes is investigated with particular emphasis on the balance of false and correct drops, carefully distinguishing coding strategies that are often mixed up. A comparison with inverted files is made, showing that superposition is competitive for queries involving more than a very small number of terms if the correct random code generation strategy is used.

Keywords:

• source coding
• random coding
• database indexing
• error analysis
• false drops

2000 AMS Subject Classifications :

• 94A29
• 60C05

Acknowledgements

The author acknowledges many helpful suggestions provided by the referees.