Question about Microsoft Computers & Internet
I have a root table called ROOT which consists of 20 rows for example a,b,...z.Each row of ROOT table will lead to a table whose name is same as the row of ROOT to which it is linked i.e.20 rows will lead to 20 tables.the searching of second table content will only be possible by traversing through ROOT........how it is done in ORACLE.........
While I'm not saying it's not possible, it's not something Oracle (Or any relational database) is designed to support, so don't be surprised if this isn't possible or extremely difficult.
Relational databases support predictable relationships. IE: Table 1 relates to Table 2 in a given way.
Relational databases do not support varied relationships depending on the data in each row. The query engines simply can not join data this way.
If you provide me more details about your data, I might be able to propose a table structure that doesn't require a different table for each row of data in ROOT.
Posted on Feb 12, 2009
a 6ya expert can help you resolve that issue over the phone in a minute or two.
best thing about this new service is that you are never placed on hold and get to talk to real repairmen in the US.
the service is completely free and covers almost anything you can think of (from cars to computers, handyman, and even drones).
click here to download the app (for users in the US for now) and get all the help you need.
Posted on Jan 02, 2017
Tips for a great answer:
Oct 23, 2014 | Computers & Internet
May 20, 2011 | Google Code AndroidChat
Mar 06, 2011 | Microsoft FrontPage 2003
Feb 23, 2011 | Google Code AndroidChat
Nov 06, 2009 | Apple safari
Mar 03, 2008 | Macromedia Dreamweaver MX 2004 for PC, Mac
115 people viewed this question
Usually answered in minutes!