[Solved] SOLVED:Homework 5 / Quiz 3

## Research one of the below topics:

1. B-Trees2. K-d Trees3. Red-Black Trees4. Suffix Arrays / PATRICIA Trees5. Priority Queues6. Heap Sort7. Quick Sort8. Merge Sort9. Short URL

Your source can be a journal article (research or technology note) or anarticle online in a tech-trade magazine. Blogs are not allowed unless they arecomparing and contrast (If you have trouble accessing any articles see theConsolidated Information Center or contact me if they cannot help). Your workmay not directly use the textbook implementation we discussed (e.g. Google’sBig Table). But you must identify what is different about the approach.

Discuss how the topic was applied to solve a particular problem. Your textshould identify who was involved, what they did, when they did it, where it isbeing used, and why they used it.

## The Assignment Deliverable1. Formata. Write a 2 page double spaced report.b. 12 point font (Times New Roman).c. 1” Margins and only your name for a header. Adding additional text will result in 20 points off (e.g. 10% of the total grade)2. Paper Structurea. Introduction (1 paragraph)b. Background to Problem they solvedc. Methods of Solving (what data structures did they use)d. Discussion (1 paragraph)3. Submit a copy through ANGEL (http://lms.wsu.edu)4. Bring a hardcopy to class.Possibly References

## Some possible places to start your search1. Google’s Big Tablea. http://static.googleusercontent.com/media/research.google.com/en/us/archive/bigtable-osdi06.pdf2. k-d trees for ray-tracinga. http://en.wikipedia.org/wiki/Ray_tracing_(graphics)3. k-d trees for proteomicsa. http://www.pnas.org/content/early/2009/08/25/0904100106.full.pdf4. MD5 Hasha. http://en.wikipedia.org/wiki/MD55. Suffix Arrays / TRIESa. http://en.wikipedia.org/wiki/Trie

Also have a look at Slashdot for ideas. Google Scholar has great references. Or have a look at CiteSeerX from Princeton.