<?xml version="1.0" encoding="UTF-8"?><rss xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:atom="http://www.w3.org/2005/Atom" version="2.0"><channel><title><![CDATA[pgvector 做小团队知识库够不够？]]></title><description><![CDATA[<p dir="auto">我们团队已经有 PostgreSQL，想直接 pgvector。会不会后面被坑到重构？</p>
]]></description><link>https://localaihub.com/topic/57/pgvector-做小团队知识库够不够</link><generator>RSS for Node</generator><lastBuildDate>Wed, 03 Jun 2026 19:20:10 GMT</lastBuildDate><atom:link href="https://localaihub.com/topic/57.rss" rel="self" type="application/rss+xml"/><pubDate>Sat, 02 May 2026 20:59:00 GMT</pubDate><ttl>60</ttl><item><title><![CDATA[Reply to pgvector 做小团队知识库够不够？ on Sun, 03 May 2026 19:29:00 GMT]]></title><description><![CDATA[<p dir="auto">结论可以保守：pgvector 先跑，抽象 collection 接口，别把业务绑死在 SQL 细节里。</p>
]]></description><link>https://localaihub.com/post/138</link><guid isPermaLink="true">https://localaihub.com/post/138</guid><dc:creator><![CDATA[rootless]]></dc:creator><pubDate>Sun, 03 May 2026 19:29:00 GMT</pubDate></item><item><title><![CDATA[Reply to pgvector 做小团队知识库够不够？ on Sun, 03 May 2026 17:28:00 GMT]]></title><description><![CDATA[<p dir="auto">做个压测就行。top_k、过滤、rerank、生成分开打点，不要只看总耗时。</p>
]]></description><link>https://localaihub.com/post/137</link><guid isPermaLink="true">https://localaihub.com/post/137</guid><dc:creator><![CDATA[小乔同学]]></dc:creator><pubDate>Sun, 03 May 2026 17:28:00 GMT</pubDate></item><item><title><![CDATA[Reply to pgvector 做小团队知识库够不够？ on Sun, 03 May 2026 16:07:00 GMT]]></title><description><![CDATA[<p dir="auto">我们一开始就是 5 个人内部问文档，看来 pgvector 够。</p>
]]></description><link>https://localaihub.com/post/136</link><guid isPermaLink="true">https://localaihub.com/post/136</guid><dc:creator><![CDATA[今天也没睡醒]]></dc:creator><pubDate>Sun, 03 May 2026 16:07:00 GMT</pubDate></item><item><title><![CDATA[Reply to pgvector 做小团队知识库够不够？ on Sun, 03 May 2026 14:50:00 GMT]]></title><description><![CDATA[<p dir="auto">不是不用，是先看你有没有它们解决的问题。没有就别引入。</p>
]]></description><link>https://localaihub.com/post/135</link><guid isPermaLink="true">https://localaihub.com/post/135</guid><dc:creator><![CDATA[林小北]]></dc:creator><pubDate>Sun, 03 May 2026 14:50:00 GMT</pubDate></item><item><title><![CDATA[Reply to pgvector 做小团队知识库够不够？ on Sun, 03 May 2026 13:49:00 GMT]]></title><description><![CDATA[<p dir="auto">那是不是不用 Qdrant/Milvus？</p>
]]></description><link>https://localaihub.com/post/134</link><guid isPermaLink="true">https://localaihub.com/post/134</guid><dc:creator><![CDATA[小树]]></dc:creator><pubDate>Sun, 03 May 2026 13:49:00 GMT</pubDate></item><item><title><![CDATA[Reply to pgvector 做小团队知识库够不够？ on Sun, 03 May 2026 12:55:00 GMT]]></title><description><![CDATA[<p dir="auto">还有备份。Postgres 一起备份很省心，专门向量库又多一套运维。</p>
]]></description><link>https://localaihub.com/post/133</link><guid isPermaLink="true">https://localaihub.com/post/133</guid><dc:creator><![CDATA[半截薯条]]></dc:creator><pubDate>Sun, 03 May 2026 12:55:00 GMT</pubDate></item><item><title><![CDATA[Reply to pgvector 做小团队知识库够不够？ on Sun, 03 May 2026 11:52:00 GMT]]></title><description><![CDATA[<p dir="auto">12 万没啥压力。真正要看并发、更新频率、过滤条件复杂度。</p>
]]></description><link>https://localaihub.com/post/132</link><guid isPermaLink="true">https://localaihub.com/post/132</guid><dc:creator><![CDATA[小路灯]]></dc:creator><pubDate>Sun, 03 May 2026 11:52:00 GMT</pubDate></item><item><title><![CDATA[Reply to pgvector 做小团队知识库够不够？ on Sun, 03 May 2026 09:10:00 GMT]]></title><description><![CDATA[<p dir="auto">我们 12 万 chunk，768 维，pgvector 现在还行。慢的是 PDF 入库，不是查。</p>
]]></description><link>https://localaihub.com/post/131</link><guid isPermaLink="true">https://localaihub.com/post/131</guid><dc:creator><![CDATA[小郑]]></dc:creator><pubDate>Sun, 03 May 2026 09:10:00 GMT</pubDate></item><item><title><![CDATA[Reply to pgvector 做小团队知识库够不够？ on Sun, 03 May 2026 06:15:00 GMT]]></title><description><![CDATA[<p dir="auto">如果你们 RLS 已经用起来，权限过滤会舒服很多，但别忘了应用层也要带 tenant 条件。</p>
]]></description><link>https://localaihub.com/post/130</link><guid isPermaLink="true">https://localaihub.com/post/130</guid><dc:creator><![CDATA[MingK]]></dc:creator><pubDate>Sun, 03 May 2026 06:15:00 GMT</pubDate></item><item><title><![CDATA[Reply to pgvector 做小团队知识库够不够？ on Sun, 03 May 2026 04:22:00 GMT]]></title><description><![CDATA[<p dir="auto">弱点是向量服务能力没有专门库丰富，监控和分片也要自己想。</p>
]]></description><link>https://localaihub.com/post/129</link><guid isPermaLink="true">https://localaihub.com/post/129</guid><dc:creator><![CDATA[小唐]]></dc:creator><pubDate>Sun, 03 May 2026 04:22:00 GMT</pubDate></item><item><title><![CDATA[Reply to pgvector 做小团队知识库够不够？ on Sun, 03 May 2026 01:45:00 GMT]]></title><description><![CDATA[<p dir="auto">pgvector 的优势是简单和事务。你能把 doc 表、chunk 表、权限表、向量都放一起管。</p>
]]></description><link>https://localaihub.com/post/128</link><guid isPermaLink="true">https://localaihub.com/post/128</guid><dc:creator><![CDATA[nora]]></dc:creator><pubDate>Sun, 03 May 2026 01:45:00 GMT</pubDate></item><item><title><![CDATA[Reply to pgvector 做小团队知识库够不够？ on Sat, 02 May 2026 23:40:00 GMT]]></title><description><![CDATA[<p dir="auto">我踩过 IVFFlat 没 analyze，召回看起来怪怪的。后来发现不是模型问题。</p>
]]></description><link>https://localaihub.com/post/127</link><guid isPermaLink="true">https://localaihub.com/post/127</guid><dc:creator><![CDATA[小吴]]></dc:creator><pubDate>Sat, 02 May 2026 23:40:00 GMT</pubDate></item><item><title><![CDATA[Reply to pgvector 做小团队知识库够不够？ on Sat, 02 May 2026 22:20:00 GMT]]></title><description><![CDATA[<p dir="auto">但索引参数要认真看。HNSW、IVFFlat 不是“建了就完事”。</p>
]]></description><link>https://localaihub.com/post/126</link><guid isPermaLink="true">https://localaihub.com/post/126</guid><dc:creator><![CDATA[小乔同学]]></dc:creator><pubDate>Sat, 02 May 2026 22:20:00 GMT</pubDate></item><item><title><![CDATA[Reply to pgvector 做小团队知识库够不够？ on Sat, 02 May 2026 21:54:00 GMT]]></title><description><![CDATA[<p dir="auto">数据量不大、团队小、权限和业务数据都在 Postgres，pgvector 很合适。先别为未来百万级焦虑。</p>
]]></description><link>https://localaihub.com/post/125</link><guid isPermaLink="true">https://localaihub.com/post/125</guid><dc:creator><![CDATA[rootless]]></dc:creator><pubDate>Sat, 02 May 2026 21:54:00 GMT</pubDate></item></channel></rss>