A tradeoff between search and update time for the implicit dictionary problem (Q1108806): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0304-3975(88)90018-7 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2069907263 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Searching Semisorted Tables / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Partial match retrieval in implicit data structures / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Efficient searching using partial ordering / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Implicit Data Structures for the Dictionary Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Implicit data structures for fast search and update / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Should Tables Be Sorted? / rank | |||
Normal rank |
Latest revision as of 18:59, 18 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A tradeoff between search and update time for the implicit dictionary problem |
scientific article |
Statements
A tradeoff between search and update time for the implicit dictionary problem (English)
0 references
1988
0 references
An implicit dictionary can be viewed as a set of allowable permutations together with an associated search algorithm and an associated update algorithm (a comparison-based model, with elements drawn from a totally ordered universe, is used in this paper). The authors study lower bounds for the search time, given a constant-time update algorithm. It is proved that if update is easy (constant-time), then situations in which search is difficult (super-logarithmic time) occur. The first and the final paragraphs constitute a very good exposition of related results, ideas and open problems.
0 references
implicit dictionary
0 references
update
0 references
search
0 references