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 15
Page
... Indexes for XML Queries: Bisimulation - Simulation = Negation .......................... Prakash Ramanan (Wichita State University, USA) XML Matching & Storage Phrase Matching in XML ....................................................
... Indexes for XML Queries: Bisimulation - Simulation = Negation .......................... Prakash Ramanan (Wichita State University, USA) XML Matching & Storage Phrase Matching in XML ....................................................
Page 142
... bisimulation. Each node in the compressed skeleton represents a set of nodes in the uncompressed tree. The purpose of a path query is to select a set of nodes in the uncompressed tree. However this set can be represented by a subset of ...
... bisimulation. Each node in the compressed skeleton represents a set of nodes in the uncompressed tree. The purpose of a path query is to select a set of nodes in the uncompressed tree. However this set can be represented by a subset of ...
Page 143
... bisimulation may appear reminiscent of graph schemata [5, 10 and data guides [13, 1] (these approaches use simulation rather than bisimulation) and index structures such as T-indices [17]. However, it must be stressed that these ...
... bisimulation may appear reminiscent of graph schemata [5, 10 and data guides [13, 1] (these approaches use simulation rather than bisimulation) and index structures such as T-indices [17]. However, it must be stressed that these ...
Page 148
... bisimulation on trees (respectively, OBDDs). It is unlikely that better algorithms can improve on the worst-case exponential degree of de-compression". *In real-life XML documents, we expect to see neither such extreme compression nor ...
... bisimulation on trees (respectively, OBDDs). It is unlikely that better algorithms can improve on the worst-case exponential degree of de-compression". *In real-life XML documents, we expect to see neither such extreme compression nor ...
Page 149
... bisimulation. As uncompressed tree-version of the instance. Columns (2) and (3) of. *We intend to extend our system to use indexes, and to combine it with vertical partitioning for string data mentioned in the introduction. This combines ...
... bisimulation. As uncompressed tree-version of the instance. Columns (2) and (3) of. *We intend to extend our system to use indexes, and to combine it with vertical partitioning for string data mentioned in the introduction. This combines ...
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