Colored Range Searching on Internal Memory

  • Haritha Bellam
  • Saladi Rahul
  • Krishnan Rajan
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7239)


Recent advances in various application fields, like GIS, finance and others, has lead to a large increase in both the volume and the characteristics of the data being collected. Hence, general range queries on these datasets are not sufficient enough to obtain good insights and useful information from the data. This leads to the need for more sophisticated queries and hence novel data structures and algorithms such as the orthogonal colored range searching (OCRS) problem which is a generalized version of orthogonal range searching. In this work, an efficient main-memory algorithm has been proposed to solve OCRS by augmenting k-d tree with additional information. The performance of the proposed algorithm has been evaluated through extensive experiments and comparison with two base-line algorithms is presented. The data structure takes up linear or near-linear space of O(n logα), where α is the number of colors in the dataset (αn). The query response time varies minimally irrespective of the number of colors and the query box size.


Leaf Node Computational Geometry Range Query Synthetic Dataset Theoretical Solution 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
  2. 2.
  3. 3.
    Agarwal, P.K., Govindarajan, S., Muthukrishnan, S.: Range Searching in Categorical Data: Colored Range Searching on Grid. In: Möhring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol. 2461, pp. 17–28. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  4. 4.
    Beckmann, N., Kriegel, H.-P., Schneider, R., Seeger, B.: The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles. In: ACM SIGMOD Conference, pp. 322–331 (1990)Google Scholar
  5. 5.
    Bentley, J.L.: Multidimensional binary search trees used for associative searching. Communications of the ACM 18, 509–517 (1975)zbMATHCrossRefGoogle Scholar
  6. 6.
    de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational geometry: algorithms and applications. Springer, Heidelberg (2000)zbMATHGoogle Scholar
  7. 7.
    Gupta, P., Janardan, R., Smid, M.: Further results on generalized intersection searching problems: counting, reporting, and dynamization. Journal of Algorithms 19, 282–317 (1995)MathSciNetzbMATHCrossRefGoogle Scholar
  8. 8.
    Gupta, P., Janardan, R., Smid, M.: Computational geometry: Generalized intersection searching. In: Mehta, D., Sahni, S. (eds.) Handbook of Data Structures and Applications, ch. 64, pp. 64-1–64-17. Chapman & Hall/CRC, Boca Raton, FL (2005)Google Scholar
  9. 9.
    Guttman, A.: R-Trees: A Dynamic Index Structure for Spatial Searching. In: SIGMOD Conference, pp. 47–57 (1984)Google Scholar
  10. 10.
    Janardan, R., Lopez, M.: Generalized intersection searching problems. International Journal on Computational Geometry & Applications 3, 39–69 (1993)MathSciNetzbMATHCrossRefGoogle Scholar
  11. 11.
    Rahul, S., Gupta, P., Rajan, K.: Data Structures for Range Aggregation by Categories. In: 21st Canadian Conference on Computational Geometry (CCCG 2009), pp. 133–136 (2009)Google Scholar
  12. 12.
    Rahul, S., Bellam, H., Gupta, P., Rajan, K.: Range aggregate structures for colored geometric objects. In: 22nd Canadian Conference on Computational Geometry (CCCG 2010), pp. 249–252 (2010)Google Scholar
  13. 13.
    Sellis, T.K., Roussopoulos, N., Faloutsos, C.: The R+-Tree: A Dynamic Index for Multi-Dimensional Objects. In: 13th International Conference on Very Large Data Bases (VLDB 1987), pp. 507–518 (1987)Google Scholar
  14. 14.
    Shi, Q., JáJá, J.: Optimal and near-optimal algorithms for generalized intersection reporting on pointer machines. Information Processing Letters 95(3), 382–388 (2005)MathSciNetzbMATHCrossRefGoogle Scholar
  15. 15.
    Kumar, Y., Janardan, R., Gupta, P.: Efficient algorithms for reverse proximity query problems. In: GIS 2008, p. 39 (2008)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Haritha Bellam
    • 1
  • Saladi Rahul
    • 2
  • Krishnan Rajan
    • 1
  1. 1.Lab for Spatial InformaticsIIIT-HyderabadHyderabadIndia
  2. 2.Univerity of MinnesotaMinneapolisUSA

Personalised recommendations