collections-cache 0.3.3.20250303__tar.gz → 0.3.4.20250419__tar.gz

{collections_cache-0.3.3.20250303 → collections_cache-0.3.4.20250419}/PKG-INFO

@@ -1,6 +1,6 @@
-Metadata-Version: 2.1
+Metadata-Version: 2.3
 Name: collections-cache
-Version: 0.3.3.20250303
+Version: 0.3.4.20250419
 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
@@ -9,6 +9,7 @@ Requires-Python: >=3.12,<4.0
 Classifier: License :: OSI Approved :: MIT License
 Classifier: Programming Language :: Python :: 3
 Classifier: Programming Language :: Python :: 3.12
+Classifier: Programming Language :: Python :: 3.13
 Description-Content-Type: text/markdown
 
 # collections-cache 🚀
@@ -95,6 +96,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 +132,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.3.20250303 → collections_cache-0.3.4.20250419}/README.md

@@ -82,6 +82,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.
@@ -93,17 +118,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.3.20250303 → collections_cache-0.3.4.20250419}/collections_cache/collections_cache.py

@@ -126,6 +126,7 @@ class Collection_Cache:
 
     def get_key(self, key: str):
         """Used to obtain the value stored by the key"""
+        self.get_all_databases()
         self.verify_size_of_temp_queue("get_key")
         try:
             database_to_search = self.keys_databases[key]

{collections_cache-0.3.3.20250303 → collections_cache-0.3.4.20250419}/pyproject.toml

@@ -1,6 +1,6 @@
 [tool.poetry]
 name = "collections-cache"
-version = "0.3.3.20250303"
+version = "0.3.4.20250419"
 description = "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."
 authors = ["Luiz-Trindade <luiz.gabriel.m.trindade@gmail.com>"]
 license = "MIT"