B-slack Trees: Space Efficient B-Trees

2014 ◽  
pp. 122-133 ◽  
Author(s):  
Trevor Brown
Keyword(s):  
B Trees

Comments on optimality of B-trees

1983 ◽  
Vol 13 (2) ◽  
pp. 36-38
Author(s):  
Juergen Klonk
Keyword(s):  
B Trees

scholarly journals Concurrent operations on B∗-trees with overtaking

1986 ◽  
Vol 33 (2) ◽  
pp. 275-296 ◽  
Author(s):  
Yehoshua Sagiv
Keyword(s):  
B Trees

Module placement with boundary constraints using B*-trees

2002 ◽  
Vol 149 (4) ◽  
pp. 251-256 ◽  
Author(s):  
J.-M. Lin ◽  
H.-E. Yi ◽  
Y.-W. Chang
Keyword(s):  
Boundary Constraints ◽  
B Trees

Choosing optimal branching factors for k-d-B trees

1985 ◽  
Vol 10 (1) ◽  
pp. 127-134
Author(s):  
K.D. Sharma ◽  
Rekha Rani
Keyword(s):  
B Trees

Deconstructing Web Services

2012 ◽  
Vol 241-244 ◽  
pp. 3171-3174
Author(s):  
Chang Guang Shi
Keyword(s):  
Web Services ◽  
Virtual Machines ◽  
Voice Over Ip ◽  
Current Status ◽  
B Trees

Many experts would agree that, had it not been for telephony, the construction of B-trees might never have occurred. Given the current status of random theory, information theorists urgently desire the unfortunate unification of virtual machines and voice-over-IP, which embodies the unproven principles of robotics. We show that even though voice-over-IP and e-commerce can collaborate to achieve this goal, courseware and Internet QoS can synchronize to realize this mission.

scholarly journals Online bit flip detection for in-memory B-trees on unreliable hardware

2014 ◽  
Author(s):  
Till Kolditz ◽  
Thomas Kissinger ◽  
Benjamin Schlegel ◽  
Dirk Habich ◽  
Wolfgang Lehner
Keyword(s):  
B Trees ◽  
Bit Flip

Sampling from databases using B+-Trees

2002 ◽  
Vol 6 (4) ◽  
pp. 359-377
Author(s):  
Dimuthu Makawita ◽  
Kian-Lee Tan ◽  
Huan Liu
Keyword(s):  
B Trees
Sign in / Sign up

Export Citation Format

Share Document