-
...approach that first decomposes a twig query with or-predicates into multiple twig queries without or-predicates and then combines their results...paper, we study novel holistic-processing algorithms for twig queries with or-predicates without decomposition. in particular, we...
-
...order to flnd all occurrences of a tree/twig pattern in an xml database, a number of holistic twig join al- gorithms have been...to current algorithms in terms of query processing performance. lationships between elements. zhang (zhang 2002) proposed the multi-predicate merge join, which is a variation of the traditional merging join algorithm...
-
...finding all the occurrences of a twig pattern in an xml database is a core operation for efficient evaluation of xml queries. some researches have proposed part solutions to process xml twig queries with and,or, or not predicates. however, very little work has...
-
...little work has examined the efficient processing of xml twig queries with not-predicates. in this paper, we propose a novel holistic twig join algorithm, called twigstacklist¬, which is designed for efficient matching an xml twig pattern with negation. we show that twigstacklist¬ can identify a large query class to guarantee the i...
-
...operation for ef- flcient evaluation of xml queries. a number of algorithms have been proposed to process a twig query based on region encoding label...region encoding, to answer a twig query, tjfast only needs to access the labels of the leaf query nodes. through this, not only...
Published in 2005.
-
...finding all the occurrences of a twig pattern in an xml database is a core operation for efficient evaluation of xml queries. a number of algorithms have been proposed to process a twig query based on ...
-
...finding all the occurrences of a twig pattern in an xml database is a core operation for efficient evaluation of xml queries. holistic twig join al- gorithm has showed...join algorithms, however, cannot deal with ordered twig queries. a straightforward approach that first matches the unordered twig queries and then prunes away the...
-
...despite a large body of work on xml query processing in relational environment, systematic study of not
-twig queries has received little attention in...this paper, we present an efficient strategy to evaluate not-twig queries on top of a dewey-based tree-unaware...
-
...finding all occurrences of a twig pattern is a core operation of extensible markup language (xml) query processing. holistic
twig join algorithms, which avoid a large number of intermediate results, represent the state-of-the-art algorithms. however,
ordered xml twig join is mentioned rarely in...
-
...paper, we consider the xml query which can be represented as a query tree with twig patterns, and also consists of full-text constraints. previously, the...approach have been proposed to process such kind of queries. the main focus of this paper is constructing an...