OOXsearch: a search engine for answering loosely structured XML queries using OO programming

  • Authors:

  • Kamal Taha;Ramez Elmasri

  • Affiliations:

  • Department of Computer Science and Engineering, The University of Texas at Arlington;Department of Computer Science and Engineering, The University of Texas at Arlington

  • Venue:
  • BNCOD'07 Proceedings of the 24th British national conference on Databases
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

There has been extensive research in XMLkeyword-based and loosely structured querying. Some frameworks work well for certain types of XML data models and fail in others. The reason is that the proposed techniques are based on finding relationships between solely individual nodes while overlooking the context of these nodes. The context of a leaf node is determined by its parent node, because it specifies one of the characteristics of its parent node. Building relationships between individual leaf nodes without consideration of their parents may result in relationships that are semantically disconnected. Since leaf nodes are nothing but characteristics of their parents, we observe that we could treat each parent-children set of nodes as one unified entity.We then find semantic relationships between the different unified entities. Based on those observations, we propose an XML semantic search engine called OOXSearch, which answers loosely structured queries. The recall and precision of the engine were evaluated experimentally and compared with two recent proposed systems [1, 2] and the results showed marked improvement.