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 41
... structure and optimization scheme geared to identify and exploit such locality. Exploit prune. The presence of the prune operator presents additional opportunities for optimization. Typically, the prune operator is employed as the last ...
... structure and optimization scheme geared to identify and exploit such locality. Exploit prune. The presence of the prune operator presents additional opportunities for optimization. Typically, the prune operator is employed as the last ...
Page 44
... structural and statistical summaries of the graph structure [11]. Our clustered representation scheme is similar in spirit, but is specialized to Web graphs. 8 Conclusion In this paper, we addressed the problem of formulating and ...
... structural and statistical summaries of the graph structure [11]. Our clustered representation scheme is similar in spirit, but is specialized to Web graphs. 8 Conclusion In this paper, we addressed the problem of formulating and ...
Page 129
... structure of current search engines. These engines, like many other information retrieval tools, are based on an inverted index, which is an index structure that allows efficient retrieval of documents containing a particular word (or ...
... structure of current search engines. These engines, like many other information retrieval tools, are based on an inverted index, which is an index structure that allows efficient retrieval of documents containing a particular word (or ...
Page 134
... structures for matching up postings from the different lists that would slow down computation. 5.2 Separating Large ... structure. We first process the two fancy lists. For all documents occurring in both of the lists, we compute their ...
... structures for matching up postings from the different lists that would slow down computation. 5.2 Separating Large ... structure. We first process the two fancy lists. For all documents occurring in both of the lists, we compute their ...
Page 141
... structure of the XML document. We demonstrate in this paper that the tree structure can be effectively compressed and manipulated using techniques derived from symbolic model checking. Specifically, we show first that succinct ...
... structure of the XML document. We demonstrate in this paper that the tree structure can be effectively compressed and manipulated using techniques derived from symbolic model checking. Specifically, we show first that succinct ...
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