Ntjfsat¬: a novel method for query with not-predicates on xml data

Authors:
Vahid Garakani;Sayyed Kamyar Izadi;Mostafa Haghjoo;Mohammad Harizi
Affiliations:
Iran University of Science and Technology, Tehran, Iran;Iran University of Science and Technology, Tehran, Iran;Iran University of Science and Technology, Tehran, Iran;Iran Ramhormoz Azad University, Ramhormoz, Iran
Venue:
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
Year:
2007

Citing 6
Cited 1

Holistic twig joins: optimal XML pattern matching

Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Structural Joins: A Primitive for Efficient XML Query Pattern Matching

ICDE '02 Proceedings of the 18th International Conference on Data Engineering
From region encoding to extended dewey: on efficient processing of XML twig pattern matching

VLDB '05 Proceedings of the 31st international conference on Very large data bases
Optimizing cursor movement in holistic twig joins

Proceedings of the 14th ACM international conference on Information and knowledge management
Twig2Stack: bottom-up processing of generalized-tree-pattern queries over XML documents

VLDB '06 Proceedings of the 32nd international conference on Very large data bases
PathStack¬: a holistic path join algorithm for path query with not-predicates on XML data

DASFAA'05 Proceedings of the 10th international conference on Database Systems for Advanced Applications

ANDES: efficient evaluation of NOT-twig queries in relational databases

The VLDB Journal — The International Journal on Very Large Data Bases

Quantified Score

Hi-index	0.00

Visualization

Abstract

Previous researches, in the filed of XML databases, have been done to evaluate XML queries with AND-branches. However, as far as we know, very little work has examined the efficient processing of XML queries with NOT-predicates. Also these methods have to process all of the query nodes in the document when dealing with queries with NOT-branch. In this paper, with some modification in TJFast method, we propose a new manner for answering to various NOT-queries. This method processes nodes efficiently, in a way that in the ideal state, we obtain part of the answer after the process of each node, and we don't have any unreasonable processing of each node.