CST-trees: Cache sensitive T-trees
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Lee I.-H. | - |
dc.contributor.author | Shim J. | - |
dc.contributor.author | Lee S.-G. | - |
dc.contributor.author | Chun J. | - |
dc.date.available | 2021-02-22T15:17:08Z | - |
dc.date.issued | 2007-08 | - |
dc.identifier.issn | 0302-9743 | - |
dc.identifier.uri | https://scholarworks.sookmyung.ac.kr/handle/2020.sw.sookmyung/14976 | - |
dc.description.abstract | Researchers have modified existing index structures into ones optimized for CPU cache performance in main memory database environments. A Cache Sensitive B+-Tree is one of them. It is designed to minimize the impact of cache misses for B+-Trees and it has been known to be more effective than other types of main memory index structure including T-Trees. In this paper, we introduce a Cache Sensitive T-Tree (CST-Tree) and show how T-Trees can also be redesigned to be cache sensitive. We present an experimental performance study which shows that our Cache Sensitive T-Trees can outperform the original T-Trees and Cache Sensitive B+-Trees on average 65 percent and 17 percent, respectively. © Springer-Verlag Berlin Heidelberg 2007. | - |
dc.format.extent | 12 | - |
dc.language | 영어 | - |
dc.language.iso | ENG | - |
dc.publisher | Springer Verlag | - |
dc.title | CST-trees: Cache sensitive T-trees | - |
dc.type | Article | - |
dc.publisher.location | 독일 | - |
dc.identifier.doi | 10.1007/978-3-540-71703-4_35 | - |
dc.identifier.scopusid | 2-s2.0-38049171003 | - |
dc.identifier.bibliographicCitation | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), v.4443 LNCS, pp 398 - 409 | - |
dc.citation.title | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | - |
dc.citation.volume | 4443 LNCS | - |
dc.citation.startPage | 398 | - |
dc.citation.endPage | 409 | - |
dc.type.docType | Conference Paper | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scopus | - |
dc.subject.keywordPlus | Buffer storage | - |
dc.subject.keywordPlus | Data structures | - |
dc.subject.keywordPlus | Database systems | - |
dc.subject.keywordPlus | Optimization | - |
dc.subject.keywordPlus | Trees (mathematics) | - |
dc.subject.keywordPlus | Cache Sensitivity | - |
dc.subject.keywordPlus | Index structures | - |
dc.subject.keywordPlus | Main memory database | - |
dc.subject.keywordPlus | Program processors | - |
dc.identifier.url | https://link.springer.com/chapter/10.1007/978-3-540-71703-4_35 | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
Sookmyung Women's University. Cheongpa-ro 47-gil 100 (Cheongpa-dong 2ga), Yongsan-gu, Seoul, 04310, Korea02-710-9127
Copyright©Sookmyung Women's University. All Rights Reserved.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.