Advertisement

Finger Search in the Implicit Model

  • Gerth Stølting Brodal
  • Jesper Sindahl Nielsen
  • Jakob Truelsen
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7676)

Abstract

We address the problem of creating a dictionary with the finger search property in the strict implicit model, where no information is stored between operations, except the array of elements. We show that for any implicit dictionary supporting finger searches in q(t) = Ω(logt) time, the time to move the finger to another element is Ω(q − 1(logn)), where t is the rank distance between the query element and the finger. We present an optimal implicit static structure matching this lower bound. We furthermore present a near optimal implicit dynamic structure supporting search, change-finger, insert, and delete in times \(\mathcal{O}(q(t))\), \(\mathcal{O}(q^{-1}(\log n)\log n)\), \(\mathcal{O}(\log n)\), and \(\mathcal{O}(\log n)\), respectively, for any q(t) = Ω(logt). Finally we show that the search operation must take Ω(logn) time for the special case where the finger is always changed to the element returned by the last query.

Keywords

Search Time Binary Search Search Operation Implicit Model Rank Distance 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Borodin, A., Fich, F.E., Meyer auf der Heide, F., Upfal, E., Wigderson, A.: A Tradeoff Between Search and Update Time for the Implicit Dictionary Problem. In: Kott, L. (ed.) ICALP 1986. LNCS, vol. 226, pp. 50–59. Springer, Heidelberg (1986)CrossRefGoogle Scholar
  2. 2.
    Brodal, G.S., Kejlberg-Rasmussen, C., Truelsen, J.: A Cache-Oblivious Implicit Dictionary with the Working Set Property. In: Cheong, O., Chwa, K.-Y., Park, K. (eds.) ISAAC 2010, Part II. LNCS, vol. 6507, pp. 37–48. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  3. 3.
    Brodal, G.S.: Finger search trees. In: Mehta, D., Sahni, S. (eds.) Handbook of Data Structures and Applications, ch. 11. CRC Press (2005)Google Scholar
  4. 4.
    Franceschini, G., Grossi, R.: Optimal Worst-Case Operations for Implicit Cache-Oblivious Search Trees. In: Dehne, F., Sack, J.-R., Smid, M. (eds.) WADS 2003. LNCS, vol. 2748, pp. 114–126. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  5. 5.
    Franceschini, G., Grossi, R., Munro, J.I., Pagli, L.: Implicit B-Trees: New results for the dictionary problem. In: Proc. 43rd FOCS, pp. 145–154. IEEE (2002)Google Scholar
  6. 6.
    Frederickson, G.N.: Implicit data structures for the dictionary problem. JACM 30(1), 80–94 (1983)MathSciNetMATHCrossRefGoogle Scholar
  7. 7.
    Munro, J.I.: An implicit data structure supporting insertion, deletion, and search in \(\mathcal{O}(\log^2 n)\) time. JCSS 33(1), 66–74 (1986)MathSciNetMATHCrossRefGoogle Scholar
  8. 8.
    Munro, J.I., Suwanda, H.: Implicit data structures for fast search and update. JCSS 21(2), 236–250 (1980)MathSciNetMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Gerth Stølting Brodal
    • 1
  • Jesper Sindahl Nielsen
    • 1
  • Jakob Truelsen
    • 1
  1. 1.MADALGO, Department of Computer ScienceAarhus UniversityDenmark

Personalised recommendations