Amos Fiat
Moni Naor
Alexandro Schäffer
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 Ο(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 Ο(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.
- AMM84.Heltnut Alt, Kurt Mehlhorn, and J. dfhui u guiegfiu g uigfiufgefuiwg iugfiufgiu hfewoihfoi oihf io fheo hoiwefhoiewfhohffhiwef 61-65.Google Scholar
- CH82.Richard Cole ,xnd John Hopcroft, On Edge Coloring Bipartite Graphs, SIAM J. Comput. Vol 11, No. 3, August, 1982, 540-546.Google ScholarCross Ref
- FNSS88.Amos Fiat, Moni Naor, Jeanette P. Schmidt, and Alan Siegel, Non-Oblivious Ha.shing, Proc. 20th ACM Symp. on Theory of Computing (1988), Chicago, these proceedings. Google ScholarDigital Library
- Hal35.P. Hall, On Represelll.,'ttions of Subsets, .1. London Matll. Soc. 10(1935), 26-30.Google ScholarCross Ref
- Mun86.J. Ian Munro, An Implicit Data Structure supporting Inscrtion, deletion, and Search in O(lOgu ~,)'time,J.comp, syst. sci 33(1986) 66, 74. Google ScholarDigital Library
- Mun87.J. Ian Munro, Searching a Two Key table under a single Key, proc. 19tlt ACM Syrup. olt Theory of Computing (1987), New York City, 383-387. Google ScholarDigital Library
Index Terms
- Storing and searching a multikey table
Recommendations
Application of Principal Component Analysis to Multikey Searching
In this paper, we shall introduce a concept widely used by statisticians, the principal component analysis technique. We shall show that this principal component analysis technique can be used to create new keys from a set of old keys. These new keys ...
Orthogonal range searching on the RAM, revisited
SoCG '11: Proceedings of the twenty-seventh annual symposium on Computational geometryWe present a number of new results on one of the most extensively studied topics in computational geometry, orthogonal range searching. All our results are in the standard word RAM model: We present two data structures for 2-d orthogonal range ...
Randomization does not help searching predecessors
SODA '07: Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithmsAt STOC'06, we presented a new technique for proving cell-probe lower bounds for static data structures with deterministic queries. This was the first technique which could prove a bound higher than communication complexity, and it gave the first ...
Comments