XML Keyword Search Using Breadth-First Search

摘要

Keyword search is the one of the most reliable way of information retrieval over XML data. Most widely used XML query processing techniques are Lowest Common Ancestor (LCA), Smallest LCA (SLCA) and Exclusive LCA (ELCA). If the semantic constraints are applied to LCA, SLCA or ELCA, sometimesit returns NULL or missing elements and undesired results due to inefficiency of existing methods are the common-ancestor-repetition (CAR) and visiting-useless-nodes (VUN) problems. This paper proposes a generic Breadth-First Search (BFS) strategy to answer a given keyword query semanticsto overcome the CAR problem.