1 views collected around this technical thread.
The article explains how to retrieve coupon templates linked to a specific product ID in MySQL, compares a simple LIKE‑based fuzzy search with a more accurate multi‑value JSON index approach, and provides step‑by‑step SQL code and performance considerations.
This article explains how to use Redis Sorted Sets and Hashes to achieve efficient pagination, fuzzy multi‑condition queries, and their combination, while also discussing performance‑optimisation strategies such as temporary ZSet expiration and data‑freshness handling, before concluding with a brief promotional segment.
This article explains how to retrieve coupon templates linked to a specific product ID in MySQL, comparing a simple fuzzy‑search approach with a more accurate and performant multi‑value JSON index solution, and provides step‑by‑step SQL code examples.
The article presents a Spring Boot 3.4 solution that uses Redis SortedSet for fast pagination and Hash with HSCAN for multi‑condition fuzzy search, combining them via a temporary ZSet with TTL to deliver high‑performance, memory‑efficient queries on complex data sets.
This article examines the challenges of fuzzy searching encrypted data and presents three categories of solutions—naïve in‑memory decryption, conventional database‑level approaches, and advanced algorithmic methods—evaluating their implementation steps, security implications, and performance trade‑offs.
This article introduces Fuse.js, a dependency‑free JavaScript library for client‑side fuzzy searching, explains its core concepts, installation methods, basic usage with code examples, and advanced configuration options for customizing search behavior.
This article explains how to implement pagination, multi‑condition fuzzy search, and their combination using Redis Sorted Sets and Hashes, discusses performance optimizations and expiration strategies, and also contains promotional material for ChatGPT services and a community offering.
By leveraging Redis sorted sets for ordered pagination and hash fields with HSCAN for multi‑condition fuzzy matching, the article shows how to build a cached query pipeline that creates temporary ZSets keyed by pattern, supports efficient page retrieval, and uses expirations and refresh strategies to balance freshness and performance.
This article examines why encrypted data is unfriendly to fuzzy search, categorises three implementation strategies—naïve, conventional, and advanced—analyses their advantages and disadvantages, and provides practical guidance and reference links for securely enabling fuzzy queries on encrypted fields.
This article examines the challenges of fuzzy searching encrypted data and compares three implementation approaches—naïve, conventional, and advanced—detailing their principles, performance implications, storage costs, and security trade‑offs, ultimately recommending the conventional token‑based method for most practical applications.
This article examines the challenges of fuzzy searching encrypted data and compares three categories of solutions—naïve, conventional, and advanced—detailing their implementation ideas, performance trade‑offs, storage costs, and security implications for real‑world applications.
This article examines various techniques for enabling fuzzy queries on encrypted fields, comparing naive memory‑based methods, conventional token‑based approaches that leverage database indexes, and advanced cryptographic schemes, and recommends practical solutions for real‑world applications.
The article examines why encrypted sensitive fields such as passwords, phone numbers, and bank details need special handling, categorises three families of fuzzy‑search solutions for encrypted data, evaluates their security, performance and storage costs, and recommends a balanced conventional method for production use.
This article reviews three categories of techniques for performing fuzzy queries on encrypted data—naïve (memory‑based), conventional (database‑level encryption or tokenization), and advanced algorithmic solutions—detailing their implementation ideas, advantages, drawbacks, and practical recommendations.
This article explores multiple strategies for enabling fuzzy search on encrypted phone numbers, including in‑memory caching, database decryption functions, segment‑wise storage, and dedicated fuzzy‑search fields, comparing their trade‑offs in performance, memory usage, and data consistency.
This article explains how to enable fuzzy searches on encrypted sensitive fields such as names, phone numbers, and ID numbers in a Spring Boot backend by using a tokenized ciphertext mapping table, outlining four possible solutions, recommending the tokenized approach, and providing complete configuration and code examples.
This article explains how to use Redis Sorted Sets and Hashes to achieve pagination, fuzzy multi‑condition queries, and their combination, while also discussing performance optimizations such as expiration and update strategies for generated ZSet collections.
This article explains how to enable fuzzy search on encrypted sensitive fields such as phone numbers and ID numbers in a MySQL database by using Spring Boot, AOP, tokenized ciphertext mapping tables, and encrypted keyword queries to balance security and query performance.
This article examines the challenges of fuzzy searching encrypted data and presents three categories of solutions—silly, conventional, and advanced—detailing their implementation ideas, performance trade‑offs, storage costs, and practical recommendations for secure yet searchable data.
This article reviews why reversible encryption is needed for certain sensitive fields, classifies three categories of fuzzy‑search‑on‑encrypted‑data techniques—naïve, conventional, and advanced—and evaluates their implementation steps, performance trade‑offs, and practical recommendations.