The article traces the evolution of Retrieval‑Augmented Generation from its 2020 Naive baseline through Advanced, Modular, Graph, and Agentic generations, detailing architectural shifts, optimization techniques, self‑correction mechanisms, and future challenges such as long‑context handling and multimodal retrieval.
This article provides an in‑depth analysis of Spring AI Alibaba, comparing it with Spring AI, detailing its four‑layer architecture, GraphCore workflow engine, AgentFramework, enterprise‑grade MCP integration, code examples, pros and cons, suitable scenarios, and future roadmap for Java developers building AI applications.
Given an undirected graph with three edge types—Alice‑only, Bob‑only, and shared—the task is to delete the maximum number of edges while still allowing both Alice and Bob to reach every node; the solution uses a two‑union‑find strategy, processes shared edges first, then exclusive ones, and returns the count or -1.
This article explains how Alibaba Mama’s advertising engine adopted a Serverless, Graph‑as‑a‑Service (GaaS) model to unify budgeting across multiple ad lands, align development‑to‑delivery granularity with graph structures, and dramatically improve testing, experimentation, and production release efficiency.
Facing performance and layout challenges when visualizing thousands of function call nodes, we iterated through Echarts, Ant Design Charts, and finally adopted AntV G6, achieving smooth interaction, automatic layout, and scalable coverage mapping for our link coverage tool.
This article walks you through what Spring AI Alibaba 1.0 offers, highlights its major updates such as the Graph multi‑agent framework and ecosystem integrations, and provides a step‑by‑step upgrade path with Maven dependency changes, code fixes, and configuration adjustments for Java developers.
This article presents the LeetCode 1514 'Maximum Probability Path' problem, explains the algorithm using a priority‑queue approach, provides full Java and C++ implementations, and concludes with a promotional book giveaway encouraging readers to follow the public account.
This article presents LeetCode problem 1514, which asks for the path with the highest success probability in an undirected weighted graph, explains the problem statement, constraints, and provides detailed Java and C++ implementations using a priority‑queue based Dijkstra‑like algorithm.
This article analyzes how Xiaohongshu addresses the decentralization challenge in its recommendation system by strengthening side‑information usage, integrating multimodal signals across the full pipeline, and implementing interest exploration and protection mechanisms, while also outlining future research directions such as generative recommendation and large‑model‑driven user profiling.
This article presents LeetCode problem 797, which asks for all possible paths from node 0 to node n‑1 in a directed acyclic graph, explains the DFS approach, lists constraints and examples, and provides complete implementations in Java, C++, C, and Python.
This article compiles a comprehensive set of Python algorithm templates—including syntax shortcuts, knapsack solutions, backtracking, union‑find, topological sorting, monotonic stacks, binary search, dynamic programming, prefix sums, two‑pointer techniques, tree traversals, and graph algorithms—providing clear code snippets and explanations to help developers ace LeetCode interview problems.
This article examines how misconfigured Kubernetes RBAC permissions can lead to privilege escalation across clusters, presents a graph‑based model to represent users, roles, and authorities, and provides code examples and Cypher queries for detecting and visualizing high‑risk permission paths.
This article provides a concise yet comprehensive overview of relational, key‑value, document, search‑engine, time‑series, vector, spatial, graph, columnar, and multimodel databases, explaining their data models, typical queries, core advantages, and popular implementations to help developers choose the right storage solution for any project.
This article introduces and compares major database categories—including relational, key‑value, document, columnar, graph, and time‑series databases—explaining their structures, typical use cases, and advantages, helping readers understand when to choose each type for various applications.
This article explains how to determine the maximum number of Linux distributions in a connected group by modeling the relationships as an adjacency matrix and applying BFS or DFS to count the largest connected component, with full Python implementations and complexity analysis.
Given an N×N adjacency matrix representing direct connections among N servers, the task is to determine the minimum number of servers that must initiate a broadcast so every server receives the message, with solutions using BFS or DFS to count connected components and detailed Python implementations plus time‑space analysis.
This article explains a graph‑based interview problem where, given an undirected network of N nodes and their connections, you must determine the minimum time for a broadcast node to receive all responses, and provides a full Python BFS solution with complexity analysis.
This article provides a concise yet comprehensive overview of over ten database categories—including relational, key‑value, document, time‑series, vector, spatial, graph, columnar, and multi‑model systems—explaining their core concepts, typical use cases, popular implementations, and underlying storage mechanisms.
This article introduces the basic concepts of graphs, including vertices, edges, directed and undirected types, explains common storage methods such as adjacency matrices and adjacency lists with examples, and demonstrates graph traversal techniques like depth‑first and breadth‑first search using Java code.
This article revisits fundamental graph concepts, clarifies the distinction between graphs and charts, defines nodes, edges, geometry, and properties, and outlines data processing, layout strategies, and rendering approaches using Canvas and SVG, offering a concise roadmap for building a graph engine.
This article describes how Du Xiaoman Financial designed, built, and continuously optimized a massive graph platform—including data governance, graph learning, query performance, data import, and online deployment—to improve credit risk assessment using billions of nodes and edges, and shares practical lessons on graph databases, distributed training, and real‑time inference.
This article presents five programming problems from Hulu's 2022 campus recruitment—including particle simulation, Sophie‑N number counting, optimal activity point on a tree, devil‑maze navigation, and non‑intersecting triangles—complete with problem statements, input/output specifications, sample cases, and detailed solution approaches.
This article introduces graph fundamentals, various application scenarios such as science, code logic, Spark workflows, social networks, and event graphs, then details graph data modeling, analysis, matrix computations, and the deployment of graph neural networks using frameworks like DGL, highlighting practical engineering considerations.
This article introduces core data structures—hash tables, heaps, and graphs—explains their definitions, typical applications, and key algorithms such as shortest‑path (BFS, Dijkstra, Floyd), minimum spanning tree (Prim, Kruskal), and topological sorting, and provides a complete Java implementation of Dijkstra.
This article explains the concepts of task scheduling dependencies and workflow, introduces graph theory basics such as vertices, edges, and DAGs, and provides a complete Go implementation—including graph structures, BFS traversal, topological sorting, and concurrent execution—to efficiently manage dependent tasks in distributed systems.
This article presents a concise Big O cheat sheet that aggregates the time‑complexity notations for common data structures, sorting algorithms, graph and heap operations, and visualizes performance curves, helping readers quickly recall best‑, worst‑, and average‑case scenarios.
This article introduces eight fundamental data structures—arrays, linked lists, stacks, queues, hash tables, trees, heaps, and graphs—explaining their definitions, core operations, typical applications, and key characteristics to help developers build a solid foundation.
This article explains the concept of graphs as data structures, covering vertices, edges, directed and undirected graphs, degrees, and demonstrates how to store graphs using adjacency matrices and adjacency lists, comparing their space and time trade‑offs with clear examples and illustrations.
The article describes how to enforce architectural rules and assess change impact in a modularized JavaScript application by extracting import statements via AST, building a file‑map, constructing a cycle‑aware dependency graph with indexed nodes, and traversing it with a visited‑stack to support forward and reverse analysis across business and public bundles.
This article explains what NoSQL databases are, introduces the CAP theorem that underlies their design trade‑offs, outlines typical application scenarios, discusses their limitations, classifies the main NoSQL families, and reviews four widely used systems—Redis, HBase, Cassandra, and MongoDB.
A 2017 roundup highlights ten innovative database releases—including a time‑series extension for PostgreSQL, a multi‑model Azure service, Google’s globally distributed Spanner, Amazon’s Neptune graph service, and several open‑source cloud‑native databases—detailing their key features, architectures, and intended use cases.
This guide presents concise explanations of essential algorithms—including quick sort, merge sort, bucket and radix sorts, depth‑first and breadth‑first searches, shortest‑path and minimum‑spanning‑tree methods—along with their stability, time‑complexity analyses, greedy strategies, bit‑manipulation tricks, and asymptotic notation, and points to a GitHub repository for reference implementations.
An extensive overview of fundamental data structures—including linked lists, stacks, queues, various tree types, binary search trees, tries, binary indexed trees, segment trees, heaps, hash tables, and graphs—covers definitions, characteristics, time complexities, and visual illustrations to aid understanding and practical implementation.
This article explains the limitations of traditional relational databases, introduces the emergence of NoSQL, categorizes its four main types—key‑value, document‑oriented, column‑family, and graph—detailing popular products, typical use cases, and scenarios where each is unsuitable.
Apache TinkerPop, now a top-level Apache project, offers a powerful graph computing framework with Gremlin, supporting real-time transactional processing and batch analytics across languages, scalable from single machines to massive clusters, making it essential for data mining, analysis, and large‑scale graph applications.
This guide introduces ten core algorithms—including QuickSort, HeapSort, MergeSort, Binary Search, BFPRT, DFS, BFS, Dijkstra, Dynamic Programming, and Naive Bayes—explaining their principles, step‑by‑step procedures, and typical use cases for efficient problem solving.
