Shows the B+ tree as it evolves during execution of  the  actions
contained  in  the  log_file.  Click  on  the  nodes to see their
current contents.  Shows the path  followed  during  the  search.
Click  on  the  nodes  too see their contents before the updates.
The contents of the  node  last  selected  in  the  Path_followed
window   are   shown  here.   Step  down  the  trace  file  named
trace_filename lines. The default is 1, but  it  can  be  changed
manually. Breakpoints are ignored.  Same as next 1 Continue until
you encounter a breakpoint.   Creates  a  new  btree,  with  name
btree_name, record length rec_len (in bytes),  using naive delete
algorithm  if  delete_type  =  0,  full   delete   algorithm   if
delete_type  =  1.  It  can  only  be executed before reading any
trace. Upon creating a new btree,  reading  from  trace  file  is
disabled.   Interactively inserts a record with key = key, record
id = {page_no,slot_no}. If the trace  file  is  read,  it's  only
enabled  after  one  full  action  from  the  trace file has been
finished,  i.e.  "DONE"  has  been  read  from  the  trace.  Upon
inserting  any  record interactively, reading from the trace file
is disabled. Interactively deletes  a  record  with  key  =  key,
record  id  =  {page_no,slot_no}. If the trace file is read, it's
only enabled after one full action from the trace file  has  been
finished, i.e. "DONE" has been read from the trace. Upon deleting
any  record  interactively,  reading  from  the  trace  file   is
disabled.
Toggle the Btree  layout  between  the  horizontal  and  vertical
positions.  Print the visible portion of the tree - a window will
pop up to specify the printer options.   Shows  man  page(s)  for
each window.
Tickle_BTree works  as  follows:  Usually  there  exists  a  file
(selected  by  the  user)  which  contains  a  log of the actions
performed on the Btree.(See the next section for  case  when  the
operations  are  input  interactively.)   The  format of the file
should be as specified below: INSERT (or DELETE) rid key DO VISIT
node n1 VISIT node n2 etc ...  SPLIT node nx IN nodes nx1 nx2 (if
necessary) MERGE nodes nx ny (if necessary)  CHILDREN  nx1  nodes
nx1a nx1b ...  CHILDREN nx2 nodes nx2a nx2b ...  SPLIT ...  PUTIN
(or TAKE_FROM) node nx DONE In case the root gets split,  due  to
an  insertion,  the trace_file should contain: ROOTSPLIT IN nodes
n1 n2 CHILDREN n1 ...  NEWROOT n3 In case the root gets  deleted,
due  to  an  deletion,  the trace_file should contain: CHANGEROOT
from node nx to node ny or DEALLOCATEROOT  nx  (if  the  tree  is
empty)  (Tcl  is case sensitive, so the trace file should contain
the info exactly as specified above)
Tickle_BTree  works  with   running   in   the   background   and
incorporates  its  features.  If  a  trace exists and is  read by
Tickle_BTree, the actions in it are executed by while at the same
time the actions (both the logical and the ones taken by the such
as node splitting etc.) are depicted on the screen. The and nodes
are  shown  with  different  bitmaps. By clicking on any node the
user can see its contents.  The trace  file  is  generated  by  a
btree  driver  program. There is a template program called btree-
template.C which illustrates  how  to  create  a  btree,  how  to
specify  its  record length and delete algorithm to use and where
trace goes. It also shows how to generate record from an  integer
key  or string key and how to insert/delete records. The user can
also choose to input actions  interactively  which  will  disable
reading  from  trace.  In  this case, the actions (just insert or
delete) chosen by the user are executed by minibase while at  the
same  time  the trace generated by minibase is used to change the
shape of the tree.
Breakpoints can be inserted in the trace_file by inserting a line
with  a * as its only character. Only the cont button acts on the
breakpoints.
Click on the node name rather than the bitmap.  Unknown yet.