collections-cache 0.3.3.20250303__py3-none-any.whl → 0.3.4.20250303__py3-none-any.whl

{collections_cache-0.3.3.20250303.dist-info → collections_cache-0.3.4.20250303.dist-info}/METADATA

@@ -1,6 +1,6 @@
 Metadata-Version: 2.1
 Name: collections-cache
-Version: 0.3.3.20250303
+Version: 0.3.4.20250303
 Summary: collections-cache is a Python package for managing data collections across multiple SQLite databases. It allows efficient storage, retrieval, and updating of key-value pairs, supporting various data types serialized with pickle. The package uses parallel processing for fast access and manipulation of large collections.
 License: MIT
 Author: Luiz-Trindade
@@ -95,6 +95,31 @@ print(f"Inserted {len(cache.keys())} keys successfully!")
 
 ---
 
+## Performance Benchmark 📊
+
+After optimizing SQLite settings (including setting `synchronous = OFF`), the library has shown a significant performance improvement. The insertion performance has been accelerated dramatically, allowing for much faster data insertions and better scalability.
+
+### Benchmark Results
+
+For **100,000 insertions**:
+
+- **Previous performance**: ~797 insertions per second.
+- **Optimized performance**: **~6,657 insertions per second** after disabling SQLite's synchronization (`synchronous = OFF`), reducing the total insertion time from 125 seconds to **15.02 seconds**.
+
+### Performance Scaling
+
+With the optimized configuration, the library scales nearly linearly with the number of CPU cores. For example:
+
+- **4 cores**: ~6,657 insertions per second.
+- **8 cores**: ~13,300 insertions per second.
+- **16 cores**: ~26,600 insertions per second.
+- **32 cores**: ~53,200 insertions per second.
+- **128 cores**: ~212,000 insertions per second (theoretically).
+
+*Note: Actual performance may vary depending on system architecture, disk I/O, and specific workload, but benchmarks indicate a substantial increase in insertion rate as the number of CPU cores increases.*
+
+---
+
 ## API Overview 📚
 
 - **`set_key(key, value)`**: Stores a key–value pair. Updates the value if the key already exists.
@@ -106,17 +131,6 @@ print(f"Inserted {len(cache.keys())} keys successfully!")
 
 ---
 
-## Performance Benchmark 📊
-
-On a machine with 4 real CPU cores, benchmarks indicate around **781 insertions per second**. The library is designed to scale nearly linearly with the number of real cores. For example:
-- **6 cores**: ~1,171 insertions per second.
-- **16 cores**: ~3,125 insertions per second.
-- **128 cores**: ~25,000 insertions per second (theoretically).
-
-*Note: Actual performance will depend on disk I/O, SQLite contention, and system architecture.*
-
----
-
 ## Development & Contributing 👩‍💻👨‍💻
 
 To contribute or run tests:

collections_cache-0.3.4.20250303.dist-info/RECORD

@@ -0,0 +1,6 @@
+collections_cache/__init__.py,sha256=uUp8lhp-HnZRumnU_8MT6qVq95t0pOzn7oLW7ARbnvc,48
+collections_cache/collections_cache.py,sha256=IuHDhrQlCqX4oC3s7cwJ-spWI28O3uQ4_IZJtdUtLPE,6387
+collections_cache-0.3.4.20250303.dist-info/LICENSE,sha256=RAIL-FmXSiNRgyiVlfhm2SvVI4XDVsN0jDt9207SJ8o,1168
+collections_cache-0.3.4.20250303.dist-info/METADATA,sha256=Vp2xY7SQ2E9wc-qV_D-MyB20NDFBgC-R9xvCrIlH0kQ,5719
+collections_cache-0.3.4.20250303.dist-info/WHEEL,sha256=sP946D7jFCHeNz5Iq4fL4Lu-PrWrFsgfLXbbkciIZwg,88
+collections_cache-0.3.4.20250303.dist-info/RECORD,,

collections_cache-0.3.3.20250303.dist-info/RECORD

@@ -1,6 +0,0 @@
-collections_cache/__init__.py,sha256=uUp8lhp-HnZRumnU_8MT6qVq95t0pOzn7oLW7ARbnvc,48
-collections_cache/collections_cache.py,sha256=IuHDhrQlCqX4oC3s7cwJ-spWI28O3uQ4_IZJtdUtLPE,6387
-collections_cache-0.3.3.20250303.dist-info/LICENSE,sha256=RAIL-FmXSiNRgyiVlfhm2SvVI4XDVsN0jDt9207SJ8o,1168
-collections_cache-0.3.3.20250303.dist-info/METADATA,sha256=uxdp9Cfyq-kSHofaNjjKfCa3hk0OBRk73x0XcLH8Z_g,4993
-collections_cache-0.3.3.20250303.dist-info/WHEEL,sha256=sP946D7jFCHeNz5Iq4fL4Lu-PrWrFsgfLXbbkciIZwg,88
-collections_cache-0.3.3.20250303.dist-info/RECORD,,