INFERRING A TREE FROM LOWEST COMMON ANCESTORS WITH AN APPLICATION TO THE OPTIMIZATION OF RELATIONAL EXPRESSIONS.

A. V. Aho; Y. Sagiv; T. G. Szymanski; J. D. Ullman

INFERRING A TREE FROM LOWEST COMMON ANCESTORS WITH AN APPLICATION TO THE OPTIMIZATION OF RELATIONAL EXPRESSIONS.

A. V. Aho^*, Y. Sagiv, T. G. Szymanski, J. D. Ullman

^*Corresponding author for this work

The Rachel and Selim Benin School of Engineering and Computer Science

Research output: Contribution to conference › Paper › peer-review

4 Scopus citations

Abstract

An algorithm is presented for constructing a tree to satisfy a set of lineage constraints on common ancestors. This algorithm is then applied to synthesize a relational algebra expression from a simple tableau, a problem arising from the theory of relational databases.

Original language	English
Pages	54-63
Number of pages	10
State	Published - 1978
Event	Proc Annu Allerton Conf Commun Control Comput 16th - Monticello, IL, USA Duration: 4 Oct 1978 → 6 Oct 1978

Conference

Conference	Proc Annu Allerton Conf Commun Control Comput 16th
City	Monticello, IL, USA
Period	4/10/78 → 6/10/78

Cite this

@conference{3985c0ef7c064420967f2b19ae7e76f6,

title = "INFERRING A TREE FROM LOWEST COMMON ANCESTORS WITH AN APPLICATION TO THE OPTIMIZATION OF RELATIONAL EXPRESSIONS.",

abstract = "An algorithm is presented for constructing a tree to satisfy a set of lineage constraints on common ancestors. This algorithm is then applied to synthesize a relational algebra expression from a simple tableau, a problem arising from the theory of relational databases.",

author = "Aho, {A. V.} and Y. Sagiv and Szymanski, {T. G.} and Ullman, {J. D.}",

year = "1978",

language = "אנגלית",

pages = "54--63",

note = "Proc Annu Allerton Conf Commun Control Comput 16th ; Conference date: 04-10-1978 Through 06-10-1978",

}

TY - CONF

T1 - INFERRING A TREE FROM LOWEST COMMON ANCESTORS WITH AN APPLICATION TO THE OPTIMIZATION OF RELATIONAL EXPRESSIONS.

AU - Aho, A. V.

AU - Sagiv, Y.

AU - Szymanski, T. G.

AU - Ullman, J. D.

PY - 1978

Y1 - 1978

N2 - An algorithm is presented for constructing a tree to satisfy a set of lineage constraints on common ancestors. This algorithm is then applied to synthesize a relational algebra expression from a simple tableau, a problem arising from the theory of relational databases.

AB - An algorithm is presented for constructing a tree to satisfy a set of lineage constraints on common ancestors. This algorithm is then applied to synthesize a relational algebra expression from a simple tableau, a problem arising from the theory of relational databases.

UR - http://www.scopus.com/inward/record.url?scp=0018204173&partnerID=8YFLogxK

M3 - ???researchoutput.researchoutputtypes.contributiontoconference.paper???

AN - SCOPUS:0018204173

SP - 54

EP - 63

T2 - Proc Annu Allerton Conf Commun Control Comput 16th

Y2 - 4 October 1978 through 6 October 1978

ER -

INFERRING A TREE FROM LOWEST COMMON ANCESTORS WITH AN APPLICATION TO THE OPTIMIZATION OF RELATIONAL EXPRESSIONS.

Abstract

Conference

Other files and links

Fingerprint

Cite this