[HACKERS] LIMIT and JOINS

between T1 and T2? Do I need to use a full outer join in order to propagate the LIMIT clause?   Thanks   Gregor Zeitlinger LUCAS Product Development   Torex Retail Solutions GmbH   Schwedenstr. 9, D-13359 Berlin Tel. +49 (0) 30 49901-243 Fax +49 (0) 30 49901-139   Mailto:[EMAIL

Re: [HACKERS] Incremental Backup Script

> As per docs, if the databases are rarely updated it could take a long > time for the WAL segment to "roll over". Yes, therefore I want to copy the current WAL (as I said earlier). When restoring, I also want to make sure that I restore exactely to the point when I copied the current WA segment.

Re: [HACKERS] Incremental Backup Script

ractice, restoration using the PITR >method is awkward. Yes, what I am planning to do: 1) drop the corrupted database 2) restore the base backup 3) replay all incremental backups (in the sense of my original mail) Gregor Zeitlinger LUCAS Product Development Torex Retail Solutions GmbH Schwed

[HACKERS] Incremental Backup Script

Hello, as far as I have understood, the WAL backup that you control via "archive_command" is the PostgreSQL equivalent to what other databases let you do with an incremental backup. That is, if you don't forget to include the current WAL block. I have found a script to determine the current

Re: [HACKERS] is GiST still alive?

oof of a theory. But you've got to have the theory first > or you don't know what you're proving. agreed. > Anyway, I don't think you an borrow code from any existing relational > database,since an XML database would be radically different structurally.

Re: [HACKERS] is GiST still alive?

ited for data storage. If your point is that currently xml is not suited for storage, because there are more efficent RDBMS than xml databases, I agree. Otherwise, I don't see your point. -- Gregor Zeitlinger [EMAIL PROTECTED] ---(end of broadcast)--- TIP 8: explain analyze is your friend

Re: [HACKERS] is GiST still alive?

the parent, the previous, the next elemnt or the first or last child. > I use XML a lot for all sorts of purposes, but it is appropriate for > data transfer rather than data storage, IMNSHO. Right now, you're quite right. But I want to change that. -- Gregor Zeitl

Re: [HACKERS] is GiST still alive?

ssible. But that's how the cookie crumbles only an implementation is a real proof. -- Gregor Zeitlinger [EMAIL PROTECTED] ---(end of broadcast)--- TIP 5: Have you checked our extensive FAQ? http://www.postgresql.org/docs/faqs/FAQ.html

Re: [HACKERS] is GiST still alive?

On Thu, 23 Oct 2003, Christopher Kings-Lynne wrote: > 4. Extend the contrib/ltree gist-based tree indexing scheme to work on > xml and hence the operations in no.3 above are really fast... but then, the plain xml data is still stored in a database colum, if I understand correctly? --

Re: [HACKERS] is GiST still alive?

l because: > > a) You have some clear notion as to why this ought to be useful? yes. Modyfing and querying plain xml files sucks performancewise once your documents get a little larger (100 MB+) > b) XML is a big buzzword, and people have been able to succesfully > attrac

Re: [HACKERS] is GiST still alive?

st xml databases it's too slow to store them in relational tables. After all, if you were designing a database for xml data only - would you come up with tables to store them? -- Gregor Zeitlinger [EMAIL PROTECTED] ---(end of broadcast)--- TIP 3:

Re: [HACKERS] is GiST still alive?

was that I doesn't work too well in a relational database. I was just wondering wheater I have to reinvent the wheel of database technology when it comes to transaction processing, ACID, and Indexes, which a native xml database ought to have as well. -- Gregor Zeitlinger

[HACKERS] is GiST still alive?

reSQL fit that requirement? And are you interested in having a fast, scalable XML access method? -- Gregor Zeitlinger [EMAIL PROTECTED] ---(end of broadcast)--- TIP 1: subscribe and unsubscribe commands go to [EMAIL PROTECTED]