### Table 1. Tuples in Tuples Passing Tuples in Auxiliary

"... In PAGE 3: ... Materializing the auxiliary views in Figure 1 represents a signi cant savings over materializing the base relations in their entirety, as illustrated in Table 1. Suppose that each of the four base relations contain the number of tuples listed in the rst column of Table1 .... In PAGE 3: ...ale.year=1996 is .25, the selectivity of item.category= quot;toy quot; is .05, and that distributions are uniform, the number of tuples passing local selection conditions (selection conditions involving attributes from a single relation) are given in the second column of Table1 . A related proposal by Hull and Zhou [HZ96] achieves self-maintainability for base relation insertions by pushing down projections and local selection conditions on the base relations and storing at the warehouse only those tuples and attributes of the base relations that pass the selections and projections.... In PAGE 4: ... Table1 : Number of Tuples in Base Relations and Auxiliary Views We can similarly use key constraints to handle deletions to the base relations without all the base relations being available. We can determine the e ects of deletions from sale, line, and item without referencing any base relations because cal toy sales includes keys for these relations.... ..."

### Table 1. Tuples in Tuples Passing Tuples in Auxiliary

"... In PAGE 3: ... Materializing the auxiliary views in Figure 1 represents a signi cant savings over materializing the base relations in their entirety, as illustrated in Table 1. Suppose that each of the four base relations contain the number of tuples listed in the rst column of Table1 .... In PAGE 3: ...ale.year=1996 is .25, the selectivity of item.category= quot;toy quot; is .05, and that distributions are uniform, the number of tuples passing local selection conditions (selection conditions involving attributes from a single relation) are given in the second column of Table1 . A related proposal by Hull and Zhou [HZ96] achieves self-maintainability for base relation insertions by pushing down projections and local selection conditions on the base relations and storing at the warehouse only those tuples and attributes of the base relations that pass the selections and projections.... In PAGE 4: ... Table1 : Number of Tuples in Base Relations and Auxiliary Views We can similarly use key constraints to handle deletions to the base relations without all the base relations being available. We can determine the e ects of deletions from sale, line, and item without referencing any base relations because cal toy sales includes keys for these relations.... ..."

### Table 2 The Alphabets of the Relational Calculus

1972

Cited by 126

### Table 2 The Alphabets of the Relational Calculus

1972

Cited by 126

### Table 1: Temporal relational data models

1995

"... In PAGE 9: ...Table1 lists most of the temporal relational data models that have appeared in the literature1. We include all models that we are aware of that have appeared in the literature.... In PAGE 15: ... Table 5 lists the major temporal relational query language proposals to date. The underlying data model is a reference to Table1 . The next column lists the conventional query language the temporal proposal is based on, from the following: DEAL, an extension of the relational algebra incorporating functions, recursion, and deduction [52]; ILs, an intensional logic formu- lated in the context of computational linguistics [147]; QBE, Query-by-Example [232], a domain calculus-based query language; Quel, the tuple calculus-based query language [82], originally de ned for the Ingres relational DBMS; relational algebra, a procedural language with relations as objects [46]; and SQL, a tuple calculus-based language, the lingua franca of conventional rela-... ..."

Cited by 44

### Table 7: Tuples of the Subnodes Relation

"... In PAGE 24: ... For each node, the position indices and forward and reverse delays ( ?f and ?r) are identi ed from the conceptual model. Table7 shows these tuples. 5 Access Algorithms for Multimedia Databases We have presented a speci cation methodology and conceptual models suitable for database storage of time-dependent multimedia data.... ..."

### Table 5: Tuples of the Terminals Relation

### Table 6: Tuples of the Nodes Relation

### Table 1: Operations on tuple sets and relations, where F and G are tuple relations and S and T are tuple sets

1995

"... In PAGE 4: ...Table 1: Operations on tuple sets and relations, where F and G are tuple relations and S and T are tuple sets such as f [i] ! [i] j i even g by introducing wildcard variables (denoted by Greek letters): f [i] ! [i] j 9 s:t: i = 2 g Table1 gives a brief description of the operations on integer tuple sets and relations that we use in this paper. See [Pug91] for a more thorough description.... ..."

Cited by 20

### Table 3 Examples of WFFs of the Relational Calculus

1972

Cited by 126