Abstract
The increase in the world of internet and information has given rise to a lot of information stored on the web. All the information stored in the World Wide Web has semantics and relevance these days. Searching in this pool of information on the web is a very tedious task. Keyword search similarity is an important tool for exploring and searching large data repositories whose structure is either unknown, or constantly changing. The current existing systems define various techniques that work on searching the information semantically. These techniques have various limitations that give rise to many problems in the web. If the data is organized in a definite schema then the efficient results can be easily obtained. This paper focuses on various techniques that focuses on searching of keywords using RDF schema and obtaining similarity in the web using different techniques. The main focus is on the systems that use partitioning and graph-structured techniques for searching.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Journal of Information Technology & Software Engineering
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
