Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
11,220
Table 11: Mapping Function for Projection Views with Postprocessing and Output Restrictions.
1999
"... In PAGE 29: ... In the case of the o apos; and c apos; base-view adornments, if the inferred value is one of the menu constants, the selection-view can have the f adornment. The new mapping function for a projection view is given in Table11 . Note that the entries in the top ve rows are identical to the entries in Table 5 because the mediator can perform postprocessing on the projected attribute.... ..."
Cited by 38
Table 10: Mapping Function for Selection Views with Postprocessing and Output Restrictions.
1999
"... In PAGE 28: ...2.3 Selection and Projection Views The new mapping function for computing selection-view templates in a postprocessing mediator is given by Table10 . The top #0Cverows of this table are identical to Table 4 because the mediator can perform all necessary postprocessing on the attribute that is output in the results of the base-view query.... ..."
Cited by 38
Table 11: Mapping Function for Projection Views with Postprocessing and Output Restrictions.
1999
"... In PAGE 29: ... In the case of the o apos; and c apos; base-view adornments, if the inferred value is one of the menu constants, the selection-view can have the f adornment. The new mapping function for a projection view is given in Table11 . Note that the entries in the top #0Cverows are identical to the entries in Table 5 because the mediator can perform postprocessing on the projected attribute.... ..."
Cited by 38
Table II: The usage of different access strategies (in % of all usage) at tasks with a certain level of experience. (Abbreviations used: RB - Restricted Browsing view type; FB - Free Browsing. )
Table 9: Mapping Function for Join Sequences with Postprocessing and Output Restrictions. 7.2.3 Selection and Projection Views Base-View Selection-Attribute Nonselection-Attribute
1999
"... In PAGE 27: ...2.2 Join Views Table9 presents the new mapping function for computing the adornment of a join attribute in a join sequence of two base-views with single templates. The f apos; and the o apos; adornments of the base- view templates are treated in a similar fashion to the b apos; and the c apos; adornments.... ..."
Cited by 38
Table 4: Simple example view.
"... In PAGE 10: ... Such a dual subset we call a view of the database. A view of the simple example is shown in Table4 . In this case, we restrict the view to the columns X1,X3 and to the records 1, 2, 3, 5, 6, 7and9.... ..."
Table 1 proceeds by matching view node XPS1 to query node XPS4, which requires matching XPS2 to XPS5, which in turn attempts to match the view node XPS3(@price), to the query expression node XPS6(@price). At this point we flnd out that a view predicate XPS3 gt; 60 is associated with node XPS3, so we look for query expression predicates as- sociated with the XPS6 node. We flnd the predicate XPS6 gt; 100, which is more restrictive than the view predicate. As a result, the algorithm matches XPS3 to XPS6. 2
"... In PAGE 4: ...2 else if (q = null) matchNext(vnext; q) ! False 4.3 else matchNext(vnext; q) ! matchStep(vnext; qpred) _ matchStep(vnext; qnext) Table1 : Rules for flnding containment mappings between expression trees all possible mappings from XPS nodes of the view to XPS nodes of the query expression, in a single top- down pass of the view tree. For the ease of readability, we denote the XPath expression deflning the view with V , and the XPath expression in the user query with Q.... In PAGE 4: ... In the basic algorithm we restrict the view and query XPS trees to contain only AND, OR nodes and XPS nodes with child, attribute, or descendant axis. Table1 summarizes the basic algorithm in terms of the four functions used. Every function of the table evaluates to Boolean.... ..."
Table 2-1. Comparison of Protection Views and Shorthand Views
"... In PAGE 5: ... Single-Table Query Evaluation Performed by the Data Access Manager 3-20 Figure 3-9. Virtual Sequential Block Buffering (VSBB) Access 3-22 Tables Table2... In PAGE 36: ... That means you can simplify data access at the same time as you restrict data access. Table2 -1 compares protection views and shorthand views. Table 2-1.... ..."
Table 8: Mapping Function for Union Views with Postprocessing and Output Restrictions. from the query to the query result, thus allowing the attribute to be present in the output. Hence, the b apos; adornment can be treated in the same way as the less restrictive b adornment. Similarly, the c apos; adornment may be treated as the c apos; adornment. Notice that the cases of f apos; and o apos; where an input value is speci ed in query can also lead to the attribute being present in the output. However, the mediator cannot guarantee that the attribute will be present when the adornment is f apos; or o apos;. That is, it cannot convert f apos; to f and o apos; to o. Note that the entries in Table 8 do not actually re ect the more exible adornments in the cases when both the base views do not output an attribute. 7.2.2 Join Views
1999
"... In PAGE 26: ...2.1 Union Views The new mapping function for computing union-view templates in postprocessing mediators is given in Table8 . Notice that in the rst ve rows and the rst ve columns (the top-left quadrant) of Table 8, both base views output the attribute in their results.... In PAGE 26: ....2.1 Union Views The new mapping function for computing union-view templates in postprocessing mediators is given in Table 8. Notice that in the rst ve rows and the rst ve columns (the top-left quadrant) of Table8 , both base views output the attribute in their results. Therefore, the mediator can perform postprocessing as in Section 5 and so the entries are identical to those of Table 2.... In PAGE 26: ... Therefore, the mediator can perform postprocessing as in Section 5 and so the entries are identical to those of Table 2. The entries in the last ve rows and the last ve columns (the bottom-right quadrant) of Table8 are similar to Table 1 because both base views are suppressing the attribute, and so the mediator cannot perform any postprocessing on this attribute. In the rest of Table 8, the mediator can postprocess on the attribute returned from one of the base views.... In PAGE 26: ... The entries in the last ve rows and the last ve columns (the bottom-right quadrant) of Table 8 are similar to Table 1 because both base views are suppressing the attribute, and so the mediator cannot perform any postprocessing on this attribute. In the rest of Table8 , the mediator can postprocess on the attribute returned from one of the base views. Consequently, the entries are less exible than the top-left quadrant and are more exible than the bottom-right quadrant.... ..."
Cited by 38
Table 5: The k-IA/G Algorithm. (a) TMO; (b) SMO, merging allowed; (c) SMO, merging exhausted; (e) Otherwise. We now propose a heuristic inspired by the above approach, with a strategy similar to k-IDeA/G. Recall that k-IDeA/G can be viewed as a restricted version of the RSA/BnB/G algorithm in which at most k Steiner mergers are skipped. Our proposed algorithm, called k-IA/G, (which stands for Iterated k-Arborescence) is a symmetrical restricted version of RSA/BnB/G in which at most k Steiner mergers are allowed. More precisely, k-IA/G also visits the nodes in decreasing rank order. If the current node v is a TMO, the terminal merger is 11
1998
"... In PAGE 9: ... For the skipping branch: P3 = P2 = fv7; v8g; P1 = fv1g: A3 = A2 = ;; A1 = fv1 ; v7; v1 ; v8g. The algorithm, called RSA/DP/G, is summarized in Table5 . Our implementation of RSA/DP/G character- izes each subproblem with a tuple (P; vi; C; S), where S is the set of nodes at which Steiner mergers occur3.... In PAGE 13: ... The dmin apos;s and Ri apos;s can be computed and maintained in O(jEjjNj) time and O(jV jjNj) space; a given Xi can then be computed by taking the intersection of Ri and Pi+1, which requires O(jPj) time. The complete k-IA/G algorithm is described in Table5 . k-IA/G calls the function IA/G/aux() to nd the best (maximum reduction in tree length) set of k Steiner nodes, and adds them to the terminal set N.... ..."
Cited by 29
Results 1 - 10
of
11,220
