Bitmap indexes for large scientific data sets: a case study

@article{Sinha2006BitmapIF,
  title={Bitmap indexes for large scientific data sets: a case study},
  author={Rishi Rakesh Sinha and Soumyadeb Mitra and Marianne Winslett},
  journal={Proceedings 20th IEEE International Parallel & Distributed Processing Symposium},
  year={2006},
  pages={10 pp.-}
}
The data used by today's scientific applications are often very high in dimensionality and staggering in size. These characteristics necessitate the use of a good multidimensional indexing strategy to provide efficient access to the data. Researchers have previously proposed the use of bitmap indexes for high-dimension scientific data as a way of overcoming the drawbacks of traditional multidimensional indexes such as R-trees and KD-trees, which are bulky and whose performance does not scale… CONTINUE READING
Highly Cited
This paper has 31 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 21 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 12 references

Using D2K data mining platform for understanding the dynamic evolution of land-surface variables

  • P. Kumar, P. Bajcsy, D. T. et. al
  • In Earth-Sun System Technology Conference,
  • 2005
Highly Influential
3 Excerpts

Notes on design and implementation of compressed bit vectors

  • K. Wu, E. J. Otoo, A. Shoshani, H. Nordberg
  • Technical report, Lawrence Berkley National…
  • 2001
2 Excerpts

Similar Papers

Loading similar papers…