| Thread | Last Post | Replies |
|
| c.d.theory glossary 0.0.4 | 30 Jun 2004 01:09 GMT | 42 |
--------------- " PUNTER: Good morning. Glossary 0.0.4: RECEPTIONIST: Good morning, sir. Can I help you? june 16, 2004 PUNTER: Well, I'd like to have an argument, --------------- please."
|
| Relational Algebra :Division. | 29 Jun 2004 19:07 GMT | 2 |
I am searching for a simple example of the Division as in relational algebra. (Operations : Union, intersection, difference, cartesian product, selection, projections, join and DIVISION).
|
| Mumps and post-relational | 28 Jun 2004 22:50 GMT | 27 |
Over in news:comp.databases there is a thread where what's being discussed is a product called "Cache". Among the things it's being called is "post-relational". Somewhere in the discussion, it says that Cache has historical roots in MUMPS, and that MUMPS is multidiminsional.
|
| expressing one-or-more constraint structurally | 28 Jun 2004 16:15 GMT | 5 |
When one wants to express a cardinality constraint on one item vs. another, being able to do it structurally is the best approach. The most basic example is one-to-many. If, for each a in A, you have 0 or more b in B, then have B have, in addition to its own
|
| Help required for Hierarchial Query (START WITH...CONNECT BY PRIOR) | 26 Jun 2004 17:10 GMT | 2 |
I am facing a problem in righting a query. I am not able to get the desired results that I want. Following is the description of the problem: I have two tables:
|
| Stupid Database Tricks | 24 Jun 2004 15:58 GMT | 20 |
Here's my list of the top ten stupid database tricks: 10. We never defragement the disks that hold the database files. Data might get corrupted! 9. We know that indexes speed things up. So every column has an index!
|
| Typo in http://arxiv.org/.../0402051.pdf? | 23 Jun 2004 00:22 GMT | 1 |
--- Jim Kraai <jim.kraai@computility.com> wrote:
>> re: http://arxiv.org/ftp/cs/papers/0402/0402051.pdf >> >> In the following lines should 72 be replaced with |
| Trouble understanding serializability | 22 Jun 2004 22:44 GMT | 2 |
This is a question out of Database System Concepts by Silberchatz. Consider the following two transactions, T1 and T2 T1: read(A) read(B)
|
| Counting propositions | 22 Jun 2004 22:01 GMT | 66 |
If tuples in a relational relation(ship) (or relvar) are propositions, what is the meaning of : select count(distinct *) as nr
|
| when to use multiple databases | 22 Jun 2004 17:44 GMT | 3 |
I have an application which tracks backed up files using a very simple schema: table session(sess_id, date,totalsize) table files(filename,size,date, sess_id)
|
| XP and data modeling | 22 Jun 2004 16:00 GMT | 1 |
Extreme Programming methodology/ies has a process for determining what data from the problem domain is modeled today and what is left for future phases of any project. The rule of thumb is that only the data required to meet the user requirements for this specific iteration (this ...
|
| BOOLEAN RELATIONSHIPS: HARD QUESTION | 21 Jun 2004 20:21 GMT | 11 |
I need to create a database for my company. We build machines and so we have a part list of the components. I have created a model of the machine in which there is a list of components to be filled in order to complete the design scheme.
|
| Interesting papers | 21 Jun 2004 13:39 GMT | 15 |
http://web.inter.nl.net/users/T.Koppelaars/ Regards Alfredo
|
| It don't mean a thing ... | 18 Jun 2004 03:33 GMT | 34 |
x wrote:
>> Well, http://en.wikipedia.org/wiki/Data , >> under meaning of data and information, >> say "data on its own has no meaning". |
| Modelling large trees and hierarchies | 17 Jun 2004 21:36 GMT | 5 |
We are currently in the process of developing a client/server based generic tree application with which we want to be able to model and render any size, shape and depth of tree. Our primary objective is to provide the ability to model large data
|