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 84
Page 47
... denote the set of all-pairs R-answers for the query Q over a tree T and use Ans;"(Q) to denote the set of star R-answers for Q over T. It is not difficult to see that for all trees T, relationships R and queries Q, Ans;"(Q) C Ans;"(Q) ...
... denote the set of all-pairs R-answers for the query Q over a tree T and use Ans;"(Q) to denote the set of star R-answers for Q over T. It is not difficult to see that for all trees T, relationships R and queries Q, Ans;"(Q) C Ans;"(Q) ...
Page 48
... denote the set of maximal answers in Ans?"(Q). 3.4 The Interconnection Relationship We present a relation which can be used to determine whether a pair of nodes is meaningfully related. We found this relation to be intuitive, and it ...
... denote the set of maximal answers in Ans?"(Q). 3.4 The Interconnection Relationship We present a relation which can be used to determine whether a pair of nodes is meaningfully related. We found this relation to be intuitive, and it ...
Page 49
... denote the number of times that k appears in ni. The term frequency of k in ni is defined as occ(k, n) max{occ(k', n) ... denoted as w(k, n). By definition, w(k, n) is 0 if k does not appear in ni. A weight of 0 is not stored explicitly ...
... denote the number of times that k appears in ni. The term frequency of k in ni is defined as occ(k, n) max{occ(k', n) ... denoted as w(k, n). By definition, w(k, n) is 0 if k does not appear in ni. A weight of 0 is not stored explicitly ...
Page 50
... denote the entry of V., corresponding to the pair (l, k). Let Nieaf be the set of leaf descendents of n. The values in the profile of n, (i.e., VA) are defined as follows: f - -. wo-(?--". to. 0 otherwise Consider a search term t. (It is ...
... denote the entry of V., corresponding to the pair (l, k). Let Nieaf be the set of leaf descendents of n. The values in the profile of n, (i.e., VA) are defined as follows: f - -. wo-(?--". to. 0 otherwise Consider a search term t. (It is ...
Page 52
... denote the boolean value of whether i and j are interconnected. The index structures that are used to efficiently execute this procedure are not specified. Note that the order that our for loops are evaluated (in Lines 1, 2 and in Lines ...
... denote the boolean value of whether i and j are interconnected. The index structures that are used to efficiently execute this procedure are not specified. Note that the order that our for loops are evaluated (in Lines 1, 2 and in Lines ...
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