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 74
Page 26
... relations and estimations of the data distributions of intermediate query results are obtained by appropriate manipulations of these base-relation histograms [12]. It discusses the possibility of maintaining histograms on complex query ...
... relations and estimations of the data distributions of intermediate query results are obtained by appropriate manipulations of these base-relation histograms [12]. It discusses the possibility of maintaining histograms on complex query ...
Page 35
... relation. Given a relation R and a strict partial ordering > R (i.e., an irreflexive, anti-symmetric, and transitive binary relation) on the tuples of R, we refer to the pair (R, PR] as an ordered relation on R. Conversely, R is 'We do ...
... relation. Given a relation R and a strict partial ordering > R (i.e., an irreflexive, anti-symmetric, and transitive binary relation) on the tuples of R, we refer to the pair (R, PR] as an ordered relation on R. Conversely, R is 'We do ...
Page 36
... relations. A relation R is said to be a Web relation if it contains at least one attribute whose domain is Tp, Ti, 2*, or 2%. A ranked relation [R, f or an ordered relation [R, >R} is a Web relation if the corresponding base relation R is a ...
... relations. A relation R is said to be a Web relation if it contains at least one attribute whose domain is Tp, Ti, 2*, or 2%. A ranked relation [R, f or an ordered relation [R, >R} is a Web relation if the corresponding base relation R is a ...
Page 37
... relation plain relations by setting one or both of > x and > y to be empty. Set operations with ranking. When a ranked relation |R, f is supplied as an operand to a union, intersection, or set-difference operator, [R, f is replaced by ...
... relation plain relations by setting one or both of > x and > y to be empty. Set operations with ranking. When a ranked relation |R, f is supplied as an operand to a union, intersection, or set-difference operator, [R, f is replaced by ...
Page 38
... relations. Rank (W). Operator V simply formalizes the act of applying a ranking function to a base relation. Thus, given a relation R and ranking function f : R × {R} – {0, 1], we define U (f, R) = [R, f). Compose (€hop). The compose ...
... relations. Rank (W). Operator V simply formalizes the act of applying a ranking function to a base relation. Thus, given a relation R and ranking function f : R × {R} – {0, 1], we define U (f, R) = [R, f). Compose (€hop). The compose ...
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