### Abstract

We describe an implicit data structure for n multikey records that supports searching for a record, under any key, in the asymptotically optimal search time O(log n). This improves on [Mun87] in which Munro describes an implicit data structure for the problem of storing n k-key records so that search on any key can be performed in O(log^{k} n(log log n)^{k-1}) comparisons. The theoretical tools we develop also yield practical schemes that either halve the number of memory references over obvious solutions to the non-implicit version of the problem, or alternatively reduce the number of pointers involved significantly.

Original language | English (US) |
---|---|

Title of host publication | Proceedings of the 20th Annual ACM Symposium on Theory of Computing, STOC 1988 |

Publisher | Association for Computing Machinery |

Pages | 344-353 |

Number of pages | 10 |

ISBN (Print) | 0897912640, 9780897912648 |

DOIs | |

State | Published - 1988 |

Event | 20th Annual ACM Symposium on Theory of Computing, STOC 1988 - Chicago, IL, United States Duration: May 2 1988 → May 4 1988 |

### Other

Other | 20th Annual ACM Symposium on Theory of Computing, STOC 1988 |
---|---|

Country | United States |

City | Chicago, IL |

Period | 5/2/88 → 5/4/88 |

### Fingerprint

### ASJC Scopus subject areas

- Software

### Cite this

*Proceedings of the 20th Annual ACM Symposium on Theory of Computing, STOC 1988*(pp. 344-353). Association for Computing Machinery. https://doi.org/10.1145/62212.62245

**Storing and searching a multikey table.** / Fiat, Amos; Naor, Moni; Scliäfer, Alejandro A.; Schmidt, Jeanette P.; Siegel, Alan.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*Proceedings of the 20th Annual ACM Symposium on Theory of Computing, STOC 1988.*Association for Computing Machinery, pp. 344-353, 20th Annual ACM Symposium on Theory of Computing, STOC 1988, Chicago, IL, United States, 5/2/88. https://doi.org/10.1145/62212.62245

}

TY - GEN

T1 - Storing and searching a multikey table

AU - Fiat, Amos

AU - Naor, Moni

AU - Scliäfer, Alejandro A.

AU - Schmidt, Jeanette P.

AU - Siegel, Alan

PY - 1988

Y1 - 1988

N2 - We describe an implicit data structure for n multikey records that supports searching for a record, under any key, in the asymptotically optimal search time O(log n). This improves on [Mun87] in which Munro describes an implicit data structure for the problem of storing n k-key records so that search on any key can be performed in O(logk n(log log n)k-1) comparisons. The theoretical tools we develop also yield practical schemes that either halve the number of memory references over obvious solutions to the non-implicit version of the problem, or alternatively reduce the number of pointers involved significantly.

AB - We describe an implicit data structure for n multikey records that supports searching for a record, under any key, in the asymptotically optimal search time O(log n). This improves on [Mun87] in which Munro describes an implicit data structure for the problem of storing n k-key records so that search on any key can be performed in O(logk n(log log n)k-1) comparisons. The theoretical tools we develop also yield practical schemes that either halve the number of memory references over obvious solutions to the non-implicit version of the problem, or alternatively reduce the number of pointers involved significantly.

UR - http://www.scopus.com/inward/record.url?scp=84899031459&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84899031459&partnerID=8YFLogxK

U2 - 10.1145/62212.62245

DO - 10.1145/62212.62245

M3 - Conference contribution

AN - SCOPUS:84899031459

SN - 0897912640

SN - 9780897912648

SP - 344

EP - 353

BT - Proceedings of the 20th Annual ACM Symposium on Theory of Computing, STOC 1988

PB - Association for Computing Machinery

ER -