### Table 4: Join orderings used in our multi-way NLJ given that the global join ordering is S1 1 (S2 1 S3).

2003

"... In PAGE 7: ... When a new S1-tuple or a new S2-tuple arrives, we proceed similarly by selecting those tuples from the window on top of the join order that join with the new tuple, and for each match, scanning the remaining window. In efiect, the window at the top of the join order always consists of only one tuple and the join order changes in response to the origin of the incoming tuple ( Table4 ). This is possible because we have assumed a common join attribute across all streams.... ..."

Cited by 61

### Table 1: Statistics of 2-level, multi-way partitionings of A741.

1999

"... In PAGE 3: ... Figures 4(a), 5(a) and 5(b) show, respectively, the results of 2-way, 3-way and 4-way balanced partitionings of A741, where each partitioned subcircuit is marked by an index (I up to IV). Table1 summarizes the statistics of these partitionings. Columns 1, 2 and 3 list, respectively, the number of subcircuits, the span/number of cut nets, and the number of nets in a balanced subcircuit.... ..."

Cited by 1

### Table II. Multi-way TDIDT classiflcation accuracy using difierent dis- tance-based similarity measures. Classical Similarity measure

in Building multi-way decision trees with numerical attributes, Technical report available upon request

2001

Cited by 2

### Table 3 Number of solutions as a function of n Similar behaviour is expected for other CSP algorithms in- cluding backtracking-based and hybrid algorithms. As a con- clusion, hierarchical systematic search significantly outper- forms flat search when the domains are large and the number of variables is small (as in most spatial database applica- tions). Some preliminary experiments indicate that H-FC also outperforms methods based on pairwise join algorithms (Mamoulis and Papadias 1999a) for finding all solutions of multi-way intersection joins involving dense queries and da- tasets. The performance gain is higher when only a small subset of the solutions is required. In the next section we ap- ply hierarchical constraint satisfaction with local search.

"... In PAGE 5: ...ariables increases. For n gt;25, FC outperforms H-FC. As the number of variables increases, the performance of FC does not deteriorate significantly because most inconsis- tent instantiations are detected during the early check- forwards. On the other hand, as shown in Table3 , the number of intermediate level solutions explodes with n. In general, the percentage of combinations that constitute solutions in- creases as we go up the levels of the trees because of the large node extents.... ..."

### Table 1 Effects of multi-way merges. Each entry gives number of process0rs:number of queues.

"... In PAGE 5: ... Thus the total number of queues is (Y - 1)k + [(n/k quot; apos;). Table1 shows the number of processors and queues for various values of k and n. The best choice of k depends on the comparative cost and speed of processors and queues for a particular implementation.... ..."

### Table 3.2: Partial Models as Error-Correction Output Coding: (a) Binary constituent models, (b) Multi-way constituent models

in OF

### Table 1: Comparison of multi-way voting protocols

2003

"... In PAGE 6: ... We compare the two types of multi-way voting protocols briefly. Column #ciphertext in Table1 shows the number of ciphertexts each voter has to compute and publish. The next column, PMP, shows the number x such that each voter performs 1-out-of-x PMP for each ciphertext.... ..."

Cited by 3

### Table 1: Ten-fold cross-validation results on all structured abstracts from the TREC 2004 MED- LINE corpus: multi-way classification on complete abstract structure (a) and by-section binary classifi- cation (b).

"... In PAGE 4: ... The results of our first set of experiments are shown in Tables 1(a) and 1(b). Table1 (a) reports the classification error in assigning a unique label to every sentence, drawn from the set { introduction , methods , results , conclusions }. For this task, we compare the performance of three separate mod- els: one that does not make the Markov assumption,... In PAGE 4: ... Applying LDA further enhances clas- sification performance. Table1 (b) reports accuracy, precision, recall, and F-measure for four separate bi- nary classifiers specifically trained for each of the sections (one per row in the table). We only dis- play results with our best model, namely HMM with LDA.... ..."

### Table 1: Ten-fold cross-validation results on all structured abstracts from the TREC 2004 MED- LINE corpus: multi-way classification on complete abstract structure (a) and by-section binary classifi- cation (b).

"... In PAGE 4: ... The results of our first set of experiments are shown in Tables 1(a) and 1(b). Table1 (a) reports the classification error in assigning a unique label to every sentence, drawn from the set { introduction , methods , results , conclusions }. For this task, we compare the performance of three separate mod- els: one that does not make the Markov assumption,... In PAGE 4: ... Applying LDA further enhances clas- sification performance. Table1 (b) reports accuracy, precision, recall, and F-measure for four separate bi- nary classifiers specifically trained for each of the sections (one per row in the table). We only dis- play results with our best model, namely HMM with LDA.... ..."

### Table 3: Cost of multi-way s-graph implementation

1994

Cited by 15