Performance Analysis of Y-Tree on Flash Drives

@article{Boonyawat2010PerformanceAO,
  title={Performance Analysis of Y-Tree on Flash Drives},
  author={Narong Boonyawat and Juggapong Natwichai},
  journal={2010 Second International Conference on Computer and Network Technology},
  year={2010},
  pages={472-476}
}
Data warehousing is one of the most important fundamental components of business intelligence. One approach to improve a data warehouse is indexing. Y-tree is a type of index which is designed to facilitate one of the most critical data warehousing functionalities, i.e. data insertion. Y trees support bulk insertion efficiently and also can provide the query performance as efficient as traditional value-list indexes. In this paper, we propose a theoretical study on the performance of the Y-tree… CONTINUE READING

Citations

Publications citing this paper.

Bulk Indexing on Flash Devices

VIEW 2 EXCERPTS
CITES METHODS

References

Publications referenced by this paper.
SHOWING 1-7 OF 7 REFERENCES

Lazy-Update B+-Tree for Flash Devices

  • 2009 Tenth International Conference on Mobile Data Management: Systems, Services and Middleware
  • 2009

Tree Indexing on Flash Disks

  • 2009 IEEE 25th International Conference on Data Engineering
  • 2009
VIEW 2 EXCERPTS

and J

S. T. On, H. Hu, Y. Li
  • Xu, “Lazy-Update B+-Tree for Flash Devices,” Proceedings of the 2009 Tenth international Conference on Mobile Data Management: Systems, Services and Middleware, IEEE Computer Society Washington Publishers
  • 2009
VIEW 1 EXCERPT

Flash storage memory

  • Commun. ACM
  • 2008
VIEW 1 EXCERPT