On Sun, 20 Mar 2005, Josh Berkus wrote:
whole system make a lot more sense: individual partitions are really tables. The partitioned tables themselves are just meta-objects like views.
If partition is a table, so I could define different indices for them ? In our prototype of scaled full text search we create another index which is optimized for "archived" (not changed) data - it's sort of standard inverted index which is proven to be scaled, while tsearch2's index is good for "online" data. All interfaces ( dictionaries, parsers, ranking) are the same, so it's possible to combine search results. This is rather easy to implement using table inheritance, but I'd like to do this with partitioning
Regards, Oleg _____________________________________________________________ Oleg Bartunov, sci.researcher, hostmaster of AstroNet, Sternberg Astronomical Institute, Moscow University (Russia) Internet: oleg@sai.msu.su, http://www.sai.msu.su/~megera/ phone: +007(095)939-16-83, +007(095)939-23-83
---------------------------(end of broadcast)--------------------------- TIP 6: Have you searched our list archives?
http://archives.postgresql.org
