Top- star queries on knowledge graphs through semantic-aware bounding match scores
Authors:
- Yuxiang WangYWYuxiang Wang
- Xiaoliang XuXXXiaoliang Xu
- Qifan HongQHQifan Hong
- Jiahui JinJJJiahui Jin
- Tianxing WuTWTianxing Wu
- 1 February 2021
- journal article
- research article
- Published by Elsevier in Knowledge-Based Systems
- Vol. 213
Abstract
No abstract availableKeywords
Funding Information
- Basic Public Welfare Research Program of Zhejiang Province
- National Natural Science Foundation of China
- Natural Science Foundation of Zhejiang Province
This publication has 47 references indexed in Scilit:
- Querying Knowledge Graphs by Example Entity TuplesIEEE Transactions on Knowledge and Data Engineering, 2015
- Schemaless and structureless graph queryingProceedings of the VLDB Endowment, 2014
- NeMaProceedings of the VLDB Endowment, 2013
- YAGO2: A spatially and temporally enhanced knowledge base from WikipediaArtificial Intelligence, 2013
- gStoreProceedings of the VLDB Endowment, 2011
- Graph homomorphism revisited for graph matchingProceedings of the VLDB Endowment, 2010
- Distance-joinProceedings of the VLDB Endowment, 2009
- Comparing starsProceedings of the VLDB Endowment, 2009
- RDF-3XProceedings of the VLDB Endowment, 2008
- Development and application of a metric on semantic netsIEEE Transactions on Systems, Man, and Cybernetics, 1989