Revisiting explicit adaptive two-probe schemes
| Autor: | Patrick K. Nicholson |
|---|---|
| Rok vydání: | 2019 |
| Předmět: |
Scheme (programming language)
Discrete mathematics Computer science Order (ring theory) 0102 computer and information sciences 02 engineering and technology Data structure 01 natural sciences Computer Science Applications Theoretical Computer Science 010201 computation theory & mathematics Signal Processing 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing Element (category theory) computer Information Systems computer.programming_language Universe (mathematics) |
| Zdroj: | Information Processing Letters. 143:1-3 |
| ISSN: | 0020-0190 |
| DOI: | 10.1016/j.ipl.2018.10.009 |
| Popis: | In the bitprobe model the primary concern is the number of bits that must be probed in a data structure in order to answer queries, and how constraining the number probes affects the storage requirements. In this note we revisit an explicit membership scheme of Radhakrishnan, Raman, and Rao [ESA 2001], which stores an n = 2 element subset of a universe [ 1 , m ] , occupies O ( m 2 / 3 ) bits, and supports membership queries in t = 2 bit probes. We show that, with a small modification to their storage scheme, their query scheme also works for n = 3 elements. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect