Back to Search
Start Over
An IFTr approach to approximate XML query matching
- Source :
- SMC
- Publication Year :
- 2011
- Publisher :
- IEEE, 2011.
-
Abstract
- As XML is becoming the de facto standard for data representation and communication, especially on the web, a need has been identified for efficient XML querying techniques that can overcome the dilemma of heterogeneity in XML data sources. In this work, we propose our approach of using Intuitionistic Fuzzy Trees (IFTr) to achieve approximate XML query matching, making the query results include not just the XML data trees that exactly match the query, but also the ones that partially match it. We believe that our approach has a potential to return useful query answers while pertaining good performance.
- Subjects :
- Document Structure Description
XML Encryption
Theoretical computer science
Computer science
computer.internet_protocol
Efficient XML Interchange
XML Signature
Ontology (information science)
computer.software_genre
Query optimization
External Data Representation
Query expansion
Simple API for XML
XML Schema Editor
Streaming XML
XML schema
Binary XML
computer.programming_language
Web search query
XML validation
computer.file_format
XML framework
XML database
ComputingMethodologies_DOCUMENTANDTEXTPROCESSING
computer
XML
Subjects
Details
- Database :
- OpenAIRE
- Journal :
- 2011 IEEE International Conference on Systems, Man, and Cybernetics
- Accession number :
- edsair.doi...........e843ded51d905641b53b70eaf57b661c
- Full Text :
- https://doi.org/10.1109/icsmc.2011.6084041