queen-mq 0.1.1 → 0.1.2

package/LICENSE.md

@@ -0,0 +1,202 @@
+
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright 2023 Helium S.r.l
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

package/README.md

@@ -9,9 +9,11 @@
 
 [Quick Start](#-quick-start) • [Client Examples](#-client-examples) • [Server Setup](#-server-setup) • [Core Concepts](#-core-concepts) • [API Reference](#-http-api-reference) • [Dashboard](#-dashboard)
 
-</div>
+<p align="center">
+  <img src="assets/queen-logo.svg" alt="Queen Logo" width="120" />
+</p>
 
-![Queen Dashboard](assets/dashboard.png)
+</div>
 
 ---
 
@@ -22,12 +24,14 @@
 ### Why Queen?
 
 **🚀 Developer-First API**
-- **4 methods, infinite patterns**: `queue()`, `push()`, `take()`, `ack()`
+- **4 core methods, infinite patterns**: `queue()`, `push()`, `take()`, `ack()`
 - **Async iteration**: Process messages with familiar `for await` syntax
+- **Batch processing**: Use `takeBatch()` for 250k+ msg/sec throughput on millions of messages
 - **Smart addressing**: `orders/urgent@workers` - queue, partition, and consumer group in one
 
 **⚡ Production-Ready Performance**
-- **10,000+ msg/sec** throughput with sub-10ms latency
+- **100,000+ msg/sec** throughput with cursor-based consumption
+- **Constant-time batch operations** - O(batch_size) regardless of queue depth
 - **Long polling** for event-driven, real-time message delivery
 - **Partition locking** prevents duplicate processing across consumers
 - **Connection pooling** and optimized batch operations
@@ -49,6 +53,7 @@
 - **Rich Analytics**: Throughput, lag, queue depth metrics
 - **Message Browser**: Search, inspect, and retry messages
 - **System Health**: Database, memory, and performance metrics
+- **Cursor Tracking**: Monitor consumption progress per consumer group
 
 ### Use Cases
 
@@ -67,6 +72,7 @@
 - [Client Examples](#-client-examples)
 - [Server Setup](#-server-setup)
 - [Core Concepts](#-core-concepts)
+- [Cursor-Based Consumption Strategy](#-cursor-based-consumption-strategy)
 - [HTTP API Reference](#-http-api-reference)
 - [Dashboard](#-dashboard)
 - [Configuration](#-configuration)
@@ -252,6 +258,26 @@ for await (const message of client.take('orders/urgent')) {
   await processUrgentOrder(message.data);
   await client.ack(message);
 }
+
+// Use takeBatch to get arrays of messages (higher throughput)
+for await (const messages of client.takeBatch('orders', { 
+  batch: 1000,     // Fetch 1000 at a time
+  wait: true 
+})) {
+  // messages is an array of up to 1000 messages
+  console.log(`Processing batch of ${messages.length} messages`);
+  
+  try {
+    // Process entire batch
+    await processBatch(messages.map(m => m.data));
+    
+    // Acknowledge entire batch at once (efficient!)
+    await client.ack(messages);  // Pass array for batch ack
+  } catch (error) {
+    // Mark entire batch as failed
+    await client.ack(messages, false, { error: error.message });
+  }
+}
 ```
 
 #### 4. Acknowledge Messages
@@ -313,7 +339,7 @@ for await (const message of client.take('tasks', {
 #### Batch Processing
 
 ```javascript
-// Accumulate and process in batches
+// Method 1: Manual batching with take()
 const batch = [];
 for await (const message of client.take('analytics', { batch: 100 })) {
   batch.push(message);
@@ -328,6 +354,15 @@ for await (const message of client.take('analytics', { batch: 100 })) {
     batch.length = 0;
   }
 }
+
+// Method 2: Direct batch processing with takeBatch() (RECOMMENDED)
+for await (const messages of client.takeBatch('analytics', { batch: 1000 })) {
+  // messages is already an array!
+  await processBatch(messages.map(m => m.data));
+  
+  // Single batch acknowledgment (much faster!)
+  await client.ack(messages);
+}
 ```
 
 #### Parallel Processing with Partitions
@@ -881,6 +916,190 @@ await client.queue('time-sensitive', {
 
 ---
 
+## 🚀 Cursor-Based Consumption Strategy
+
+Queen uses a **cursor-based consumption model** for optimal performance at scale, providing O(batch_size) constant-time operations regardless of queue depth.
+
+### How It Works
+
+Traditional message queues scan through all messages to find pending ones, leading to performance degradation as messages accumulate. Queen's cursor-based approach maintains a position marker (cursor) for each consumer, allowing direct access to the next batch of messages.
+
+**Partition Cursors:**
+
+Each partition maintains a cursor position per consumer group:
+- `last_consumed_created_at`: Timestamp of last consumed message
+- `last_consumed_id`: UUID of last consumed message (tie-breaker for same timestamp)
+- `total_messages_consumed`: Running count of consumed messages
+
+The cursor always moves **forward** in time, ensuring strict FIFO ordering.
+
+### The takeBatch Method
+
+Queen provides two consumption methods:
+
+**1. `take()` - Individual message iterator:**
+```javascript
+// Processes messages one at a time
+for await (const message of client.take('orders', { batch: 1000 })) {
+  await processOrder(message.data);
+  await client.ack(message);
+}
+```
+
+**2. `takeBatch()` - Array iterator (HIGH PERFORMANCE):**
+```javascript
+// Yields arrays of messages - achieves 100k+ msg/s throughput
+for await (const messages of client.takeBatch('orders', { batch: 1000 })) {
+  // messages is an array of up to 1000 message objects
+  await processBatch(messages.map(m => m.data));
+  
+  // Batch acknowledge - single DB transaction for all messages
+  await client.ack(messages);
+}
+```
+
+**Under the hood**, both methods use cursor-based batch retrieval:
+
+```sql
+-- Cursor-based query (simplified)
+SELECT * FROM messages 
+WHERE partition_id = $1 
+  AND id > $2::uuid  -- Start after last cursor position
+ORDER BY created_at ASC, id ASC
+LIMIT $3  -- Batch size
+FOR UPDATE SKIP LOCKED
+```
+
+**Key characteristics:**
+1. **Constant-time**: Performance stays consistent whether you've consumed 0% or 99% of messages
+2. **FIFO guarantee**: Messages always returned in creation order
+3. **Lock-free scanning**: `SKIP LOCKED` prevents contention between consumers
+4. **Efficient**: No table scans - direct cursor-based access using UUIDv7 (time-ordered)
+
+**Performance tip:** Use `takeBatch()` with large batch sizes (1,000-10,000) for maximum throughput. The server fetches messages in batches regardless, but `takeBatch()` gives you the array directly, allowing bulk processing and batch acknowledgment in a single operation.
+
+### Batch Acknowledgment Semantics
+
+Queen handles batch acknowledgments intelligently:
+
+**Partial Success** (some messages succeed, some fail):
+```javascript
+// Batch: 10,000 messages
+// Success: 9,999 messages
+// Failed: 1 message
+
+// Behavior:
+// ✅ Cursor advances past all 10,000 messages
+// ✅ Failed message moved to Dead Letter Queue
+// ✅ Next take() starts from message 10,001
+// ✅ FIFO maintained, no redelivery of successful messages
+```
+
+**Total Batch Failure** (all messages fail):
+```javascript
+// Batch: 10,000 messages
+// Success: 0 messages
+// Failed: 10,000 messages
+
+// Behavior:
+// ❌ Cursor DOES NOT advance
+// ❌ Messages NOT moved to DLQ
+// ✅ Lease released
+// ✅ Next take() gets SAME batch (retry)
+// ✅ Allows recovery from transient failures
+```
+
+This design handles transient failures (network issues, service outages) gracefully while preventing poison messages from blocking the queue.
+
+### Performance Comparison
+
+| Operation | Traditional Approach | Cursor Approach | Improvement |
+|-----------|---------------------|-----------------|-------------|
+| Pop @ 0% consumed | O(partition_size) | O(batch_size) | Same |
+| Pop @ 50% consumed | O(partition_size) | O(batch_size) | **10-100x faster** |
+| Pop @ 99% consumed | O(partition_size) | O(batch_size) | **100-1000x faster** |
+
+**Real-world benchmark** (1M messages):
+```
+Traditional:
+  Early batches: 300ms per pop
+  Late batches:  3500ms per pop (10x degradation)
+  
+Cursor-based:
+  Early batches: 150ms per pop
+  Late batches:  200ms per pop (constant!)
+```
+
+### Dead Letter Queue
+
+Individual message failures are moved to the Dead Letter Queue for inspection and manual intervention:
+
+```javascript
+// Monitor DLQ
+const response = await fetch('http://localhost:6632/api/v1/analytics/dlq');
+const dlqMessages = await response.json();
+
+// Inspect failed messages
+for (const msg of dlqMessages) {
+  console.log(`Failed: ${msg.error_message}`);
+  
+  // After fixing issue, can re-push if needed
+  await client.push(msg.queue, fixedPayload);
+}
+```
+
+**DLQ Query:**
+```sql
+SELECT * FROM queen.dead_letter_queue
+WHERE consumer_group = 'my-group'
+ORDER BY failed_at DESC
+LIMIT 100;
+```
+
+### Batch Size Guidelines
+
+Choose batch sizes based on your workload:
+
+**Smaller batches (100-1,000):**
+- ✅ Faster individual batch processing
+- ✅ Less impact if entire batch fails
+- ✅ Lower memory footprint
+- ❌ More network round-trips
+
+**Larger batches (5,000-10,000):**
+- ✅ Higher throughput (100,000+ msg/sec achievable)
+- ✅ Fewer network round-trips
+- ✅ Better database efficiency
+- ❌ More messages retry if entire batch fails
+- ❌ Higher memory usage
+
+**Recommendation:** Start with 1,000-2,000 for balanced performance. Increase to 5,000-10,000 for maximum throughput with reliable processing.
+
+### Monitoring Cursor Progress
+
+Track consumption progress via SQL:
+
+```sql
+-- View cursor positions
+SELECT 
+  p.name as partition,
+  pc.consumer_group,
+  pc.total_messages_consumed,
+  pc.total_batches_consumed,
+  pc.last_consumed_at,
+  EXTRACT(EPOCH FROM (NOW() - pc.last_consumed_at)) as seconds_since_last_consume
+FROM queen.partition_cursors pc
+JOIN queen.partitions p ON p.id = pc.partition_id
+ORDER BY pc.last_consumed_at DESC;
+
+-- Monitor DLQ
+SELECT COUNT(*) as failed_count, consumer_group
+FROM queen.dead_letter_queue
+GROUP BY consumer_group;
+```
+
+---
+
 ## 🔌 HTTP API Reference
 
 Base URL: `http://localhost:6632/api/v1`
@@ -1067,6 +1286,12 @@ POST /api/v1/messages/{transactionId}/dlq
 DELETE /api/v1/queues/{queue}/clear
 ```
 
+**Delete queue:**
+```
+DELETE /api/v1/resources/queues/{queue}
+```
+_Note: Deletes the queue and all its partitions, messages, and related data._
+
 ### System Health
 
 **Health check:**
@@ -1108,10 +1333,12 @@ See [API.md](API.md) for complete API documentation.
 
 Queen includes a comprehensive web dashboard for monitoring and management.
 
+[Dashboard](/assets/dashboard-01.png)
+
 ### Access
 
 1. Start the server: `npm start`
-2. Open browser: `http://localhost:6632`
+2. Open browser: `http://localhost:4000`
 3. WebSocket connection provides real-time updates
 
 ### Features
@@ -1496,7 +1723,7 @@ Promise.all([
 await emitEvents();
 ```
 
-### Example 4: Batch Processing
+### Example 4: Batch Processing (High Throughput)
 
 ```javascript
 import { Queen } from 'queen-mq';
@@ -1515,7 +1742,7 @@ await client.queue('data-processing', {
 // Producer: Send data
 async function sendData() {
   const records = [];
-  for (let i = 0; i < 1000; i++) {
+  for (let i = 0; i < 100000; i++) {
     records.push({ id: i, value: Math.random() });
   }
   
@@ -1523,45 +1750,34 @@ async function sendData() {
   await client.push('data-processing/analytics', records);
 }
 
-// Consumer: Batch processor
+// Consumer: HIGH PERFORMANCE batch processor using takeBatch()
 async function batchProcessor() {
-  const BATCH_SIZE = 100;
-  const batch = [];
+  const BATCH_SIZE = 5000;  // Large batches for 100k+ msg/s throughput
   
-  for await (const message of client.take('data-processing/analytics', {
+  // takeBatch() yields arrays directly - no manual batching needed!
+  for await (const messages of client.takeBatch('data-processing/analytics', {
     batch: BATCH_SIZE,
     wait: true,
     timeout: 30000
   })) {
-    batch.push(message);
-    
-    // Process when batch is full
-    if (batch.length >= BATCH_SIZE) {
-      try {
-        console.log(`Processing batch of ${batch.length} records`);
-        
-        // Extract data
-        const records = batch.map(m => m.data);
-        
-        // Bulk process
-        await bulkInsertToDatabase(records);
-        
-        // Acknowledge all
-        for (const msg of batch) {
-          await client.ack(msg);
-        }
-        
-        console.log(`✓ Batch complete`);
-        batch.length = 0;
-      } catch (error) {
-        console.error('Batch processing failed:', error);
-        
-        // Mark all as failed
-        for (const msg of batch) {
-          await client.ack(msg, false);
-        }
-        batch.length = 0;
-      }
+    try {
+      console.log(`Processing batch of ${messages.length} records`);
+      
+      // Extract data
+      const records = messages.map(m => m.data);
+      
+      // Bulk process (single DB operation)
+      await bulkInsertToDatabase(records);
+      
+      // Batch acknowledge (single DB transaction!)
+      await client.ack(messages);
+      
+      console.log(`✓ Batch complete in single transaction`);
+    } catch (error) {
+      console.error('Batch processing failed:', error);
+      
+      // Mark entire batch as failed (single transaction)
+      await client.ack(messages, false, { error: error.message });
     }
   }
 }
@@ -1569,6 +1785,12 @@ async function batchProcessor() {
 // Run
 await sendData();
 await batchProcessor();
+
+// Performance characteristics:
+// - Batch size 5000: ~100,000 messages/second
+// - Single DB transaction per batch (fetch + ack)
+// - Constant memory usage
+// - No performance degradation as queue grows
 ```
 
 ### Example 5: Scheduled Jobs
@@ -1886,33 +2108,34 @@ Apache License 2.0 - see [LICENSE.md](LICENSE.md) for details.
 
 ## 📈 Performance
 
-**Benchmarks** (PostgreSQL 16, Node.js 22):
-- **Throughput**: 10,000+ messages/second
+**Benchmarks** (PostgreSQL 16, Node.js 22, cursor-based consumption):
+- **Throughput**: 100,000+ messages/second with batch operations
 - **Latency**: < 10ms for immediate pop operations
+- **Constant-time consumption**: O(batch_size) regardless of queue depth
 - **Concurrent Connections**: 1,000+ long polling connections
 - **Database**: Optimized with proper indexing and connection pooling
 
-**Optimization Features:**
+**Cursor-Based Architecture Benefits:**
+- **No performance degradation**: Consistent speed whether queue has 1K or 1B messages
+- **Predictable latency**: 150-200ms per batch throughout entire queue lifecycle
+- **Efficient batch processing**: Direct cursor access eliminates table scans
+- **Scalable to billions**: UUIDv7-based cursor positioning
+
+**Additional Optimization Features:**
 - Connection pooling with configurable size
 - Resource caching for queue/partition lookups
-- Batch operations for bulk inserts/updates
+- Batch operations for bulk inserts/updates (up to 10,000 messages per batch)
 - Optimized SQL queries with proper indexes
 - Event-driven architecture for minimal polling overhead
 - Long polling for real-time message delivery
+- SKIP LOCKED for lock-free concurrent consumption
 
 ---
 
 ## 🎯 Roadmap
 
-- [ ] **Horizontal Scaling**: Better support for multiple server instances
 - [ ] **Message Scheduling**: Cron-like scheduling for recurring jobs
-- [ ] **Priority Lanes**: Dynamic priority adjustment based on load
-- [ ] **Metrics Export**: Prometheus/Grafana integration
-- [ ] **Admin API**: REST API for queue management
 - [ ] **Client Libraries**: Python, Go, Java clients
-- [ ] **Message Tracing**: Distributed tracing integration
-- [ ] **Queue Templates**: Pre-configured queue patterns
-- [ ] **GraphQL API**: Alternative to REST API
 - [ ] **Kubernetes Operator**: Native K8s support
 
 ---
@@ -1921,6 +2144,6 @@ Apache License 2.0 - see [LICENSE.md](LICENSE.md) for details.
 
 **Queen Message Queue System** - Built for performance, reliability, and developer happiness 🚀
 
-Made with ❤️ by [Smartpricing](https://github.com/smartpricing)
+Made with ❤️ by [Smartness](https://github.com/smartpricing)
 
 </div>