Graph Locality Prefetcher for Graph Database
| dc.contributor.author | Yin, Zhuoran | |
| dc.date.accessioned | 2015-04-30T15:46:56Z | |
| dc.date.embargountil | 2016-04-29T15:46:56Z | |
| dc.date.issued | 2015-04-30 | |
| dc.date.submitted | 2015 | |
| dc.description.abstract | This work presents a hardware prefetcher to improve the performance of accessing graph data representing large and complex networks. We represent complex networks as graphs, and queries amount to traversals on the graph. Unlike conventional memory hierarchies that exploit spatial and temporal locality, we observe that graph traversals do not necessarily exhibit these same notions of locality. This results in degraded performance of the memory hierarchy. Consequently, our hardware prefetcher exploits locality that is intrinsic to graph traversals, which we call graph-locality to improve the performance of the memory hierarchy. We design and evaluate our prototype using a micro-architectural simulator, and deploy benchmarks from GDBench that is oriented to evaluate the performance of graph database systems. | en |
| dc.description.embargoterms | 1 year | en |
| dc.identifier.uri | http://hdl.handle.net/10012/9291 | |
| dc.language.iso | en | en |
| dc.pending | false | |
| dc.publisher | University of Waterloo | en |
| dc.subject | prefetching | en |
| dc.subject | graph-locality | en |
| dc.subject | embedded hardware | en |
| dc.subject.program | Electrical and Computer Engineering | en |
| dc.title | Graph Locality Prefetcher for Graph Database | en |
| dc.type | Master Thesis | en |
| uws-etd.degree | Master of Applied Science | en |
| uws-etd.degree.department | Electrical and Computer Engineering | en |
| uws.peerReviewStatus | Unreviewed | en |
| uws.scholarLevel | Graduate | en |
| uws.typeOfResource | Text | en |