Function test_optimized_performance

python/tests/test_optimized_bplus_tree.py:295–367

Compare optimized vs original B+ tree performance.

()

def test_optimized_performance():
    """Compare optimized vs original B+ tree performance."""
    print("Optimized B+ Tree Performance Test")
    print("=" * 60)

    sizes = [1000, 10000, 50000]

    for size in sizes:
        print(f"\nData Size: {size:,} items")
        print("-" * 40)

        keys = list(range(size))
        random.shuffle(keys)

        # Test insertion
        print("\nInsertion Performance:")

        # Original
        gc.collect()
        start = time.perf_counter()
        original = BPlusTreeMap(capacity=128)
        for key in keys:
            original[key] = key * 2
        original_time = time.perf_counter() - start

        # Optimized
        gc.collect()
        start = time.perf_counter()
        optimized = OptimizedBPlusTree(capacity=128)
        for key in keys:
            optimized[key] = key * 2
        optimized_time = time.perf_counter() - start

        improvement = (original_time - optimized_time) / original_time * 100
        print(f"  Original:  {original_time:.4f}s ({original_time/size*1e6:.1f} μs/op)")
        print(
            f"  Optimized: {optimized_time:.4f}s ({optimized_time/size*1e6:.1f} μs/op)"
        )
        print(f"  Improvement: {improvement:.1f}%")

        # Test lookup
        print("\nLookup Performance:")
        lookup_keys = random.sample(keys, min(1000, size))

        # Original
        gc.collect()
        start = time.perf_counter()
        for _ in range(10):
            for key in lookup_keys:
                _ = original[key]
        original_lookup = time.perf_counter() - start

        # Optimized
        gc.collect()
        start = time.perf_counter()
        for _ in range(10):
            for key in lookup_keys:
                _ = optimized[key]