Proceedings 2003 VLDB Conference: 29th International Conference on Very Large Databases (VLDB)Morgan Kaufmann, 2003 M12 2 - 1050 pages Proceedings of the 29th Annual International Conference on Very Large Data Bases held in Berlin, Germany on September 9-12, 2003. Organized by the VLDB Endowment, VLDB is the premier international conference on database technology. |
From inside the book
Results 1-5 of 82
Page 24
... cost is also a concern. With respect to this aspect, histograms may be divided into two categories: static histograms and dynamic/adaptive histograms. Static histograms are those that are traditionally used in database systems: after ...
... cost is also a concern. With respect to this aspect, histograms may be divided into two categories: static histograms and dynamic/adaptive histograms. Static histograms are those that are traditionally used in database systems: after ...
Page 42
... cost of each of these plans, is primarily dependent on the navigation operators in a query. In the following, we describe how plans are enumerated and their costs computed. Cost of a navigation operation. We associate two sets of graph ...
... cost of each of these plans, is primarily dependent on the navigation operators in a query. In the following, we describe how plans are enumerated and their costs computed. Cost of a navigation operation. We associate two sets of graph ...
Page 43
... cost for both strategies. Multiple navigation operators. So far, we have treated each navigation operation in isolation when identifying the ICS and computing costs. However, for queries involving multiple navigation operators, the ...
... cost for both strategies. Multiple navigation operators. So far, we have treated each navigation operation in isolation when identifying the ICS and computing costs. However, for queries involving multiple navigation operators, the ...
Page 65
... cost of pushing it, the criterion for the optimal pushing order comes out to be the same, i.e., (b;(u)/c;(u)). Since the costs for each push is the same, the optimal dissemination order is in the decreasing order of benefits b, (u). The ...
... cost of pushing it, the criterion for the optimal pushing order comes out to be the same, i.e., (b;(u)/c;(u)). Since the costs for each push is the same, the optimal dissemination order is in the decreasing order of benefits b, (u). The ...
Page 78
... cost-saving ratio and average response time as the performance metrics in our experiments. Cost Saving Ratio is defined as X H.C. s XC, R, , t t where Hi is the number of times Q; can be answered by the cache, R, is the total number of ...
... cost-saving ratio and average response time as the performance metrics in our experiments. Cost Saving Ratio is defined as X H.C. s XC, R, , t t where Hi is the number of times Q; can be answered by the cache, R, is the total number of ...
Contents
17 | |
31 | |
Part 4 Industrial Sessions | 935 |
Part 5 Panels | 1041 |
Part 6 Demo Sessions | 1051 |
Author Index | 1153 |
Other editions - View all
Proceedings 2003 VLDB Conference: 29th International Conference on Very ... VLDB Limited preview - 2003 |
Proceedings 2003 VLDB Conference: 29th International Conference on Very ... VLDB No preview available - 2003 |
Common terms and phrases
ACM SIGMOD algorithm applications approach attribute average bisimulation bucket buffer cache misses clustering compressed compute Conf constraints contains context nodes corresponding cost Data Bubble data mining data set data stream database systems DBLP defined denote distance distributed edge efficient elements engine estimation evaluation example execution experiments Figure function global graph hash join hash table histograms ICDE implementation input integration interface join join algorithm load matching merge algorithm method micro-clusters MJoin operator optimization output PAC-Man Pagerank parameter partition path expression performance predicate probe problem Proc query optimization query plan query processing ranking relation repository retrieval rithm scalability scan schema Section selection semantics sequence server shows SIGMOD storage stored structure subtree techniques tion tree pattern tuples Unicode update VLDB Web.Views window workload XFDs XML document XML query XPath