Abstract
The recent explosive growth of knowledge graphs (KGs) has enhanced a wide range of Web applications. Among others, the established task of relationship search benefits from KGs since complex relationships that were hidden and distributed in multiple webpages are now explicitly available as subgraphs of an integrated KG. However, new challenges arose as to the efficiency of search over large KGs. In this article, we introduce our recent studies on relationship search, including search algorithms based on novel index structures, methods for relationship clustering to support result exploration, and query relaxation techniques to provide alternative results for failed searches. We also present emerging applications and discuss future research directions.
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 callDisclaimer: 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.
