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 79
Page 35
... tuples of R, we can define a new relation [R, w that is simply R with an additional implicit real-valued attribute w.” Specifically, for each tuple t e R, [R, w) contains a tuple t' that contains all the attributes of t and in addition ...
... tuples of R, we can define a new relation [R, w that is simply R with an additional implicit real-valued attribute w.” Specifically, for each tuple t e R, [R, w) contains a tuple t' that contains all the attributes of t and in addition ...
Page 36
... tuples are ranked using the normalized PageRank of the constituent pages. As another example, JP could contain an element f fidf(s) that ranks tuples of a page relation based on the ranks of the pages (using the standard TF-IDF ranking ...
... tuples are ranked using the normalized PageRank of the constituent pages. As another example, JP could contain an element f fidf(s) that ranks tuples of a page relation based on the ranks of the pages (using the standard TF-IDF ranking ...
Page 38
... tuples of the resulting relation are constructed. The composition function assigns a new rank for each tuple of the result, using the ranks of all the tuples in the operand relations. We provide several examples of rank composition in ...
... tuples of the resulting relation are constructed. The composition function assigns a new rank for each tuple of the result, using the ranks of all the tuples in the operand relations. We provide several examples of rank composition in ...
Page 117
... tuples that satisfy the query the best but not necessarily completely in an efficient manner. Top-N queries are gaining popularity in relational databases and are expected to be very useful for e-commerce applications. Many companies ...
... tuples that satisfy the query the best but not necessarily completely in an efficient manner. Top-N queries are gaining popularity in relational databases and are expected to be very useful for e-commerce applications. Many companies ...
Page 118
... tuples. For example, if N = 20 and the number of databases is 200, then at least 180 of the databases won't be useful for this query. This simple method incurs unnecessary cost to send the query to the useless sites and unnecessary cost ...
... tuples. For example, if N = 20 and the number of databases is 200, then at least 180 of the databases won't be useful for this query. This simple method incurs unnecessary cost to send the query to the useless sites and unnecessary cost ...
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