An Efficient Method of Query Processing for Top-down XML Keyword

Abstract

Proficiently noting XML watchword inquiries has pulled in much research exertion in the most recent decade. The key variables bringing about the wastefulness of existing strategies are the basic predecessor reiteration (CAR) and visitinguseless-nodes (VUN) problems. To address the CAR problem, we propose a non specific best down handling procedure to answer a given watchword question w.r.t. LCA/SLCA/ELCA semantics. By "top-down", we imply that we visit all regular precursor (CA) nodes in a profundity to start with, left-to-correct request; by "non specific", we imply that our strategy is free of the question semantics. To address the VUN problem, we propose to utilize kid nodes, as opposed to relative nodes to test the satisfiability of a node v w.r.t. the given semantics. We propose two algorithms that depend on either conventional modified records or our recently proposed LLists to enhance the general execution. We additionally propose a few algorithms that depend on hash search to improve the task of discovering CA nodes from all included LLists. The test comes about check the advantages of our strategies as indicated by different assessment measurements.