Efficient Process of Top down Approach for Xml Keyword Query Processing Using Disk Based Index

Abstract

Efficiently answering XML key-phrase queries has attracted loads research attempt within the closing decade. The key factors resulting in the inefficiency of gift techniques are the commonplace-ancestor-repetition (CAR) and touring-useless-nodes (VUN) problems. Toad dress the CAR hassle, we endorse a popular pinnacle-down processing method to answer a given keyword query writ. LCA/SLCA/ELCAsemantics. By “top-down”, we suggest that we visit all not unusual ancestor (CA) nodes in an intensity-first, left-to-right order; thru “big”, we mean that our approach is independent of the question semantics. To cope with the VUN trouble, we recommend using child nodes, as an opportunity than descendant nodes to check the satisfiability of a node v writ. The given semantics. We advise algorithms which might be based totally on either traditional inverted lists or our newly proposed Lists to decorate the overall performance. We further advocate numerous algorithms that are based on hash searching for to simplify the operation of locating CA nodes from all involved Lists. The experimental results affirm the benefits of our techniques in line with several evaluation metrics.