Skip Navigation

The Computer Journal 2000 43(5):420-429; doi:10.1093/comjnl/43.5.420
© 2000 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (1)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Manousaka, A.
Right arrow Articles by Manolopoulos, Y.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Fringe Analysis of 2–3 Trees with Lazy Parent Split

Antigoni Manousaka1 and Yannis Manolopoulos1

1 Department of Informatics, Aristotle University, Thessaloniki 54006, Greece Email: manolopo@delab.csd.auth.gr

B-trees with lazy parent split (lps) are B-tree variants, according to which parent splits are postponed until a future access of the latter node. This way, the number of splits during an insert is decreased and the number of locks is also decreased. Consequently, better concurrency is achieved. In this paper 2–3 trees with lps are studied. Fringe analysis is used to obtain bounds on some performance metrics of 2–3 trees with lps. The performance metrics of 2–3 tree with lps are compared with those of the classical 2–3 trees. The conclusions are that 2–3 trees with lps have slightly better performance, more keys in the fringe, larger storage utilization and a slightly shorter path length from the root to the leaves.

Received 19 May, 1998. Revised 12 September, 2000.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.