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 7
Page 87
... rithm maintains the idlists which are useful for tracking cluster information. The first step is to compute N (t1, h) and N (t2, h) as discussed in the previous section. Therefore, we divide the micro-clusters in N (t1, h) U M (t2, h) ...
... rithm maintains the idlists which are useful for tracking cluster information. The first step is to compute N (t1, h) and N (t2, h) as discussed in the previous section. Therefore, we divide the micro-clusters in N (t1, h) U M (t2, h) ...
Page 101
... rithm in [1]. The synthetic data generation program takes the parameters shown in Table 3, and the values of parameters used to generate the datasets are summarized in Table 4. Both the environments of long transactions with fewer items ...
... rithm in [1]. The synthetic data generation program takes the parameters shown in Table 3, and the values of parameters used to generate the datasets are summarized in Table 4. Both the environments of long transactions with fewer items ...
Page 127
... rithm was shown to achieve higher effectiveness than the merge algorithm (Merge-1) proposed in [23]. Our experimental results show that the FQ method when used in conjunction with the new Inerge algorithm achieves high accuracies in all ...
... rithm was shown to achieve higher effectiveness than the merge algorithm (Merge-1) proposed in [23]. Our experimental results show that the FQ method when used in conjunction with the new Inerge algorithm achieves high accuracies in all ...
Page 277
You have reached your viewing limit for this book.
You have reached your viewing limit for this book.
Page 377
You have reached your viewing limit for this book.
You have reached your viewing limit for this book.
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