|
Abstract:
|
XML keyword search has been a widely researched area . [15] has proposed an XML semantic search engine called OOXSearch , which answers loosely structured queries . The framework of OOXSearch takes into account the semantic relationship between nodes based on their contexts . The context of a node is determined by its parent node . The label "name" , for example , could mean the name of a book and could also mean the name of the book's author . If we try to consider the relationship between these two nodes without considering their parent nodes , we would be drawing the incorrect conclusion that these two nodes represent the characteristics of two entities belonging to the same type . Thus , the OOXSearch framework treats a parent and its leaf nodes as a single unified entity . The OOXSearch Engine works well for all types of XML trees , except for one scenario where a parent and its child node belong to the same type and are both having leaf children nodes . In this thesis , we propose an extension to the OOXSearch Engine that handles the above mentioned case . We experimentally evaluated the extended search engine and compared the results with other systems .
[15] Kamal Taha , Ramez Elmasri ,
OOXSearch : A Search Engine for
Answering Loosely Structured XML
Queries Using OO Programming . In
Proceedings of the 24th British
National Conference on Databases
(BNCOD 07 ) , published in LNCS
4587 . |