UnivTrevesV1, PascalFrancis, Curation, bibRecord, 001283

EFTA: a database retrieval algebra for feature-terms

Identifieur interne : 001283 ( PascalFrancis/Curation ); précédent : 001282; suivant : 001284

EFTA: a database retrieval algebra for feature-terms

Auteurs : T. Ludwig ; B. Walter

Source :

Data & knowledge engineering [ 0169-023X ] ; 1991.

RBID : Pascal:91-0298306

Descripteurs français

Pascal (Inist)
- Base donnée, Système gestion base donnée, Question documentaire, Récursivité, Algèbre, Langage interrogation, Traitement langage, Compilateur, Base donnée déductive, Traitement question.
Wicri :
- topic : Base de données.

English descriptors

KwdEn :
- Algebra, Compiler, Database, Database management system, Deductive database, Language processing, Query, Query language, Query processing, Recursivity.

Abstract

A Feature-Term Algebra (FTA) for database-retrieval of feature-terms is presented. FTA is comparable to other attempts to extend or modify Relational Algebra to cope with complex objects and set-valued attributes etc., but extends these proposals to an open-world-assumption for the processing of incomplete knowledge. Since we want to define the algebra as an intermediate language for the compilation of feature-logic database queries, we augment it by a closure-operator to be able to compile recursive queries. Formal semantics of this Extended Feature-Term Algebra (EFTA) are given, its expressive power is investigated, and the algebra is discussed in the context of related work

A01	`01`	`1`		`@0 0169-023X`
A03		`1`		`@0 Data knowl. eng.`
A05				`@2 6`
A06				`@2 2`
A08	`01`	`1`	`ENG`	`@1 EFTA: a database retrieval algebra for feature-terms`
A11	`01`	`1`		`@1 LUDWIG (T.)`
A11	`02`	`1`		`@1 WALTER (B.)`
A14	`01`			`@1 Univ. Trier, Fachbereich 4 @2 Trier 5500 @3 DEU @Z A11011000`
A20				`@1 125-149`
A21				`@1 1991`
A23	`01`			`@0 ENG`
A43	`01`			`@1 CNRS @2 20863`
A44				`@0 0000`
A45				`@0 38 ref.`
A47	`01`	`1`		`@0 91-0298306`
A60				`@1 P`
A61				`@0 A`
A64		`1`		`@0 Data & knowledge engineering`
A66	`01`			`@0 NLD`
C01	`01`		`ENG`	@0 A Feature-Term Algebra (FTA) for database-retrieval of feature-terms is presented. FTA is comparable to other attempts to extend or modify Relational Algebra to cope with complex objects and set-valued attributes etc., but extends these proposals to an open-world-assumption for the processing of incomplete knowledge. Since we want to define the algebra as an intermediate language for the compilation of feature-logic database queries, we augment it by a closure-operator to be able to compile recursive queries. Formal semantics of this Extended Feature-Term Algebra (EFTA) are given, its expressive power is investigated, and the algebra is discussed in the context of related work
C02	`01`	`X`		`@0 001D02B07D`
C03	`06`	`X`	`FRE`	`@0 Base donnée`
C03	`07`	`X`	`FRE`	`@0 Système gestion base donnée`
C03	`09`	`X`	`FRE`	`@0 Question documentaire`
C03	`10`	`X`	`FRE`	`@0 Récursivité`
C03	`11`	`X`	`FRE`	`@0 Algèbre`
C03	`13`	`X`	`FRE`	`@0 Langage interrogation`
C03	`14`	`X`	`FRE`	`@0 Traitement langage`
C03	`15`	`X`	`FRE`	`@0 Compilateur`
C03	`16`	`X`	`FRE`	`@0 Base donnée déductive @4 CD`
C03	`17`	`X`	`FRE`	`@0 Traitement question @4 CD`
C03	`06`	`X`	`ENG`	`@0 Database`
C03	`07`	`X`	`ENG`	`@0 Database management system`
C03	`09`	`X`	`ENG`	`@0 Query`
C03	`10`	`X`	`ENG`	`@0 Recursivity`
C03	`11`	`X`	`ENG`	`@0 Algebra`
C03	`13`	`X`	`ENG`	`@0 Query language`
C03	`14`	`X`	`ENG`	`@0 Language processing`
C03	`15`	`X`	`ENG`	`@0 Compiler`
C03	`16`	`X`	`ENG`	`@0 Deductive database @4 CD`
C03	`17`	`X`	`ENG`	`@0 Query processing @4 CD`
C03	`06`	`X`	`SPA`	`@0 Base dato`
C03	`07`	`X`	`SPA`	`@0 Sistema gestión base datos`
C03	`09`	`X`	`SPA`	`@0 Pregunta documental`
C03	`10`	`X`	`SPA`	`@0 Recursividad`
C03	`11`	`X`	`SPA`	`@0 Algebra`
C03	`13`	`X`	`SPA`	`@0 Lenguaje interrogación`
C03	`14`	`X`	`SPA`	`@0 Tratamiento lenguaje`
C03	`15`	`X`	`SPA`	`@0 Compilador`
C03	`16`	`X`	`SPA`	`@0 Base dato deductiva @4 CD`
C03	`17`	`X`	`SPA`	`@0 Tratamiento cuestión @4 CD`
C04	`01`	`X`		`@0 PM56!13,10`
N21				`@1 112`

Links toward previous steps (curation, corpus...)

to stream PascalFrancis, to step Corpus: Pour aller vers cette notice dans l'étape Curation :001763

Links to Exploration step

Pascal:91-0298306

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">EFTA: a database retrieval algebra for feature-terms</title>
<author><name sortKey="Ludwig, T" sort="Ludwig, T" uniqKey="Ludwig T" first="T." last="Ludwig">T. Ludwig</name>
</author>
<author><name sortKey="Walter, B" sort="Walter, B" uniqKey="Walter B" first="B." last="Walter">B. Walter</name>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">91-0298306</idno>
<date when="1991">1991</date>
<idno type="stanalyst">PASCAL 91-0298306 INIST</idno>
<idno type="RBID">Pascal:91-0298306</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">001763</idno>
<idno type="wicri:Area/PascalFrancis/Curation">001283</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">EFTA: a database retrieval algebra for feature-terms</title>
<author><name sortKey="Ludwig, T" sort="Ludwig, T" uniqKey="Ludwig T" first="T." last="Ludwig">T. Ludwig</name>
</author>
<author><name sortKey="Walter, B" sort="Walter, B" uniqKey="Walter B" first="B." last="Walter">B. Walter</name>
</author>
</analytic>
<series><title level="j" type="main">Data & knowledge engineering</title>
<title level="j" type="abbreviated">Data knowl. eng.</title>
<idno type="ISSN">0169-023X</idno>
<imprint><date when="1991">1991</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><title level="j" type="main">Data & knowledge engineering</title>
<title level="j" type="abbreviated">Data knowl. eng.</title>
<idno type="ISSN">0169-023X</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Algebra</term>
<term>Compiler</term>
<term>Database</term>
<term>Database management system</term>
<term>Deductive database</term>
<term>Language processing</term>
<term>Query</term>
<term>Query language</term>
<term>Query processing</term>
<term>Recursivity</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Base donnée</term>
<term>Système gestion base donnée</term>
<term>Question documentaire</term>
<term>Récursivité</term>
<term>Algèbre</term>
<term>Langage interrogation</term>
<term>Traitement langage</term>
<term>Compilateur</term>
<term>Base donnée déductive</term>
<term>Traitement question</term>
</keywords>
<keywords scheme="Wicri" type="topic" xml:lang="fr"><term>Base de données</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">A Feature-Term Algebra (FTA) for database-retrieval of feature-terms is presented. FTA is comparable to other attempts to extend or modify Relational Algebra to cope with complex objects and set-valued attributes etc., but extends these proposals to an open-world-assumption for the processing of incomplete knowledge. Since we want to define the algebra as an intermediate language for the compilation of feature-logic database queries, we augment it by a closure-operator to be able to compile recursive queries. Formal semantics of this Extended Feature-Term Algebra (EFTA) are given, its expressive power is investigated, and the algebra is discussed in the context of related work</div>
</front>
</TEI>
<inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0169-023X</s0>
</fA01>
<fA03 i2="1"><s0>Data knowl. eng.</s0>
</fA03>
<fA05><s2>6</s2>
</fA05>
<fA06><s2>2</s2>
</fA06>
<fA08 i1="01" i2="1" l="ENG"><s1>EFTA: a database retrieval algebra for feature-terms</s1>
</fA08>
<fA11 i1="01" i2="1"><s1>LUDWIG (T.)</s1>
</fA11>
<fA11 i1="02" i2="1"><s1>WALTER (B.)</s1>
</fA11>
<fA14 i1="01"><s1>Univ. Trier, Fachbereich 4</s1>
<s2>Trier 5500</s2>
<s3>DEU</s3>
<sZ>A11011000</sZ>
</fA14>
<fA20><s1>125-149</s1>
</fA20>
<fA21><s1>1991</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA43 i1="01"><s1>CNRS</s1>
<s2>20863</s2>
</fA43>
<fA44><s0>0000</s0>
</fA44>
<fA45><s0>38 ref.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>91-0298306</s0>
</fA47>
<fA60><s1>P</s1>
</fA60>
<fA61><s0>A</s0>
</fA61>
<fA64 i2="1"><s0>Data & knowledge engineering</s0>
</fA64>
<fA66 i1="01"><s0>NLD</s0>
</fA66>
<fC01 i1="01" l="ENG"><s0>A Feature-Term Algebra (FTA) for database-retrieval of feature-terms is presented. FTA is comparable to other attempts to extend or modify Relational Algebra to cope with complex objects and set-valued attributes etc., but extends these proposals to an open-world-assumption for the processing of incomplete knowledge. Since we want to define the algebra as an intermediate language for the compilation of feature-logic database queries, we augment it by a closure-operator to be able to compile recursive queries. Formal semantics of this Extended Feature-Term Algebra (EFTA) are given, its expressive power is investigated, and the algebra is discussed in the context of related work</s0>
</fC01>
<fC02 i1="01" i2="X"><s0>001D02B07D</s0>
</fC02>
<fC03 i1="06" i2="X" l="FRE"><s0>Base donnée</s0>
</fC03>
<fC03 i1="07" i2="X" l="FRE"><s0>Système gestion base donnée</s0>
</fC03>
<fC03 i1="09" i2="X" l="FRE"><s0>Question documentaire</s0>
</fC03>
<fC03 i1="10" i2="X" l="FRE"><s0>Récursivité</s0>
</fC03>
<fC03 i1="11" i2="X" l="FRE"><s0>Algèbre</s0>
</fC03>
<fC03 i1="13" i2="X" l="FRE"><s0>Langage interrogation</s0>
</fC03>
<fC03 i1="14" i2="X" l="FRE"><s0>Traitement langage</s0>
</fC03>
<fC03 i1="15" i2="X" l="FRE"><s0>Compilateur</s0>
</fC03>
<fC03 i1="16" i2="X" l="FRE"><s0>Base donnée déductive</s0>
<s4>CD</s4>
</fC03>
<fC03 i1="17" i2="X" l="FRE"><s0>Traitement question</s0>
<s4>CD</s4>
</fC03>
<fC03 i1="06" i2="X" l="ENG"><s0>Database</s0>
</fC03>
<fC03 i1="07" i2="X" l="ENG"><s0>Database management system</s0>
</fC03>
<fC03 i1="09" i2="X" l="ENG"><s0>Query</s0>
</fC03>
<fC03 i1="10" i2="X" l="ENG"><s0>Recursivity</s0>
</fC03>
<fC03 i1="11" i2="X" l="ENG"><s0>Algebra</s0>
</fC03>
<fC03 i1="13" i2="X" l="ENG"><s0>Query language</s0>
</fC03>
<fC03 i1="14" i2="X" l="ENG"><s0>Language processing</s0>
</fC03>
<fC03 i1="15" i2="X" l="ENG"><s0>Compiler</s0>
</fC03>
<fC03 i1="16" i2="X" l="ENG"><s0>Deductive database</s0>
<s4>CD</s4>
</fC03>
<fC03 i1="17" i2="X" l="ENG"><s0>Query processing</s0>
<s4>CD</s4>
</fC03>
<fC03 i1="06" i2="X" l="SPA"><s0>Base dato</s0>
</fC03>
<fC03 i1="07" i2="X" l="SPA"><s0>Sistema gestión base datos</s0>
</fC03>
<fC03 i1="09" i2="X" l="SPA"><s0>Pregunta documental</s0>
</fC03>
<fC03 i1="10" i2="X" l="SPA"><s0>Recursividad</s0>
</fC03>
<fC03 i1="11" i2="X" l="SPA"><s0>Algebra</s0>
</fC03>
<fC03 i1="13" i2="X" l="SPA"><s0>Lenguaje interrogación</s0>
</fC03>
<fC03 i1="14" i2="X" l="SPA"><s0>Tratamiento lenguaje</s0>
</fC03>
<fC03 i1="15" i2="X" l="SPA"><s0>Compilador</s0>
</fC03>
<fC03 i1="16" i2="X" l="SPA"><s0>Base dato deductiva</s0>
<s4>CD</s4>
</fC03>
<fC03 i1="17" i2="X" l="SPA"><s0>Tratamiento cuestión</s0>
<s4>CD</s4>
</fC03>
<fC04 i1="01" i2="X"><s0>PM56!13,10</s0>
</fC04>
<fN21><s1>112</s1>
</fN21>
</pA>
</standard>
</inist>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/PascalFrancis/Curation

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001283 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Curation/biblio.hfd -nk 001283 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Rhénanie
   |area=    UnivTrevesV1
   |flux=    PascalFrancis
   |étape=   Curation
   |type=    RBID
   |clé=     Pascal:91-0298306
   |texte=   EFTA: a database retrieval algebra for feature-terms
}}

This area was generated with Dilib version V0.6.31.
Data generation: Sat Jul 22 16:29:01 2017. Site generation: Wed Feb 28 14:55:37 2024

	Serveur d'exploration sur l'Université de Trèves
	Attention, ce site est en cours de développement ! Attention, site généré par des moyens informatiques à partir de corpus bruts. Les informations ne sont donc pas validées.

Serveur d'exploration sur l'Université de Trèves

EFTA: a database retrieval algebra for feature-terms

EFTA: a database retrieval algebra for feature-terms

Source :

Descripteurs français

English descriptors

Abstract

Links toward previous steps (curation, corpus...)

Links to Exploration step

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

Pour mettre un lien sur cette page dans le réseau Wicri