Video wird geladen...

Video konnte nicht geladen werden

Zur Startseite

Building RAG is easy. Parsing real, unstructured data is the hard part. Most tools fail when documents get complicated. RAGFlow by InfiniFlow makes the entire process visual and flawless 🔥 It is an (open-source!) engine built specifically to find the exact needle in a data haystack, even across literally...

19,220 Aufrufe • vor 4 Monaten •via X (Twitter)

0 Kommentare

Keine Kommentare verfügbar

Kommentare vom Original-Post werden hier angezeigt

Ähnliche Videos

Google just wired DeepMind and Earth Engine directly into the biggest geospatial dataset on the planet. For two decades, millions of people used Google Earth to scale the Himalayas or zoom in on their childhood neighbourhoods. In 2026, Google is basically trying to shift the entire platform toward professional execution. They turned a massive digital twin of the world into an agentic AI engine for global infrastructure. The technical foundation is (obviously) all about data. Google integrated 20-metre and 40-metre elevation contours globally. Engineers and urban planners now have instant access to the exact topographic context required for site planning anywhere on Earth. The data catalogue updates continuously to maintain the freshest imagery possible. Collaboration used to kill geospatial projects. Teams would lose momentum through stale materials or bad handoffs. Google fixed this by building frictionless data import systems. You can now drop KML, KMZ, and GeoJSON files directly onto the global map. Entire departments can align on a single source of truth, moving from a raw question to a definitive answer instantly. The biggest upgrade is the introduction of agentic geospatial intelligence. Users can open 'Ask Google Earth' and search massive satellite and Street View databases using natural language. You type a command, and the AI handles the manual data wrangling. It identifies new site locations and analyses infrastructure before you even open a spreadsheet.

Yohan

45,065 Aufrufe • vor 4 Monaten

There’s been two papers released in the past couple months, one by Google and one by NVIDIA, that argue that ordering the documents retrieved by RAG systems can enhance performance. However, they both give two different strategies on HOW these documents should be ordered 🤔 Both papers agree on two main points: 1️⃣ There’s a fundamental issue in RAG - as more documents are retrieved, more irrelevant context (e.g., hard negatives) are introduced, which leads to confusion for the LLM and eventually degrades the quality of the generated output. This is called an inverted-U performance curve. 2️⃣ Ordering the retrieved documents is a key lever for optimizing RAG performance. Google Cloud researchers proposed ordering results based on relevance scores: The authors in this paper argue for relevance-based reordering, or ordering the retrieved chunks based on their similarity scores, so the most relevant documents are at the beginning and the end of the inputs to counter the “lost in the middle” effect. NVIDIA researchers proposed ordering results based on the original sequence of document chunks: The authors of this paper argue for Order-Preserving Reordering, or Order-Preserve RAG (OP-RAG), to maintain the logically coherent content flow of the document. So they preserved the original order of retrieved document chunks in the source text, instead of ranking them by relevance scores. So which one is right? It probably depends on the specific use case and dataset - relevance-based reordering could perform better in tasks where you need fast access to the most critical information (e.g., fact retrieval, QA systems), while order-preserving RAG might be better where you need to understand the sequential structure of information (e.g., narrative or legal documents). There are still so many uncertainties in AI - we don’t actually know what we’re doing, and it takes awhile to figure out the best strategies for most things! Excited to see more research about this.

Victoria Slocum

15,333 Aufrufe • vor 1 Jahr

Big moment for Postgres! Search has always been Postgres' weak spot, and everyone just accepted it. If you needed a real relevance-ranked keyword search, the default answer was to spin up Elasticsearch or add Algolia and deal with the data sync headaches forever. The problem isn't that Postgres can't do text search. It can. But the built-in `ts_rank` function uses a basic term frequency algorithm that doesn't come close to what modern search engines deliver. So teams end up: - Running a separate Elasticsearch cluster just for search - Building sync pipelines that inevitably drift out of consistency - Paying for managed search services that charge per query - Accepting mediocre search relevance because "good enough" ships faster But this is actually a solvable problem. You can realistically bring industry-standard search ranking directly into Postgres, which eliminates the need for external infra entirely. This exact solution is now available with the newly open-sourced pg_textsearch by Tiger Data - Creators of TimescaleDB, a Postgres extension that brings true BM25 relevance ranking into the database. BM25 is the algorithm behind Elasticsearch, Lucene, and most modern search engines. Now it runs natively in Postgres. Here's what pg_textsearch enables: - True BM25 ranking with configurable parameters (the same algorithm powering production search systems) - Simple SQL syntax: `ORDER BY content 'search terms'` - Works with Postgres text search configurations for multiple languages - Pairs naturally with pgvector for hybrid keyword + semantic search That last point matters a lot for RAG apps. The video below shows this in action, and I worked with the team to put this together. You can now do hybrid retrieval (combining keyword matching with vector similarity) in a single database, without stitching together multiple systems. The syntax is clean enough that you can add relevance-ranked search to existing queries in minutes. pg_textsearch is fully open-source under the PostgreSQL license. You can find a link to their GitHub repo in the next tweet.

Akshay 🚀

215,344 Aufrufe • vor 6 Monaten