{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T09:28:50Z","timestamp":1763458130403,"version":"3.45.0"},"publisher-location":"New York, NY, USA","reference-count":40,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,6,14]],"date-time":"2017-06-14T00:00:00Z","timestamp":1497398400000},"content-version":"vor","delay-in-days":365,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61133002 and 61421003"],"award-info":[{"award-number":["61133002 and 61421003"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["652976"],"award-info":[{"award-number":["652976"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Shenzhen Science and Technology Fund","award":["JCYJ20150529164656096"],"award-info":[{"award-number":["JCYJ20150529164656096"]}]},{"name":"973 Program","award":["2014CB340302 and 2012CB316200"],"award-info":[{"award-number":["2014CB340302 and 2012CB316200"]}]},{"name":"Guangdong Applied R&D Program","award":["2015B010121006"],"award-info":[{"award-number":["2015B010121006"]}]},{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/J015377\/1 and EP\/M025268\/1"],"award-info":[{"award-number":["EP\/J015377\/1 and EP\/M025268\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["III 1302212"],"award-info":[{"award-number":["III 1302212"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Shenzhen Peacock Program","award":["1105100030834361"],"award-info":[{"award-number":["1105100030834361"]}]},{"name":"Guangdong Innovative Research Team Program","award":["2011D005"],"award-info":[{"award-number":["2011D005"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,6,14]]},"DOI":"10.1145\/2882903.2882937","type":"proceedings-article","created":{"date-parts":[[2016,6,16]],"date-time":"2016-06-16T15:01:52Z","timestamp":1466089312000},"page":"1215-1230","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":27,"title":["Adding Counting Quantifiers to Graph Patterns"],"prefix":"10.1145","author":[{"given":"Wenfei","family":"Fan","sequence":"first","affiliation":[{"name":"University of Edinburgh & Beihang University, Edinburgh, United Kingdom"}]},{"given":"Yinghui","family":"Wu","sequence":"additional","affiliation":[{"name":"Washington State University, Pullman, WA, USA"}]},{"given":"Jingbo","family":"Xu","sequence":"additional","affiliation":[{"name":"University of Edinburgh & Beihang University, Edinburgh, United Kingdom"}]}],"member":"320","published-online":{"date-parts":[[2016,6,14]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Nielsen global online consumer survey. http:\/\/www.nielsen.com\/content\/dam\/corporate\/us\/en\/~newswire\/uploads\/2009\/07\/pr_global-study_07709.pdf."},{"key":"e_1_3_2_1_2_1","unstructured":"Pokec social network. http:\/\/snap.stanford.edu\/data\/soc-pokec.html."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/170036.170072"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1287\/mksc.1070.0350"},{"key":"e_1_3_2_1_5_1","volume-title":"CIDR","author":"Amer-Yahia S.","year":"2009","unstructured":"S. Amer-Yahia, L. V. S. Lakshmanan, and C. Yu. Socialscope: Enabling information discovery on social content sites. In CIDR, 2009."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-006-1350-7"},{"key":"e_1_3_2_1_7_1","unstructured":"D. A. Bader and K. Madduri. Gtgraph: A synthetic graph generator suite."},{"key":"e_1_3_2_1_8_1","volume-title":"Do your online friends make you pay? A randomized field experiment in an online music social network. NBER working paper","author":"Bapna R.","year":"2012","unstructured":"R. Bapna and A. Umyarov. Do your online friends make you pay? A randomized field experiment in an online music social network. NBER working paper, 2012."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1718487.1718492"},{"key":"e_1_3_2_1_10_1","unstructured":"H. Blau N. Immerman and D. Jensen. A visual language for querying and updating graphs. University of Massachusetts Amherst Computer Science Technical Report 37:2002 2002."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623660"},{"key":"e_1_3_2_1_12_1","unstructured":"P. Burkhardt and C. Waring. An NSA big graph experiment. Technical Report NSA-RD-2013-056002v1 U.S. National Security Agency 2013."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/338219.338254"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623623"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2489791"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.14778\/2824032.2824048"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488388.2488425"},{"key":"e_1_3_2_1_18_1","volume-title":"USEWOD workshop","author":"Gallego M. A.","year":"2011","unstructured":"M. A. Gallego, J. D. Fern\u00e1ndez, M. A. Mart\u0131nez-Prieto, and P. de la Fuente. An empirical study of real-world SPARQL queries. In USEWOD workshop, 2011."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1458082.1458149"},{"key":"e_1_3_2_1_20_1","volume-title":"ICT Innovations","author":"Grujic I.","year":"2014","unstructured":"I. Grujic, S. Bogdanovic-Dinic, and L. Stoimenov. Collecting and analyzing data from e-government facebook pages. In ICT Innovations, 2014."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/795662.796255"},{"key":"e_1_3_2_1_22_1","volume-title":"Scalable SPARQL querying of large RDF graphs. PVLDB, 4(11)","author":"Huang J.","year":"2011","unstructured":"J. Huang, D. J. Abadi, and K. Ren. Scalable SPARQL querying of large RDF graphs. PVLDB, 4(11), 2011."},{"key":"e_1_3_2_1_23_1","first-page":"1117","volume-title":"Encyclopedia of Parallel Computing","author":"Karypis G.","year":"2011","unstructured":"G. Karypis. Metis and parmetis. In Encyclopedia of Parallel Computing, pages 1117--1124. 2011."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/1619995.1620047"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/645924.671025"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(90)90192-K"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.14778\/2535568.2448946"},{"key":"e_1_3_2_1_28_1","volume-title":"SPARQLog: SPARQL with rules and quantification. Semantic Web Information Management: A Model-Based Perspective, page 341","author":"Ley C.","year":"2010","unstructured":"C. Ley, B. Linse, and O. Poppe. SPARQLog: SPARQL with rules and quantification. Semantic Web Information Management: A Model-Based Perspective, page 341, 2010."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.5555\/1024196"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013284820704"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488388.2488455"},{"key":"e_1_3_2_1_32_1","volume-title":"AMW","author":"Mart\u0131n M.","year":"2011","unstructured":"M. Mart\u0131n, C. Gutierrez, and P. Wood. SNQL: A social networks query and transformation language. In AMW, 2011."},{"key":"e_1_3_2_1_33_1","volume-title":"Computational Complexity","author":"Papadimitriou C. H.","year":"1994","unstructured":"C. H. Papadimitriou. Computational Complexity. Addison-Wesley, 1994."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(95)00079-8"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.14778\/2735479.2735493"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-34416-0_28"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2588557"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/235968.233311"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242667"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/1010614.1010616"}],"event":{"name":"SIGMOD\/PODS'16: International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"location":"San Francisco California USA","acronym":"SIGMOD\/PODS'16"},"container-title":["Proceedings of the 2016 International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2882903.2882937","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2882903.2882937","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2882903.2882937","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T09:18:05Z","timestamp":1763457485000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2882903.2882937"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,14]]},"references-count":40,"alternative-id":["10.1145\/2882903.2882937","10.1145\/2882903"],"URL":"https:\/\/doi.org\/10.1145\/2882903.2882937","relation":{},"subject":[],"published":{"date-parts":[[2016,6,14]]},"assertion":[{"value":"2016-06-14","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}