Making CSB+-Trees processor conscious

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Making CSB+-Trees processor conscious

Full text

Pdf (69 KB)

Source

Data Management On New Hardware archive
Proceedings of the 1st international workshop on Data management on new hardware table of contents

Baltimore, Maryland

SESSION: Query processing using CPUs and NPUs table of contents

Article No. 1

Year of Publication: 2005

Author

Philippe Bonnet

University of Copenhagen

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 47, Citation Count: 2

Additional Information:

references cited by collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/1114252.1114259 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Jun Rao , Kenneth A. Ross, Cache Conscious Indexing for Decision-Support in Main Memory, Proceedings of the 25th International Conference on Very Large Data Bases, p.78-89, September 07-10, 1999
	2	Jun Rao , Kenneth A. Ross, Making B+- trees cache conscious in main memory, Proceedings of the 2000 ACM SIGMOD international conference on Management of data, p.475-486, May 15-18, 2000, Dallas, Texas, United States
	3	Shimin Chen , Phillip B. Gibbons , Todd C. Mowry, Improving index performance through prefetching, Proceedings of the 2001 ACM SIGMOD international conference on Management of data, p.235-246, May 21-24, 2001, Santa Barbara, California, United States
	4	Tobin J. Lehman , Michael J. Carey, A Study of Index Structures for Main Memory Database Management Systems, Proceedings of the 12th International Conference on Very Large Data Bases, p.294-303, August 25-28, 1986
	5	Anastassia Ailamaki , David J. DeWitt , Mark D. Hill , David A. Wood, DBMSs on a Modern Processor: Where Does Time Go?, Proceedings of the 25th International Conference on Very Large Data Bases, p.266-277, September 07-10, 1999
	6	Richard A. Hankins , Jignesh M. Patel, Effect of node size on the performance of cache-conscious B⁺-trees, Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems, June 11-14, 2003, San Diego, CA, USA
	7	[7] M. Samuel and A. Pedersen. Speeding up Main Memory Table Scans in MySQL. DIKU Technical Report 05/03. 2005.
	8	[8] M. Olsen and M. Kristensen. MySQL performance on Itanium 2. DIKU Technical Report 04/15. 2004.
	9	Douglas Comer, Ubiquitous B-Tree, ACM Computing Surveys (CSUR), v.11 n.2, p.121-137, June 1979 [doi>10.1145/356770.356776]
	10	[10] "Intel® Itanium®2 Processor Reference Manual - For Software Devel-opment and Optimization", Order Number: 251110-002, Intel, USA, 2003 21.
	11	[11] Bjarke Mortensen. Beyond Response Time: Analyzing MySQL Performance. DIKU Technical Report 04-04-5. 2005.

CITED BY 2

	Bingsheng He , Qiong Luo, Cache-oblivious nested-loop joins, Proceedings of the 15th ACM international conference on Information and knowledge management, November 06-11, 2006, Arlington, Virginia, USA
	Bingsheng He , Qiong Luo, Cache-oblivious databases: Limitations and opportunities, ACM Transactions on Database Systems (TODS), v.33 n.2, p.1-42, June 2008

Collaborative Colleagues:

Philippe Bonnet: colleagues

Adobe Acrobat

QuickTime

Windows Media Player

Real Player