Fandom

VroniPlag Wiki

Quelle:Nm/Frost 1982

< Quelle:Nm

31.366Seiten in
diesem Wiki
Seite hinzufügen
Diskussion0

Störung durch Adblocker erkannt!


Wikia ist eine gebührenfreie Seite, die sich durch Werbung finanziert. Benutzer, die Adblocker einsetzen, haben eine modifizierte Ansicht der Seite.

Wikia ist nicht verfügbar, wenn du weitere Modifikationen in dem Adblocker-Programm gemacht hast. Wenn du sie entfernst, dann wird die Seite ohne Probleme geladen.

Angaben zur Quelle [Bearbeiten]

Autor     R.A. Frost
Titel    Binary-Relational Storage Structures
Zeitschrift    The Computer Journal
Verlag    Heyden & Son Ltd
Jahr    1982
Nummer    25 (3)
Seiten    358-367
DOI    10.1093/comjnl/25.3.358
URL    comjnl.oxfordjournals.org/content/25/3/358.full.pdf

Literaturverz.   

yes
Fußnoten    yes
Fragmente    3


Fragmente der Quelle:
[1.] Nm/Fragment 207 12 - Diskussion
Zuletzt bearbeitet: 2012-04-16 22:08:18 Hindemith
Fragment, Frost 1982, Gesichtet, KomplettPlagiat, Nm, SMWFragment, Schutzlevel sysop

Typus
KomplettPlagiat
Bearbeiter
Graf Isolan
Gesichtet
Yes.png
Untersuchte Arbeit:
Seite: 207, Zeilen: 12-18, 20, 21-22
Quelle: Frost 1982
Seite(n): 358, Zeilen: left column 30-37, 38-40
The binary–relational view regards the universe as consisting of entities with binary–relationships between them. An entity is anything which is of interest and can be identified. A binary–relationship is an association between two entities. The first entity in a relationship is called the subject and the second entity is called the object. A relationship is described by identifying the subject, the type of relationship, and object for example: Bin Laden is leader of Al Qaeda can be written as (Bin Laden. leaderOf .Al Qaeda).

N–ary relationships such as Samad got bomb making training from Zarqawi may be reduced to a set of binary–relationships by the explicit naming of the implied entity. For example:

training # 1. trainee .Samad
training #1. trainer .Zarqawi
training #1. got training of .bomb making

The binary-relational view regards the universe as consisting of entities with binary-relationships between them. An entity is any 'thing' which is of interest and can be identified. A binary-relationship is an association between two entities. The first entity in a relationship is called the subject and the second entity is called the object. A relationship is described by identifying the subject, the type of relationship, and the object. For example: IBM • employs • John

N—ary relationships such as 'John bought the car from Smiths' may be reduced to a set of binary-relationships by the explicit naming of the implied entity. For example:

sale # 1 . buyer . John
sale # 1 . seller . Smiths
sale # 1 . item sold . car

Anmerkungen

Identical, except for the examples (and one article). Not marked as a citation. The source is mentioned some lines below but there it is obviously supposed to refer to the sentences that follow.

Sichter
(Graf Isolan), Hindemith

[2.] Nm/Fragment 208 01 - Diskussion
Zuletzt bearbeitet: 2012-04-26 08:16:48 Fiesh
BauernOpfer, Fragment, Frost 1982, Gesichtet, Nm, SMWFragment, Schutzlevel sysop

Typus
BauernOpfer
Bearbeiter
Graf Isolan
Gesichtet
Yes.png
Untersuchte Arbeit:
Seite: 208, Zeilen: 1-10
Quelle: Frost 1982
Seite(n): 359, Zeilen: right column 20-28
* Simple interface between a binary relational storage structure and other modules of a database management system consists of three procedures:
  • insert (triple); (ii) delete (partial specification of triple); (iii) retrieve partial specification of triple)
  • Retrieval requests such as “list of all that terrorists met at Malaysia before 9/11” are met by issuing simple retrieval call (terrorist. met at Malaysia before 9/11. ?) which delivers only that data which has been requested.
Simple interface with other modules

Interface between a binary-relational storage structure and other modules of a database management system consists of three procedures: (i) insert (triple); (ii) delete (partial specification of triple); (iii) retrieve (partial specification of triple).

Retrieval requests such as 'list all employees of IBM' are met by issuing a simple retrieval call (IBM. employs. ?) which delivers only that data which has been requested

Anmerkungen

The source is named on the previous page. Nevertheless it is not to be expected that Nm, follows it word-for-word, given there are no quotation marks.

Sichter
(Graf Isolan), Hindemith

[3.] Nm/Fragment 208 11 - Diskussion
Zuletzt bearbeitet: 2012-04-16 22:12:08 Hindemith
Fragment, Frost 1982, Gesichtet, Nm, SMWFragment, Schutzlevel sysop, Verschleierung

Typus
Verschleierung
Bearbeiter
Graf Isolan
Gesichtet
Yes.png
Untersuchte Arbeit:
Seite: 208, Zeilen: 11-15, 17-18, 24-28
Quelle: Frost 1982
Seite(n): 360-361, Zeilen: p.360, right column 51-56 & p.361, left column, 1-2.9-14
It is to be noted that multi-attribute retrieval may be inefficient. The use of binary relational structure for multi-attribute retrieval might not be the most efficient method (irrespective of the way in which the structure is implemented. To illustrate this, consider the example: “retrieve (the names of) all young (25 years old) married terrorists involved in 9/11 attacks who attended flight schools and got terrorist training in Afghanistan”. Using binary-relational structure, one could issue the retrievals:

(? .marital status. Married)
(? .age. 25)
(? .involved in. 9/11 terrorist attacks)
(? .attended. flight schools)
(? .got terrorist training. Afghanistan)

and merge the resultant sets to obtain the required data. This is probably much faster than having to do a sequential search through the whole database, which would be necessary if the database were held as a file of records (name, age, marital status, etc.) ordered on name.

[p. 360]

Multi-attribute retrieval may be inefficient

Use of a binary-relational structure for multi-attribute retrieval might not be the most efficient method (irrespective of the way in which the structure is implemented). To illustrate this, consider the example given by Martin[EN 12]: 'retrieve (the names of) all 18 year old unemployed actresses with experience in movie-acting,

[p. 361]

and talents for singing and sky-diving'. Using a binary relational structure, one could issue the retrievals:

(?. aged. 18)
(?. job-status, unemployed)
(?. profession, actress)
(?. experience, movie-acting)
(?. talent, singing)
(?. talent, sky-diving)

and merge the resultant sets to obtain the required data. This is probably much faster than having to do a sequential search through the whole database, which would be necessary if the database were held as a file of records (name, age, job-status, profession, experience, talents) ordered on name.

Anmerkungen

Continues the copying from Frost (1982). The example given seems to be one of Nm's own making.

Sichter
(Graf Isolan), Hindemith

Auch bei Fandom

Zufälliges Wiki