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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
