Sample output from checkpoint run_all.sh script. Your printTree doesn't have
to be indentical to mine.
NOTE: your split result may be slightly different from mine and
it may be a correct implementation. It is required that a node and its
split each are at least 50% full after the split. If the capacity is 8,
each must have at least 4 K* entries after the split.
TEST 1:
insert without splitting:
---------------------
Create Relation 8 tuples
Create new B+Tree index on relation
---------------------
Resulting Index:
***Level: 1 pageId: 2
3 | 00000 stri | 4
Leaf pageId: 3 |
| 4
Leaf pageId: 4 | 00000 stri | 00001 stri | 00002 stri | 00003 stri |
00004 stri | 00005 stri | 00006 stri | 00007 stri |
| 0
TEST 2:
insert with leaf node splitting:
---------------------
Create Relation 10 tuples
Create new B+Tree index on relation
---------------------
Resulting Index:
***Level: 1 pageId: 2
3 | 00000 stri | 4 | 00005 stri | 5
Leaf pageId: 3 |
| 4
Leaf pageId: 4 | 00000 stri | 00001 stri | 00002 stri | 00003 stri |
00004 stri |
| 5
Leaf pageId: 5 | 00005 stri | 00006 stri | 00007 stri | 00008 stri |
00009 stri |
| 0
TEST 3:
insert with leaf node splitting larger:
---------------------
Create Relation 30 tuples
Create new B+Tree index on relation
---------------------
Resulting Index:
***Level: 1 pageId: 2
3 | 00000 stri | 4 | 00005 stri | 5 | 00010 stri | 6 | 00015 stri |
7 | 00020 stri | 8 | 00025 stri | 9
Leaf pageId: 3 |
| 4
Leaf pageId: 4 | 00000 stri | 00001 stri | 00002 stri | 00003 stri |
00004 stri |
| 5
Leaf pageId: 5 | 00005 stri | 00006 stri | 00007 stri | 00008 stri |
00009 stri |
| 6
Leaf pageId: 6 | 00010 stri | 00011 stri | 00012 stri | 00013 stri |
00014 stri |
| 7
Leaf pageId: 7 | 00015 stri | 00016 stri | 00017 stri | 00018 stri |
00019 stri |
| 8
Leaf pageId: 8 | 00020 stri | 00021 stri | 00022 stri | 00023 stri |
00024 stri |
| 9
Leaf pageId: 9 | 00025 stri | 00026 stri | 00027 stri | 00028 stri |
00029 stri |
| 0
TEST 4:
insert with not in-order file:
==============================
-----TESTING Non-inorder insert
---------------------
Create Relation 8 tuples
Create new B+Tree index on relation
---------------------
Resulting Index:
***Level: 1 pageId: 2
3 | 00007 stri | 4
Leaf pageId: 3 | 00000 stri | 00001 stri | 00002 stri | 00003 stri |
00004 stri | 00005 stri | 00006 stri |
| 4
Leaf pageId: 4 | 00007 stri |
| 0
==============================
TEST 5:
reopen:
==============================
------TESTING REOPEN----------
Create Relation of 8 tuples
Create or re-open B+Tree index on relation
---------------------
Resulting Index:
***Level: 1 pageId: 2
3 | 00000 stri | 4
Leaf pageId: 3 |
| 4
Leaf pageId: 4 | 00000 stri | 00001 stri | 00002 stri | 00003 stri |
00004 stri | 00005 stri | 00006 stri | 00007 stri |
| 0
reopen indexrelA.16: relA
Create or re-open B+Tree index on relation
---------------------
Resulting Index:
***Level: 1 pageId: 2
3 | 00000 stri | 4
Leaf pageId: 3 |
| 4
Leaf pageId: 4 | 00000 stri | 00001 stri | 00002 stri | 00003 stri |
00004 stri | 00005 stri | 00006 stri | 00007 stri |
| 0
==============================