Hot answers tagged

57

To quote Joe Celko (not only can you find this reference all over the web and in his Wikipedia entry, but you will even see it on T-shirts at some conferences): Rows are not records. A lot of people point him out as a pedantic jerk who just likes to humble and verbally abuse newbies, and I will admit that is how he comes across. But I have also met him ...


44

ACID – Atomicity, Consistency, Isolation, Durability AIO Asynchronous I/O BASE - Basically Available, Soft-State, Eventually Consistent...essentially a counterpart to (though not really "opposite" of) ACID, this is the core principle of most NoSQL implementations. BI - Business Intelligence BLOB – Binary Large OBject CAP – Consistency, Availability, ...


29

Microsoft has in several places in their organization provided that the official name for tabular data storage per table-entry (to coin a taxonomic definition that serves my own purpose) is called a "ROW". I submit as evidence ROW_NUMBER, ROWCOUNT, ROWVERSION and the DataTable.Rows property, where a DataTable is a C# representation of a TSQL "table" object. ...


26

I've just searched through the document "Information technology — Database languages — SQL Part 2: Foundation (SQL/Foundation)", which defines the ANSI standard for SQL as implemented by all major RDBMSes. The word row is used primarily throughout the document several hundred times, as expected. The word record was only used to describe a record that is ...


26

Both composite key and compound key describe a candidate key with more than one attribute. According to the Relational Database Dictionary (C.J.Date) they mean the same thing. In ER modelling the term "compound key" also has a more specific meaning. It means a key whose constituent attributes are references to keys in other entities - i.e. a compound key ...


17

Horizontal Scaling Horizontal Scaling is essentially building out instead of up. You don't go and buy a bigger beefier server and move all of your load onto it, instead you buy 1+ additional servers and distribute your load across them. Horizontal scaling is used when you have the ability to run multiple instances on servers simultaneously. Typically it is ...


16

I'm still not sure why http://en.wikipedia.org/wiki/Compound_key was not consulted. It very clearly states (and is correct): In database design, a compound key is a key that consists of 2 or more attributes that uniquely identify an entity occurrence. Each attribute that makes up the compound key is a simple key in its own right. This is often ...


16

Relational database theory does not include the use of the word Field. Dr. E.F. Codd, who wrote the series of papers that provide the theoretical basis for RDBMS's never used the term. You can read his seminal 1970 paper A Relational Model of Data for Large Shared Data Banks if you want to check. Terms like Domain, Table, Attribute, Key and Tuple are ...


14

Singleton Table. In relational terms it is a relation with primary key ∅ (the empty set).


11

Because relational databases are rarely used in isolation, in order to avoid confusion between other parts of systems, I always refer to tables and rows and columns. In a client applications, we typically have other constructs, including datareaders, datasets, datarows, datatables, etc - for instance "field" is often used for on-screen data entry and Pascal ...


8

The language keeps evolving. A few decades ago the literate people used "indices" instead of simpler "indexes". As we switched to "indexes", we eliminated an unnecessary complication and made the language more useful. The need to memorize a plural for "index" was pure overhead - it did not in any way help us communicate. Make no mistake, there used to be ...


8

A junction table is a weak entity, but a weak entity often is not a junction table. A junction table is not the same as a weak entity. A junction table is a type of weak entity. Tables used to resolve repeating groups are also weak entities. These are only junction tables if the repeating group contains a repeated foreign key relationship.


7

In Oracle terminology, it is an Index Organized Table, commonly referred to as an IOT. An index-organized table has a storage organization that is a variant of a primary B-tree. Unlike an ordinary (heap-organized) table whose data is stored as an unordered collection (heap), data for an index-organized table is stored in a B-tree index structure in a ...


7

Temporal Table or History Table are probably the terms you are looking for. Often you will see a nullable "end date" column in the table as well.


7

A securable is anything that can have permissions granted, denied, or revoked on in SQL Server. It's basically "something you can secure". Think about it like this: Your car is a securable. You would have to have been given keys (permissions) to access your car (securable). A securable is anything that can be accessible or inaccessible. Take a look at ...


6

Although your question is already answered very well. I would like to add my points too. May be you find it helpful upto some extend. Also my answer is not specific to SQL Server These words are used interchangeably. 1 2 3 4 -------------------------------------------------------------------- Row = Record = Tuple ...


6

Does "Heterogeneous" just refer to querying two different database engines in this context? Basically, yes. A "heterogeneous" query is executed on a "heterogeneous linked server". All queries to this linked server will be heterogeneous. And "heterogenous" is a subset of distributed queries Distributed data stored in multiple instances of SQL ...


6

To the best of my knowledge yes. A problem that I see with your query is that you have no way to know what row is going to come back from your linked table. Is this just dummy code or is your query written this way?


6

In any case, when one thing hasMany of another how/where does it show up in application and database logic? The only way I can think to answer this question is with another example of hasMany that may or may not answer your question. err, except I should have called the table "comment" but I think the point stands. I don't know that this really ...


5

User terms surrogate key and natural key for primary key as a variant. Surrogate Key: Surrogate keys are keys that have no “business” meaning and are solely used to identify a record in the table. Such keys are either database generated (example: Identity in SQL Server, Sequence in Oracle, Sequence/Identity in DB2 UDB etc.) or system ...


5

A "candidate key" is any column or collection of columns that CAN uniquely identify a record in a table. A "primary key" is a candidate key that is defined as the primary key for the table. Internally, a primary key is simply a unique index, clustered or non-clustered, that is typically used in foreign key relationships. There is more to it than this, as ...


4

A compound key would also define what you're describing. I've heard it called other things as well, like composite key. But note that the composite key is not the same as a compound key. Just trying to alert you to two vocabulary words.


4

Essentially the source table is the place where the data is coming from and the target table is the place where the data is going to or the table that an action is taking place on. They do not have to be in different schema's or have a different structure to each other and in fact they could actually be the same table.


3

A composite key consists of more than one attribute to uniquely identify an entity occurrence. This differs from a compound key in that one or more of the attributes, which make up the key, are not simple keys in their own right. For example, you have a database holding your CD collection. One of the entities is called tracks, which holds details of the ...


3

In English it is "composite keys". For instance, take a look at MSDN website (any search containing "sql composite key" will do). http://www.google.com/search?q=sql+composite+key+site:msdn.microsoft.com Assuming that the question regards Relational Databases, I searched for a "neutral" definition in Wikipedia: A composite key is a key made up of two or ...


3

Lookup tables I believe this to be where a table refers to a second table, where many rows/records in the first table share identical fields/column data. In the simpler cases, this table may be replaced by an ENUM type on the original table. Example, where many users can have the same job title, the "Job Title" table is identified as a lookup table and ...


3

And how many angels dance around the head of a pin? The person who corrected you could themselves be corrected. Table = Relation Row = Tuple Column = Attribute Domain = Data Type See here. I worked for an airline and the word "flight" could be used in three different ways depending on whether you were talking to pilots/attendants, engineers or ...


3

The older SQL:92 refers to fields as components of datetime items: "Fields in datetime items", specifies the fields that can make up a date time value; a datetime value is made up of a subset of those fields The fields here are year, month, and so on... and the term field doesn't seem to have any other meaning in the rest of the ...


3

You're going beyond the scope of referential constraints with this (good) question. What you are looking for is more to do with Ontologies and Archetypes than RDBMS constraints. You could also check out this page which is on "Intelligent Databases" and gives as an example, medical records. Check out the OpenEHR (Open Electronic Health Record here) whereby ...


3

A cursor is essentially a materialized result set from a query that maintains its own state (essentially remembers what row is "current") and in some cases allows you to manipulate the current row. Cursor lifecycle looks more or less like this: Open the cursor. At this point the query that defines the cursor is executed. Position the cursor. After the ...



Only top voted, non community-wiki answers of a minimum length are eligible