| Document Date: 2013-12-06 16:23:06
Open Document File Size: 777,28 KBShare Result on Facebook
City Hangzhou / / Company Creative Commons / Intel / / Country China / / Currency AMD / / / Facility Informatics University of Edinburgh / / IndustryTerm memory technologies / equi-join processing / segment algorithms / in-memory algorithm / block devices / write-limited sort algorithms / database processing stack / database server / read-intensive algorithm / query processing operations / query processing / evaluation algorithm / database systems / 4GHz processor / aggressive algorithm / storage device / individual algorithms / plus-sign solution / memory technology / runtime algorithms / query processor / later processing / physical operator / lazy processing / lazy sort algorithm / data processing stack / universal storage device / / NaturalFeature MT )r m(M / MT )r / / OperatingSystem Linux / GNU / GNU /Linux / / Organization VLDB Endowment / Stratis D. Viglas School / University of Edinburgh / U.S. Securities and Exchange Commission / / Position programmer / / ProgrammingLanguage T / C++ / / ProvinceOrState Wisconsin / / Technology read-intensive algorithm / write-limited sort algorithms / write/read ratio Write-limited algorithms / memory technology / sorting algorithms / memory technologies / RAM / two sorting algorithms / flash memory / SegJ algorithm / aggressive algorithm / Java / remaining algorithms / Linux / ALGORITHMIC FRAMEWORK Our algorithms / API / LaJ algorithm / evaluation algorithm / lazy sort algorithm / cache memory / query processor / 1.1 Sorting algorithms / caching / random access / operating system / Choosing segment algorithms / runtime algorithms / write-limited algorithms / flash / lazy algorithm / two algorithms / in-memory algorithm / 4GHz processor / / URL http /
SocialTag |
Write-limited sorts and joins for persistent memory Stratis D. Viglas School of Informatics University of Edinburgh, UK [removed]