Advertisement

International Workshop on Combinatorial Algorithms

IWOCA 2014: Combinatorial Algorithms pp 176-187 | Cite as

Space Efficient Data Structures for Nearest Larger Neighbor

  • Varunkumar  Jayapaul
  • Seungbum Jo
  • Venkatesh Raman
  • Srinivasa Rao SattiEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8986)

Abstract

Given a sequence of n elements from a totally ordered set, and a position in the sequence, the nearest larger neighbor (NLN) query returns the position of the element which is closest to the query position, and is larger than the element at the query position. The problem of finding all nearest larger neighbors has attracted interest due to its applications for parenthesis matching and in computational geometry [1, 2, 3]. We consider a data structure version of this problem, which is to preprocess a given sequence of elements to construct a data structure that can answer NLN queries efficiently. We consider time-space tradeoffs for the problem in both the encoding (where the input is not accessible after the data structure has been created) and indexing model, and consider cases when the input is in a one or two dimensional array. We also consider the version when only the nearest larger right neighbor (NLRN) is sought (in one dimension). We initiate the study of this problem in two dimensions, and describe upper and lower bounds in the encoding and indexing models, distinguishing the two cases when all the elements are distinct or non-distinct.

Keywords

Query Time Indexing Model Suffix Tree Dimensional Array Query Algorithm 
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.

References

  1. 1.
    Asano, T., Bereg, S., Kirkpatrick, D.: Finding nearest larger neighbors. In: Albers, S., Alt, H., Näher, S. (eds.) Efficient Algorithms. LNCS, vol. 5760, pp. 249–260. Springer, Heidelberg (2009) CrossRefGoogle Scholar
  2. 2.
    Asano, T., Kirkpatrick, D.: Time-space tradeoffs for all-nearest-larger-neighbors problems. In: Dehne, F., Solis-Oba, R., Sack, J.-R. (eds.) WADS 2013. LNCS, vol. 8037, pp. 61–72. Springer, Heidelberg (2013) CrossRefGoogle Scholar
  3. 3.
    Berkman, O., Schieber, B., Vishkin, U.: Optimal doubly logarithmic parallel algorithms based on finding all nearest smaller values. J. Algorithms 14(3), 344–370 (1993)zbMATHMathSciNetCrossRefGoogle Scholar
  4. 4.
    Brodal, G.S., Davoodi, P., Rao, S.S.: On space efficient two dimensional range minimum data structures. Algorithmica 63(4), 815–830 (2012)zbMATHMathSciNetCrossRefGoogle Scholar
  5. 5.
    Davoodi, P., Raman, R., Satti, S.R.: Succinct representations of binary trees for range minimum queries. In: Gudmundsson, J., Mestre, J., Viglas, T. (eds.) COCOON 2012. LNCS, vol. 7434, pp. 396–407. Springer, Heidelberg (2012) CrossRefGoogle Scholar
  6. 6.
    Elias, P.: Universal codeword sets and representations of the integers. IEEE Trans. Inf. Theory 21(2), 194–203 (1975)zbMATHMathSciNetCrossRefGoogle Scholar
  7. 7.
    Fischer, J.: Optimal succinctness for range minimum queries. In: López-Ortiz, A. (ed.) LATIN 2010. LNCS, vol. 6034, pp. 158–169. Springer, Heidelberg (2010) CrossRefGoogle Scholar
  8. 8.
    Fischer, J.: Combined data structure for previous- and next-smaller-values. Theor. Comput. Sci. 412(22), 2451–2456 (2011)zbMATHCrossRefGoogle Scholar
  9. 9.
    Fischer, J., Mäkinen, V., Navarro, G.: Faster entropy-bounded compressed suffix trees. Theor. Comput. Sci. 410(51), 5354–5364 (2009)zbMATHCrossRefGoogle Scholar
  10. 10.
    Golin, M., Iacono, J., Krizanc, D., Raman, R., Rao, S.S.: Encoding 2D range maximum queries. In: Asano, T., Nakano, S., Okamoto, Y., Watanabe, O. (eds.) ISAAC 2011. LNCS, vol. 7074, pp. 180–189. Springer, Heidelberg (2011) CrossRefGoogle Scholar
  11. 11.
    Peter, B.: Miltersen Cell probe complexity - a survey. In: FSTTCS (1999)Google Scholar
  12. 12.
    Raman, R., Raman, V., Satti, S.R.: Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets. ACM Trans. Algorithms 3(4), 510–534 (2007). Article 43MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  • Varunkumar  Jayapaul
    • 1
  • Seungbum Jo
    • 2
  • Venkatesh Raman
    • 3
  • Srinivasa Rao Satti
    • 2
    Email author
  1. 1.Chennai Mathematical InstituteChennaiIndia
  2. 2.Seoul National UniversitySeoulSouth Korea
  3. 3.The Institute of Mathematical SciencesChennaiIndia

Personalised recommendations