{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:49:31Z","timestamp":1750308571838,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":35,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,6,14]],"date-time":"2016-06-14T00:00:00Z","timestamp":1465862400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/J015377\/1,EP\/M025268\/1"],"award-info":[{"award-number":["EP\/J015377\/1,EP\/M025268\/1"]}],"id":[{"id":"10.13039\/501100000266","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"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61421003,61133002"],"award-info":[{"award-number":["61421003,61133002"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,6,14]]},"DOI":"10.1145\/2882903.2882942","type":"proceedings-article","created":{"date-parts":[[2016,6,16]],"date-time":"2016-06-16T19:01:52Z","timestamp":1466103712000},"page":"599-614","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["An Effective Syntax for Bounded Relational Queries"],"prefix":"10.1145","author":[{"given":"Yang","family":"Cao","sequence":"first","affiliation":[{"name":"University of Edinburgh & Beihang University, Edinburgh, United Kingdom"}]},{"given":"Wenfei","family":"Fan","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":"http:\/\/data.gov.uk\/dataset\/naptan.  http:\/\/data.gov.uk\/dataset\/naptan."},{"key":"e_1_3_2_1_2_1","unstructured":"http:\/\/data.gov.uk\/dataset\/road-accidents-safety-data.  http:\/\/data.gov.uk\/dataset\/road-accidents-safety-data."},{"key":"e_1_3_2_1_3_1","unstructured":"www.transtats.bts.gov\/DatabaseInfo.asp?DB_ID=110.  www.transtats.bts.gov\/DatabaseInfo.asp?DB_ID=110."},{"key":"e_1_3_2_1_4_1","unstructured":"www.transtats.bts.gov\/DatabaseInfo.asp?DB_ID=120.  www.transtats.bts.gov\/DatabaseInfo.asp?DB_ID=120."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/551350"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.14778\/2078331.2078334"},{"key":"e_1_3_2_1_7_1","volume-title":"CIDR","author":"Armbrust M.","year":"2009","unstructured":"M. Armbrust , A. Fox , D. A. Patterson , N. Lanham , B. Trushkowsky , J. Trutna , and H. Oh . SCADS: Scale-independent storage for social computing applications . In CIDR , 2009 . M. Armbrust, A. Fox, D. A. Patterson, N. Lanham, B. Trushkowsky, J. Trutna, and H. Oh. SCADS: Scale-independent storage for social computing applications. In CIDR, 2009."},{"key":"e_1_3_2_1_8_1","volume-title":"Complexity and Approximation,Combinatorial optimization problems and their approximability properties","author":"Ausiello G.","year":"1999","unstructured":"G. Ausiello , P. Crescenzi , G. Gambosi , V. Kann , A. Marchetti-Spaccamela , and M. Protasi . Complexity and Approximation,Combinatorial optimization problems and their approximability properties . Springer , 1999 . G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, and M. Protasi. Complexity and Approximation,Combinatorial optimization problems and their approximability properties. Springer, 1999."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/646293.687242"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2699500"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.14778\/2735703.2735708"},{"key":"e_1_3_2_1_12_1","volume-title":"ICDE","author":"Martinenghi A.","year":"2008","unstructured":"A. Cal;\u0131 and D. Martinenghi . Querying data under access limitations . In ICDE , 2008 . A. Cal;\u0131 and D. Martinenghi. Querying data under access limitations. In ICDE, 2008."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2015.7113281"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732977.2732996"},{"key":"e_1_3_2_1_15_1","volume-title":"SODA","author":"Charikar M.","year":"1998","unstructured":"M. Charikar , C. Chekuri , T. Cheung , Z. Dai , A. Goel , S. Guha , and M. Li . Approximation algorithms for directed steiner problems . In SODA , 1998 . M. Charikar, C. Chekuri, T. Cheung, Z. Dai, A. Goel, S. Guha, and M. Li. Approximation algorithms for directed steiner problems. In SODA, 1998."},{"key":"e_1_3_2_1_16_1","unstructured":"Facebook 2013. http:\/\/newsroom.fb.com.  Facebook 2013. http:\/\/newsroom.fb.com."},{"volume-title":"Introducing graph search. https:\/\/en-gb.facebook.com\/about\/graphsearch","year":"2013","key":"e_1_3_2_1_17_1","unstructured":"Facebook. Introducing graph search. https:\/\/en-gb.facebook.com\/about\/graphsearch , 2013 . Facebook. Introducing graph search. https:\/\/en-gb.facebook.com\/about\/graphsearch, 2013."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2745754.2745771"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2594538.2594551"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/114325.103712"},{"key":"e_1_3_2_1_21_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 . 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_22_1","volume-title":"EDBT","author":"Gubichev A.","year":"2014","unstructured":"A. Gubichev and T. Neumann . Exploiting the query structure for efficient join ordering in SPARQL queries . In EDBT , 2014 . A. Gubichev and T. Neumann. Exploiting the query structure for efficient join ordering in SPARQL queries. In EDBT, 2014."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/42.2.100"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2593683"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-002-0085-6"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.197"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465314"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1055558.1055601"},{"key":"e_1_3_2_1_29_1","unstructured":"C. H. Papadimitriou. Computational Complexity. Addison-Wesley 1994.  C. H. Papadimitriou. Computational Complexity. Addison-Wesley 1994."},{"key":"e_1_3_2_1_30_1","series-title":"Technical Reports Series","volume-title":"IRCS","author":"Popa L.","year":"2001","unstructured":"L. Popa . Object\/relational query optimization with chase and backchase. IRCS Technical Reports Series , 2001 . L. Popa. Object\/relational query optimization with chase and backchase. IRCS Technical Reports Series, 2001."},{"key":"e_1_3_2_1_31_1","volume-title":"Database management systems","author":"Ramakrishnan R.","year":"2000","unstructured":"R. Ramakrishnan and J. Gehrke . Database management systems . McGraw Hill , 2000 . R. Ramakrishnan and J. Gehrke. Database management systems. McGraw Hill, 2000."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/212433.212477"},{"key":"e_1_3_2_1_33_1","volume-title":"Set theory and logic","author":"Stoll R. R.","year":"1961","unstructured":"R. R. Stoll . Set theory and logic . W. H. Freeman and Co. , San Francisco , Calif.-London, 1961 . R. R. Stoll. Set theory and logic. W. H. Freeman and Co., San Francisco, Calif.-London, 1961."},{"key":"e_1_3_2_1_34_1","volume-title":"J. D. Ullman. Principles of Database Systems","year":"1982","unstructured":"J. D. Ullman. Principles of Database Systems , 2 nd Edition. Computer Science Press , 1982 . J. D. Ullman. Principles of Database Systems, 2nd Edition. Computer Science Press, 1982.","edition":"2"},{"key":"e_1_3_2_1_35_1","volume-title":"Computer Science Press","author":"Ullman J. D.","year":"1988","unstructured":"J. D. Ullman . Principles of Database and Knowledge-Base Systems , Volume I. Computer Science Press , 1988 . J. D. Ullman. Principles of Database and Knowledge-Base Systems, Volume I. Computer Science Press, 1988."}],"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.2882942","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2882903.2882942","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T19:04:29Z","timestamp":1750273469000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2882903.2882942"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,14]]},"references-count":35,"alternative-id":["10.1145\/2882903.2882942","10.1145\/2882903"],"URL":"https:\/\/doi.org\/10.1145\/2882903.2882942","relation":{},"subject":[],"published":{"date-parts":[[2016,6,14]]},"assertion":[{"value":"2016-06-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}