-
...this paper presents a performance analysis of strategies for storing xml data sets in relational databases, focusing on xml datasets that are a combination of structured and semi-structured data. the analysis demonstrates advantages of a hybrid approach combining structure mapping and xml data type instances. however problems...
-
...tween elements. one salient advantage of this algorithm is that it employs the inlining feature of the inlining-based storage of xml documents, which is known as one of the best relational xml storage schemes. both our algorithmic analysis and experimental study show that...
-
...computational overhead and high accuracy for many xml processing tasks. specifically, these data structures are very useful for both selectivity estimation and approximate...discuss the models and issues of synopsis data structures for xml databases, and we complete our analysis by selecting and discussing future perspectives for this research field....
-
...selection predicates on multiple elements related by a tree structure. finding all occurrences of such a twig pattern in an xml database is a core operation...holistic twig join algorithm, twigstack, for matching an xml query twig pattern. our technique uses a chain of linked stacks to compactly represent partial results to root-to-leaf...
-
...giving rise to a multitude of storage schemes for xml in relational database systems (rdbss). in this paper we examine how native xml indexing techniques can boost the...how it supports the evaluation of a clean formal language of conjunctive xml queries. unlike relational storage schemes for xml, the rcadg largely preserves the...
-
...to propose and implement techniques for efficient managing of xml data. a natural alternative is to exploit features of (object-)relational database sys- tems, i.e...practical history. the main concern of such techniques is the choice of an appropriate xml-to-relational mapping strategy. in this paper we focus...
-
...partition path-based (ppb) grouping strategy to store com- pressed xml data in a stream of blocks. in addition, we employ...effective technique to support evaluation of selection and aggregate xpath queries of the compressed data. we present a formal analysis and empirical study of these tech- niques. the bss...
-
...time vulnerable, the increasing size of xml documents and the complexity of evaluating xml queries pose new performance challenges...we propose a parallelisation model for xml data processing, where the data storage strategies, data placement methods and query evaluation techniques have been studied. other related issues are also presented....
-
...query performance issues over semi-structured data have led to the emergence of materialised xml views as a means of restricting the data structure processed by a query. however...extend our earlier work on structural xml compression to produce a combina- tion of structural summarisation and data compression techniques...
-
...this paper, we ask whether xml access control can be supported when underlying (xml or relational) storage system does
not provide adequate...without relying on security features of underlying storage system, and (3) such independency makes qfilter capable of many emerging applications, such as...