Querying Knowledge Graphs by Example Entity Tuples
1Querying Knowledge Graphs byExample Entity Tuples Nandish Jayaram, Arijit Khan, Chengkai LiMember, IEEE, Xifeng YanMember, IEEE, Ramez ElmasriAbstract We witness an unprecedented proliferation of Knowledge Graphs that record millions of entities and their Knowledge Graphs are structure-flexible and content-rich, they are difficult to use. The challenge lies in the gap between theiroverwhelming complexity and the limited database Knowledge of non-professional users. If writing structured queriesover simple tables is difficult, complex Graphs are only harder to an initial step toward improving the usability of Knowledge Graphs ,we propose to query such data by Example Entity Tuples , without requiring users to form complex graph queries.
graphs in the lattice can be prohibitively expensive. For efficient query processing (Sec.5), GQBE employs a top-k lattice exploration algorithm that only partially evaluates the lattice nodes in the order of their corresponding query graphs’ upper-bound scores. We summarize the contributions of this paper as follows:
Download Querying Knowledge Graphs by Example Entity Tuples
Information
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document: