Fandom

VroniPlag Wiki

Nm/Fragment 208 11

< Nm

31.388Seiten in
diesem Wiki
Seite hinzufügen
Diskussion0 Teilen

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.


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