![]() | |
![]() |
| | Thread Tools | Display Modes |
#1
| |||
| |||
|
#2
| |||
| |||
|
|
Hi all, one question .. OODBs are less and less alive in terms of * newsgroup traffic * attention * new products and so on So it seems they are not the prime hope and not many big organizations will push them But anyway there are application cases where a page server OODB must be superior to any RDB .. e.g. large amounts of vectorized data like in Geo Information Systems that are basically graphs where you want to navigate along edges and have huge amounts of data |
|
Not the prime use case for RDB - looks more like an e.g. the prime case for Object Store use Question: What do the Geo Information Systems guys use as their databases? * RDBs with performance problems * RDBs which extensive tuning * OODBs anyway - despite the fact that they are a bit off the mainstream * a mixture of RDBs and BLOB data * what else? |
#3
| |||
| |||
|
|
Hi all, one question .. OODBs are less and less alive in terms of * newsgroup traffic * attention * new products and so on So it seems they are not the prime hope and not many big organizations will push them But anyway there are application cases where a page server OODB must be superior to any RDB .. e.g. large amounts of vectorized data like in Geo Information Systems that are basically graphs where you want to navigate along edges and have huge amounts of data Not the prime use case for RDB - looks more like an e.g. the prime case for Object Store use Question: What do the Geo Information Systems guys use as their databases? * RDBs with performance problems * RDBs which extensive tuning * OODBs anyway - despite the fact that they are a bit off the mainstream * a mixture of RDBs and BLOB data * what else? Thanks Wolfgang |
#4
| |||
| |||
|
|
That's quite a leap of faith. What makes you assume it would be superior? |
#5
| |||
| |||
|
|
That's quite a leap of faith. What makes you assume it would be superior? if you have let's say 4K page size and if a node of a graph has let's say 100 Bytes then a page could hold about 40 nodes of a graph. You can navigate in these without going back to physical storage ... In RDB's you need to do a lot to get such a behavior for tree-like and graph like data ... |
|
Hence ... there are applications |
#6
| |||
| |||
|
|
if you have let's say 4K page size and if a node of a graph has let's say 100 Bytes then a page could hold about 40 nodes of a graph. You can navigate in these without going back to physical storage ... In RDB's you need to do a lot to get such a behavior for tree-like and graph like data ... No, you don't. Asserting something does not make it true; even if you are repeating something you have heard many times. |
#7
| |||
| |||
|
|
if you have let's say 4K page size and if a node of a graph has let's say 100 Bytes then a page could hold about 40 nodes of a graph. You can navigate in these without going back to physical storage ... In RDB's you need to do a lot to get such a behavior for tree-like and graph like data ... No, you don't. Asserting something does not make it true; even if you are repeating something you have heard many times. Ok... I'll bit. How would you set up an RDB to store a tree-like graph so as to minimize I/O? Same parameters: 100 byte nodes and roughly 40 related nodes read with one disk I/O. I'm not trying to start a flame war ... I'd really like to know how you would do it. |
#8
| |||
| |||
|
|
"Bob Nemec" <bobn (AT) rogers (DOT) com> wrote in message news:3f6071fe (AT) news (DOT) totallyobjects.com... if you have let's say 4K page size and if a node of a graph has let's say 100 Bytes then a page could hold about 40 nodes of a graph. You can navigate in these without going back to physical storage ... In RDB's you need to do a lot to get such a behavior for tree-like and graph like data ... No, you don't. Asserting something does not make it true; even if you are repeating something you have heard many times. Ok... I'll bit. How would you set up an RDB to store a tree-like graph so as to minimize I/O? Same parameters: 100 byte nodes and roughly 40 related nodes read with one disk I/O. I'm not trying to start a flame war ... I'd really like to know how you would do it. It makes it easier to discuss things if people include the attributions. To answer your question: I would physically cluster the nodes according to the usage pattern. What do you consider a 'node'? In an OODB it would be object with object |
#9
| ||||
| ||||
|
|
"Bob Badour" <bbadour (AT) golden (DOT) net> wrote in message news:Kh18b.158$Hw6.3403925 (AT) mantis (DOT) golden.net... "Bob Nemec" <bobn (AT) rogers (DOT) com> wrote in message news:3f6071fe (AT) news (DOT) totallyobjects.com... if you have let's say 4K page size and if a node of a graph has let's say 100 Bytes then a page could hold about 40 nodes of a graph. You can navigate in these without going back to physical storage .... In RDB's you need to do a lot to get such a behavior for tree-like and graph like data ... No, you don't. Asserting something does not make it true; even if you are repeating something you have heard many times. Ok... I'll bit. How would you set up an RDB to store a tree-like graph so as to minimize I/O? Same parameters: 100 byte nodes and roughly 40 related nodes read with one disk I/O. I'm not trying to start a flame war ... I'd really like to know how you would do it. It makes it easier to discuss things if people include the attributions. To answer your question: I would physically cluster the nodes according to the usage pattern. What do you consider a 'node'? |
|
In an OODB it would be object with object references to its related nodes and the page storage pattern would reflect the usage pattern (or it could be explicitly set by the application ... like with GemStone cluster buckets). |
|
With an RDB I'm assuming a node would be represented by rows in one or more tables. |
|
So, if I have a cluster of 40 related nodes, how do I avoid the table I/O for the join? |
#10
| |||
| |||
|
|
Hi all, one question .. OODBs are less and less alive in terms of * newsgroup traffic * attention * new products and so on So it seems they are not the prime hope and not many big organizations will push them But anyway there are application cases where a page server OODB must be superior to any RDB .. e.g. large amounts of vectorized data like in Geo Information Systems that are basically graphs where you want to navigate along edges and have huge amounts of data Not the prime use case for RDB - looks more like an e.g. the prime case for Object Store use Question: What do the Geo Information Systems guys use as their databases? * RDBs with performance problems * RDBs which extensive tuning * OODBs anyway - despite the fact that they are a bit off the mainstream * a mixture of RDBs and BLOB data * what else? Thanks Wolfgang |
![]() |
| Thread Tools | |
| Display Modes | |
| |