Author:
Saikkonen Riku,Soisalon-Soininen Eljas
Publisher
Oxford University Press (OUP)
Reference39 articles.
1. Rao J. and Ross K.A. (2000) Making B $^+$ -Trees Cache Conscious in Main Memory. 2000 ACM SIGMOD Int. Conf. Management of Data, Dallas, TX, USA, May 16–18, pp. 475–486. ACM Press, New York.
2. Hankins R.A. and Patel J.M. (2003) Effect of Node Size on the Performance of Cache-Conscious B $^+$ -Trees. 2003 ACM SIGMETRICS Int. Conf. Measurement and Modeling of Computer Systems, San Diego, CA, USA, June 10–14, pp. 283–294. ACM Press, New York.
3. Rao J. and Ross K.A. (1999) Cache Conscious Indexing for Decision-Support in Main Memory. 25th Int. Conf. Very Large Data Bases (VLDB 1999), Edinburgh, Scotland, UK, September 7–10, pp. 78–89. Morgan Kaufmann, Burlington.
4. Bender M.A. , Demaine E.D. and Farach-Colton M. (2002) Efficient Tree Layout in a Multilevel Memory Hierarchy. 10th Annual European Symp. Algorithms (ESA 2002), Rome, Italy, September 17–21, Lecture Notes in Computer Science 2461, pp. 165–173. Springer, Berlin.
5. Making T-trees cache conscious on commodity microprocessors;Lee;J. Inf. Sci. Eng.,2011
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献