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, sometimes
it 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 semantics
to overcome the CAR problem.
Keywords: BFS; Keyword; Search; XML
Document Type: Research Article
Affiliations: Bannari Amman Institute of Technology, Sathyamangalam 638401, Tamil Nadu, India
Publication date: 01 May 2018
- Journal of Computational and Theoretical Nanoscience is an international peer-reviewed journal with a wide-ranging coverage, consolidates research activities in all aspects of computational and theoretical nanoscience into a single reference source. This journal offers scientists and engineers peer-reviewed research papers in all aspects of computational and theoretical nanoscience and nanotechnology in chemistry, physics, materials science, engineering and biology to publish original full papers and timely state-of-the-art reviews and short communications encompassing the fundamental and applied research.
- Editorial Board
- Information for Authors
- Submit a Paper
- Subscribe to this Title
- Terms & Conditions
- Ingenta Connect is not responsible for the content or availability of external websites
- Access Key
- Free content
- Partial Free content
- New content
- Open access content
- Partial Open access content
- Subscribed content
- Partial Subscribed content
- Free trial content