We use the UB-tree for indexing the vector spaces and the M-tree for indexing the metric spaces. The data structures for indexing the vector spaces lead rather ...

Abstract. Using the terminology usual in databases, it is possible to view XML as a language for data modelling. To retrieve XML data from.

This paper introduces a geometric framework for indexing and querying XML data conceived in this way, and uses the UB-tree forindexing the vector spaces and ...

Section 4.1 introduces basics of indexing XML data with UB-trees. More specifically, how to index the contents of paths. Section 4.2 describes an indexing ...

Abstract: We propose a multidimensional approach to store XML data in relational database systems. In contrast to other efforts we suggest a solution to the ...

Indexing XML data with UB-trees. In. Proceedings of Advances in Databases and Information Systems, ADBIS 2002, 6th. East European Conference, Bratislava ...

The former indexes nodes by their ancestor-descendant relationships in the original XML document tree and the latter indexes nodes ... The un- derlined non- ...

The approaches to indexing XML data use paged and balanced multi-dimensional data structures like UB-tree and R*-trees are revised and a novel approach to ...

XML data objects are commonly modeled by a tree structure, where nodes represent elements, attributes and text data, and parent-child node pairs represent ...

5.3 Indexing compressed XML data: the XBZIPINDEX tool. In section 4 we showed that navigation and search operations over a labeled tree can be implemented ...