DC Field | Value | Language |
---|---|---|
dc.contributor.author | Lim, SC | ko |
dc.contributor.author | Ahn, J | ko |
dc.contributor.author | Kim, Myoung Ho | ko |
dc.date.accessioned | 2013-03-04T15:43:41Z | - |
dc.date.available | 2013-03-04T15:43:41Z | - |
dc.date.created | 2012-04-10 | - |
dc.date.created | 2012-04-10 | - |
dc.date.issued | 2003 | - |
dc.identifier.citation | NEW HORIZONS IN INFORMATION MANAGEMENT BOOK SERIES: LECTURE NOTES IN COMPUTER SCIENCE, v.2712, pp.253 - 260 | - |
dc.identifier.issn | 0302-9743 | - |
dc.identifier.uri | http://hdl.handle.net/10203/83107 | - |
dc.description.abstract | We present a new concurrent B-link-tree algorithm that provides a concurrent tree restructuring mechanism for handling underflow nodes as well as overflow nodes. Our algorithm does not require any lock for downward searching and preserves bottom-up tree restructuring without deadlock. To this end, we develop a new locking mechanism for inserters and deleters and a node update rule that preserves the semantical tree consistency during tree restructuring. Our analytical experiment shows that the overhead of additional disk I/O is acceptable. | - |
dc.language | English | - |
dc.publisher | SPRINGER-VERLAG BERLIN | - |
dc.subject | SEARCH STRUCTURE | - |
dc.subject | OPERATIONS | - |
dc.title | A concurrent B-link-tree algorithm using a cooperative locking protocol | - |
dc.type | Article | - |
dc.identifier.wosid | 000185073400018 | - |
dc.identifier.scopusid | 2-s2.0-35248854503 | - |
dc.type.rims | ART | - |
dc.citation.volume | 2712 | - |
dc.citation.beginningpage | 253 | - |
dc.citation.endingpage | 260 | - |
dc.citation.publicationname | NEW HORIZONS IN INFORMATION MANAGEMENT BOOK SERIES: LECTURE NOTES IN COMPUTER SCIENCE | - |
dc.contributor.localauthor | Kim, Myoung Ho | - |
dc.contributor.nonIdAuthor | Lim, SC | - |
dc.contributor.nonIdAuthor | Ahn, J | - |
dc.type.journalArticle | Article; Proceedings Paper | - |
dc.subject.keywordPlus | SEARCH STRUCTURE | - |
dc.subject.keywordPlus | OPERATIONS | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.