Name
Abstract | ||
|---|---|---|
One can partition the class of relational database schemas into tree schemas and cyclic schemas. In this paper we examine query processing implications of the partitioning; other areas impacted include dependency theory, schema design and graph theory.We consider a class of queries that compute the join of all relations in the database projected onto a prescribed set of attributes. We show that solving such queries (using the join, project and semijoin operators) is tantamount to creating an "embedded" tree schema which we call a tree projection. This lends further credibility to the pivotal nature of the tree/cyclic partitioning.Using the tree projection concept we analyze the problem of determining how many joins are needed to solve a query. |
Year | DOI | Venue |
|---|---|---|
1982 | 10.1145/588111.588119 | PODS |
Keywords | Field | DocType |
tree property,tree projection concept,schema design,query processing implication,graph theory,cyclic schema,cyclic partitioning,relational database schema,tree schema,dependency theory,tree projection,relational database | Query optimization,Graph database,Joins,Relational database,Computer science,View,Theoretical computer science,Tree structure,Relational algebra,Incremental decision tree | Conference |
ISBN | Citations | PageRank |
0-89791-070-2 | 29 | 28.14 |
References | Authors | |
16 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| N. Goodman | 1 | 29 | 28.14 |
| Oded Shmueli | 2 | 47 | 41.84 |