{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,30]],"date-time":"2026-09-30T10:23:06Z","timestamp":1790763786441,"version":"4.1.0"},"publisher-location":"New York, NY, USA","reference-count":35,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,10,17]],"date-time":"2022-10-17T00:00:00Z","timestamp":1665964800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"National NSF of China","award":["62072149"],"award-info":[{"award-number":["62072149"]}]},{"name":"Primary Research \\& Development Plan of Zhejiang Province","award":["2021C03156 and 2021C02004"],"award-info":[{"award-number":["2021C03156 and 2021C02004"]}]},{"name":"Novo Nordisk Foundation","award":["NNF22OC0072415"],"award-info":[{"award-number":["NNF22OC0072415"]}]},{"name":"Fundamental Research Funds for the Provincial Universities of Zhejiang","award":["GK219909299001-006"],"award-info":[{"award-number":["GK219909299001-006"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,10,17]]},"DOI":"10.1145\/3511808.3557158","type":"proceedings-article","created":{"date-parts":[[2022,10,16]],"date-time":"2022-10-16T01:29:57Z","timestamp":1665883797000},"page":"5034-5038","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Approximate and Interactive Processing of Aggregate Queries on Knowledge Graphs: A Demonstration"],"prefix":"10.1145","author":[{"given":"Yuxiang","family":"Wang","sequence":"first","affiliation":[{"name":"Hangzhou Dianzi University, Hangzhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Arijit","family":"Khan","sequence":"additional","affiliation":[{"name":"Aalborg University, Aalborg, Denmark"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiaoliang","family":"Xu","sequence":"additional","affiliation":[{"name":"Hangzhou Dianzi University, Hangzhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shuzhan","family":"Ye","sequence":"additional","affiliation":[{"name":"Hangzhou Dianzi University, Hangzhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shihuang","family":"Pan","sequence":"additional","affiliation":[{"name":"Hangzhou Dianzi University, Hangzhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yuhan","family":"Zhou","sequence":"additional","affiliation":[{"name":"Hangzhou Dianzi University, Hangzhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2022,10,17]]},"reference":[{"key":"e_1_3_2_2_1_1","unstructured":"2014. QALD-4. http:\/\/qald.aksw.org\/index.php?x=challenge&q=4.  2014. QALD-4. http:\/\/qald.aksw.org\/index.php?x=challenge&q=4."},{"key":"e_1_3_2_2_2_1","unstructured":"2021. Our Code and Data. https:\/\/anonymous.4open.science\/r\/60487db8-a5a4--46d6-bfeb-cbb326df0c4d\/.  2021. Our Code and Data. https:\/\/anonymous.4open.science\/r\/60487db8-a5a4--46d6-bfeb-cbb326df0c4d\/."},{"key":"e_1_3_2_2_3_1","unstructured":"2022. Apache Jena. https:\/\/jena.apache.org\/.  2022. Apache Jena. https:\/\/jena.apache.org\/."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"crossref","unstructured":"S. Agarwal B. Mozafari A. Panda H. Milner S. Madden and I. Stoica. 2013. BlinkDB: Queries with Bounded Errors and Bounded Response Times on Very Large Data. In Eurosys.  S. Agarwal B. Mozafari A. Panda H. Milner S. Madden and I. Stoica. 2013. BlinkDB: Queries with Bounded Errors and Bounded Response Times on Very Large Data. In Eurosys.","DOI":"10.1145\/2465351.2465355"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376746"},{"key":"e_1_3_2_2_6_1","first-page":"149","article-title":"An Analytical Study of Large SPARQL Query Logs","volume":"11","author":"Bonifati A.","year":"2017","unstructured":"A. Bonifati , W. Martens , and T. Timm . 2017 . An Analytical Study of Large SPARQL Query Logs . PVLDB 11 , 2 (2017), 149 -- 161 . A. Bonifati, W. Martens, and T. Timm. 2017. An Analytical Study of Large SPARQL Query Logs. PVLDB 11, 2 (2017), 149--161.","journal-title":"PVLDB"},{"key":"e_1_3_2_2_7_1","unstructured":"A. Bordes N. Usunier A. Garc\u00eda-Dur\u00e1n J. Weston and O. Yakhnenko. 2013. Translating Embeddings for Modeling Multi-relational Data. In NIPS.  A. Bordes N. Usunier A. Garc\u00eda-Dur\u00e1n J. Weston and O. Yakhnenko. 2013. Translating Embeddings for Modeling Multi-relational Data. In NIPS."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"crossref","unstructured":"A. Bordes J. Weston R. Collobert and Y. Bengio. 2011. Learning Structured Embeddings of Knowledge Bases. In AAAI.  A. Bordes J. Weston R. Collobert and Y. Bengio. 2011. Learning Structured Embeddings of Knowledge Bases. In AAAI.","DOI":"10.1609\/aaai.v25i1.7917"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"crossref","unstructured":"S. Chaudhuri B. Ding and S. Kandula. 2017. Approximate Query Processing: No Silver Bullet. In SIGMOD.  S. Chaudhuri B. Ding and S. Kandula. 2017. Approximate Query Processing: No Silver Bullet. In SIGMOD.","DOI":"10.1145\/3035918.3056097"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.14778\/3342263.3342642"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"crossref","unstructured":"A. Grover and J. Leskovec. 2016. Node2vec: Scalable Feature Learning for Networks. In KDD.  A. Grover and J. Leskovec. 2016. Node2vec: Scalable Feature Learning for Networks. In KDD.","DOI":"10.1145\/2939672.2939754"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"crossref","unstructured":"S. Han L. Zou J. X. Yu and D. Zhao. 2017. Keyword Search on RDF Graphs - A Query Graph Assembly Approach. In CIKM.  S. Han L. Zou J. X. Yu and D. Zhao. 2017. Keyword Search on RDF Graphs - A Query Graph Assembly Approach. In CIKM.","DOI":"10.1145\/3132847.3132957"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2012.06.001"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"crossref","unstructured":"X. Huang J. Zhang D. Li and P. Li. 2019. Knowledge Graph Embedding Based Question Answering. In WSDM.  X. Huang J. Zhang D. Li and P. Li. 2019. Knowledge Graph Embedding Based Question Answering. In WSDM.","DOI":"10.1145\/3289600.3290956"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"crossref","unstructured":"G. Ji S. He L. Xu K. Liu and J. Zhao. 2015. Knowledge Graph Embedding via Dynamic Mapping Matrix. In ACL.  G. Ji S. He L. Xu K. Liu and J. Zhao. 2015. Knowledge Graph Embedding via Dynamic Mapping Matrix. In ACL.","DOI":"10.3115\/v1\/P15-1067"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"crossref","unstructured":"J. Jin S. Khemmarat L. Gao and J. Luo. 2015. Querying Web-Scale Information Networks Through Bounding Matching Scores. In WWW.  J. Jin S. Khemmarat L. Gao and J. Luo. 2015. Querying Web-Scale Information Networks Through Bounding Matching Scores. In WWW.","DOI":"10.1145\/2736277.2741131"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.14778\/2535569.2448952"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1111\/rssb.12050"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.3233\/SW-140134"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"crossref","unstructured":"Y. Li T. Ge and C. X. Chen. 2020. Online Indices for Predictive Top-k Entity and Aggregate Queries on Knowledge Graphs. In ICDE.  Y. Li T. Ge and C. X. Chen. 2020. Online Indices for Predictive Top-k Entity and Aggregate Queries on Knowledge Graphs. In ICDE.","DOI":"10.1109\/ICDE48307.2020.00096"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1186\/s40537-020-00383-w"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"crossref","unstructured":"M. Lissandrini T. B. Pedersen K. Hose and D. Mottin. 2020. Knowledge Graph Exploration: Where Are We and Where Are We Going? ACM SIGWEB Newsletter 4 (2020).  M. Lissandrini T. B. Pedersen K. Hose and D. Mottin. 2020. Knowledge Graph Exploration: Where Are We and Where Are We Going? ACM SIGWEB Newsletter 4 (2020).","DOI":"10.1145\/3409481.3409485"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3191513"},{"key":"e_1_3_2_2_24_1","unstructured":"M. Nickel V. Tresp and H.-P. Kriegel. 2011. A Three-Way Model for Collective Learning on Multi-Relational Data. In ICML.  M. Nickel V. Tresp and H.-P. Kriegel. 2011. A Three-Way Model for Collective Learning on Multi-Relational Data. In ICML."},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"crossref","unstructured":"Y. Wang A. Khan T. Wu J. Jin and H. Yan. 2020. Semantic Guided and Response Times Bounded Top-k Similarity Search over Knowledge Graphs. In ICDE.  Y. Wang A. Khan T. Wu J. Jin and H. Yan. 2020. Semantic Guided and Response Times Bounded Top-k Similarity Search over Knowledge Graphs. In ICDE.","DOI":"10.1109\/ICDE48307.2020.00045"},{"key":"e_1_3_2_2_26_1","volume-title":"Knowledge Graphs: Fast Approximation with Semantic-aware Sampling. In ICDE.","author":"Wang Y.","year":"2022","unstructured":"Y. Wang , A. Khan , X. Xu , J. Jin , Q. Hong , and T. Fu . 2022 . Aggregate Queries on Knowledge Graphs: Fast Approximation with Semantic-aware Sampling. In ICDE. Y. Wang, A. Khan, X. Xu, J. Jin, Q. Hong, and T. Fu. 2022. Aggregate Queries on Knowledge Graphs: Fast Approximation with Semantic-aware Sampling. In ICDE."},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"crossref","unstructured":"Z. Wang J. Zhang J. Feng and Z. Chen. 2014. Knowledge Graph Embedding by Translating on Hyperplanes. In AAAI.  Z. Wang J. Zhang J. Feng and Z. Chen. 2014. Knowledge Graph Embedding by Translating on Hyperplanes. In AAAI.","DOI":"10.1609\/aaai.v28i1.8870"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1561\/1900000064"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"crossref","unstructured":"S. Yang F. Han Y. Wu and X. Yan. 2016. Fast Top-k Search in Knowledge Graphs. In ICDE.  S. Yang F. Han Y. Wu and X. Yan. 2016. Fast Top-k Search in Knowledge Graphs. In ICDE.","DOI":"10.1109\/ICDE.2016.7498307"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732286.2732293"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2018.12.032"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"crossref","unstructured":"W. Zheng L. Zou X. Lian J. X. Yu S. Song and D. Zhao. 2015. How to Build Templates for RDF Question\/Answering: An Uncertain Graph Similarity Join Approach. In SIGMOD.  W. Zheng L. Zou X. Lian J. X. Yu S. Song and D. Zhao. 2015. How to Build Templates for RDF Question\/Answering: An Uncertain Graph Similarity Join Approach. In SIGMOD.","DOI":"10.1145\/2723372.2747648"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.14778\/2983200.2983201"},{"key":"e_1_3_2_2_34_1","volume-title":"RDF: A Graph Driven Approach. In SIGMOD.","author":"Zou L.","year":"2014","unstructured":"L. Zou , R. Huang , H. Wang , J. X. Yu , W. He , and D. Zhao . 2014 . Natural Language Question Answering over RDF: A Graph Driven Approach. In SIGMOD. L. Zou, R. Huang, H. Wang, J. X. Yu, W. He, and D. Zhao. 2014. Natural Language Question Answering over RDF: A Graph Driven Approach. In SIGMOD."},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-013-0337-7"}],"event":{"name":"CIKM '22: The 31st ACM International Conference on Information and Knowledge Management","location":"Atlanta GA USA","acronym":"CIKM '22","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the 31st ACM International Conference on Information & Knowledge Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3511808.3557158","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3511808.3557158","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:49:06Z","timestamp":1750182546000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3511808.3557158"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,17]]},"references-count":35,"alternative-id":["10.1145\/3511808.3557158","10.1145\/3511808"],"URL":"https:\/\/doi.org\/10.1145\/3511808.3557158","relation":{},"subject":[],"published":{"date-parts":[[2022,10,17]]},"assertion":[{"value":"2022-10-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}