查询多份XML文件的资料结构设计.PPTVIP

DBLAB A Document-based Approach to Indexing XML Data Ya-Hui Chang and Tsan-Lung Hsieh Department of Computer Science National Taiwan Ocean University yahui@cs.ntou.edu.tw Sept. 10th, 2002 Overview XML introduction Element block Element tree Two types of index structures Document index Element index Experiment results Conclusion Element Block Element Tree the Query Processor the Index Structures Purpose: Providing efficient query processing over multiple XML documents Two types: Document index Representing the correspondence of document identifiers and element values Element index Representing the positions of elements Document Index Based on B+-Tree: the size of each node is restricted by order; the tree is balanced. Document Index (cont) Each node is represented as an XML document. Search-key value is represented as the attribute key of the element Pointer, while the document identifier is represented as the content. Element Index The position information of elements is represented based on the order specified in DTD, or the element tree. The element indexes are partitioned into offset blocks corresponding to element blocks to capture the nesting structures of elements. It is named “offset” since we keep the relative position of elements, to reduce the cost of maintenance. Offset tuples constitute the offset block: the first component records the offset to the parent element; the last component records the pointer to the offset tuple for the next sibling element; the other components record the relative positions of sub-elements. Example of Offset Blocks Example of Retrieving Offsets Suppose we plan to retrieve all the data corresponding to the path “/Books/Book/Title”. Based on the element tree, Book is the first child of Books, and Title is the first child of Book. This information tells us which components to retrieve in the offset tuples of Books and Book. We also need to follow the sibling links. Example of Retrieving Offsets (cont) Suppose the in