Advanced Approaches in XML Schema - Proposal & Limitations
Explore innovative strategies in XML schema handling, including the Common Relatives (CR) approach, limitations such as irrelevant answers and schema dependencies, and detailed methodologies like generating IDREF graphs and labelling object nodes. Dive into the complexities and solutions in schema-independent XML processing.
Download Presentation
Please find below an Image/Link to download the presentation.
The content on the website is provided AS IS for your information and personal use only. It may not be sold, licensed, or shared on other websites without obtaining consent from the author. If you encounter any issues during the download, it is possible that the publisher has removed the file from their server.
You are allowed to download the files provided on this website for personal or commercial use, subject to the condition that they are used lawfully. All files are the property of their respective owners.
The content on the website is provided AS IS for your information and personal use only. It may not be sold, licensed, or shared on other websites without obtaining consent from the author.
E N D
Presentation Transcript
SCHEMA INDEPENDENT XML SCHEMA INDEPENDENT XML KEYWORD SEARCH KEYWORD SEARCH GROUP P14: LOY YUSONG MITCHELLE JAUW HADI SEBASTIAN
OUTLINE OUTLINE Limitation of LCA based approach Common Relative Approach Implementation details Experiment Contribution Limitations and challenges Demo
LCA LIMITATION LCA LIMITATION Irrelevant answers Duplicated answers Schema dependent
SCHEMA DEPENDENCY SCHEMA DEPENDENCY
SCHEMA INDEPENDENT PROPOSAL SCHEMA INDEPENDENT PROPOSAL Common Relatives (CR) approach: 1. Generating IDREF Graph 2. Labelling object nodes 3. Finding relatives of object node 4. Indexing Keywords 5. Query processing
ASSUMPTIONS ASSUMPTIONS 1.Object classes and object IDs are available. 2. Object IDs are named id in object class s attributes.
1. 1. GENERATING IDREF GRAPH GENERATING IDREF GRAPH Create an real object node for each object instance detected in the XML tree Create a virtual object node for each object being referred by 2 or more real object nodes.
1. 1. GENERATING IDREF GRAPH GENERATING IDREF GRAPH Incoming edges represent a parent-child relationship Virtual nodes have incoming edges from the real object nodes referring to it
2. LABELLING OBJECT NODES 2. LABELLING OBJECT NODES Object nodes are labelled by number Labelling of virtual nodes happen after the last real object node has been done
3. FINDING RELATIVES OF OBJECT NODES Algorithm used:
4. INDEXING KEYWORDS 4. INDEXING KEYWORDS Relative set of keyword is the union of the relative sets of object nodes matching the keyword
5. QUERY PROCESSING 5. QUERY PROCESSING Simply return the set intersection of relative sets of keywords in query
EXPERIMENT EXPERIMENT 2 datasets created More than 50 queries tested for each data set Aim: Ensure that we can find all common ancestors from all equivalent databases by using only one equivalent database
TESTING 100%!
CONTRIBUTION CONTRIBUTION Implementation of CR-semantics for XML keyword search Implemented Windows-based GUI for keyword search
LIMITATIONS AND CHALLENGES LIMITATIONS AND CHALLENGES Rigidness of XML structure accepted Keyword Restrictiveness
DEMO DEMO Dataset schema: Equivalent Databases:
