Matches in SemOpenAlex for { <https://semopenalex.org/work/W4315784865> ?p ?o ?g. }
Showing items 1 to 76 of
76
with 100 items per page.
- W4315784865 endingPage "161" @default.
- W4315784865 startingPage "148" @default.
- W4315784865 abstract "Previous chapter Next chapter Full AccessProceedings 2023 Proceedings of the Symposium on Algorithm Engineering and Experiments (ALENEX)Optimizing Search Layouts in Packed Memory ArraysBrian Wheatman, Randal Burns, Aydın Buluç, and Helen XuBrian Wheatman, Randal Burns, Aydın Buluç, and Helen Xupp.148 - 161Chapter DOI:https://doi.org/10.1137/1.9781611977561.ch13PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAboutAbstract This paper introduces Search-optimized Packed Memory Arrays (SPMAs), a collection of data structures based on Packed Memory Arrays (PMAs) that address suboptimal search via cache-optimized search layouts. Traditionally, PMAs and B-trees have tradeoffs between searches/inserts and scans: B-trees were faster for searches and inserts, while PMAs were faster for scans. Our empirical evaluation shows that SPMAs overcome this tradeoff for unsorted input distributions: on average, SPMAs are faster than B+-trees (a variant of B-trees optimized for scans) on all major operations. We generated datasets and search/insert workloads from the Yahoo! Cloud Serving Benchmark (YCSB) and found that SPMAs are about 2× faster than B+-trees regardless of the ratio of searches to inserts. On uniform random inputs, SPMAs are on average between 1.3× −2.3× faster than B+-trees on all operations. Finally, we vary the amount of sortedness in the inputs to stress the worst-case insert distribution in the PMA. We find that the worst-case B+-tree insertion throughput is about 1.5× faster than the worst-case PMA insertion throughput. However, the worst-case input for the PMA is sorted and highly unlikely to appear naturally in practice. The SPMAs maintain higher insertion throughput than the B+-tree when the input is up to 25% sorted. Previous chapter Next chapter RelatedDetails Published:2023eISBN:978-1-61197-756-1 https://doi.org/10.1137/1.9781611977561Book Series Name:ProceedingsBook Code:PRAL23Book Pages:iii-213" @default.
- W4315784865 created "2023-01-13" @default.
- W4315784865 creator A5004423945 @default.
- W4315784865 creator A5010859893 @default.
- W4315784865 creator A5035719914 @default.
- W4315784865 creator A5084849539 @default.
- W4315784865 date "2023-01-01" @default.
- W4315784865 modified "2023-10-16" @default.
- W4315784865 title "Optimizing Search Layouts in Packed Memory Arrays" @default.
- W4315784865 doi "https://doi.org/10.1137/1.9781611977561.ch13" @default.
- W4315784865 hasPublicationYear "2023" @default.
- W4315784865 type Work @default.
- W4315784865 citedByCount "0" @default.
- W4315784865 crossrefType "book-chapter" @default.
- W4315784865 hasAuthorship W4315784865A5004423945 @default.
- W4315784865 hasAuthorship W4315784865A5010859893 @default.
- W4315784865 hasAuthorship W4315784865A5035719914 @default.
- W4315784865 hasAuthorship W4315784865A5084849539 @default.
- W4315784865 hasConcept C111919701 @default.
- W4315784865 hasConcept C113174947 @default.
- W4315784865 hasConcept C11413529 @default.
- W4315784865 hasConcept C114614502 @default.
- W4315784865 hasConcept C115537543 @default.
- W4315784865 hasConcept C125583679 @default.
- W4315784865 hasConcept C127413603 @default.
- W4315784865 hasConcept C13280743 @default.
- W4315784865 hasConcept C157764524 @default.
- W4315784865 hasConcept C173608175 @default.
- W4315784865 hasConcept C185798385 @default.
- W4315784865 hasConcept C205649164 @default.
- W4315784865 hasConcept C207024777 @default.
- W4315784865 hasConcept C23123220 @default.
- W4315784865 hasConcept C2780098074 @default.
- W4315784865 hasConcept C33923547 @default.
- W4315784865 hasConcept C41008148 @default.
- W4315784865 hasConcept C555944384 @default.
- W4315784865 hasConcept C66938386 @default.
- W4315784865 hasConcept C97854310 @default.
- W4315784865 hasConceptScore W4315784865C111919701 @default.
- W4315784865 hasConceptScore W4315784865C113174947 @default.
- W4315784865 hasConceptScore W4315784865C11413529 @default.
- W4315784865 hasConceptScore W4315784865C114614502 @default.
- W4315784865 hasConceptScore W4315784865C115537543 @default.
- W4315784865 hasConceptScore W4315784865C125583679 @default.
- W4315784865 hasConceptScore W4315784865C127413603 @default.
- W4315784865 hasConceptScore W4315784865C13280743 @default.
- W4315784865 hasConceptScore W4315784865C157764524 @default.
- W4315784865 hasConceptScore W4315784865C173608175 @default.
- W4315784865 hasConceptScore W4315784865C185798385 @default.
- W4315784865 hasConceptScore W4315784865C205649164 @default.
- W4315784865 hasConceptScore W4315784865C207024777 @default.
- W4315784865 hasConceptScore W4315784865C23123220 @default.
- W4315784865 hasConceptScore W4315784865C2780098074 @default.
- W4315784865 hasConceptScore W4315784865C33923547 @default.
- W4315784865 hasConceptScore W4315784865C41008148 @default.
- W4315784865 hasConceptScore W4315784865C555944384 @default.
- W4315784865 hasConceptScore W4315784865C66938386 @default.
- W4315784865 hasConceptScore W4315784865C97854310 @default.
- W4315784865 hasLocation W43157848651 @default.
- W4315784865 hasOpenAccess W4315784865 @default.
- W4315784865 hasPrimaryLocation W43157848651 @default.
- W4315784865 hasRelatedWork W2010169578 @default.
- W4315784865 hasRelatedWork W2014885775 @default.
- W4315784865 hasRelatedWork W2060166871 @default.
- W4315784865 hasRelatedWork W2167951155 @default.
- W4315784865 hasRelatedWork W2355051413 @default.
- W4315784865 hasRelatedWork W2372066122 @default.
- W4315784865 hasRelatedWork W2381288258 @default.
- W4315784865 hasRelatedWork W2624026505 @default.
- W4315784865 hasRelatedWork W3179576741 @default.
- W4315784865 hasRelatedWork W4244087614 @default.
- W4315784865 isParatext "false" @default.
- W4315784865 isRetracted "false" @default.
- W4315784865 workType "book-chapter" @default.