{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T02:19:37Z","timestamp":1773800377676,"version":"3.50.1"},"reference-count":16,"publisher":"Association for Computing Machinery (ACM)","issue":"12","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2015,8]]},"abstract":"<jats:p>\n            Answering queries over Semantic Web data, i.e., RDF graphs, must account for both\n            <jats:italic>explicit<\/jats:italic>\n            data and\n            <jats:italic>implicit<\/jats:italic>\n            data, entailed by the explicit data and the\n            <jats:italic>semantic constraints<\/jats:italic>\n            holding on them. Two main query answering techniques have been devised, namely\n            <jats:italic>Saturation<\/jats:italic>\n            -based (S\n            <jats:sc>at<\/jats:sc>\n            ) which precomputes and adds to the graph all implicit information, and\n            <jats:italic>Reformulation<\/jats:italic>\n            -based (R\n            <jats:sc>ef<\/jats:sc>\n            ) which reformulates the query based on the graph constraints, so that evaluating the reformulated query directly against the explicit data (i.e., without considering the constraints) produces the query answer.\n          <\/jats:p>\n          <jats:p>\n            While S\n            <jats:sc>at<\/jats:sc>\n            is well known, R\n            <jats:sc>ef<\/jats:sc>\n            has received less attention so far. In particular, reformulated queries often perform poorly if the query is complex. Our demonstration showcases a large set of R\n            <jats:sc>ef<\/jats:sc>\n            techniques, including but not limited to one we proposed recently. The audience will be able to 1: test them against different datasets, constraints and queries, as well as different well-established systems, 2: analyze and understand the performance challenges they raise, and 3: alter the scenarios to visualize the impact on performance. In particular, we show how a\n            <jats:italic>cost-based<\/jats:italic>\n            R\n            <jats:sc>ef<\/jats:sc>\n            <jats:italic>approach<\/jats:italic>\n            allows avoiding reformulation performance pitfalls.\n          <\/jats:p>","DOI":"10.14778\/2824032.2824093","type":"journal-article","created":{"date-parts":[[2015,9,16]],"date-time":"2015-09-16T12:18:17Z","timestamp":1442405897000},"page":"1888-1891","source":"Crossref","is-referenced-by-count":9,"title":["Reformulation-based query answering in RDF"],"prefix":"10.14778","volume":"8","author":[{"given":"Damian","family":"Bursztyn","sequence":"first","affiliation":[{"name":"INRIA &amp; Universit\u00e9 Paris-Sud, Saclay, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fran\u00e7ois","family":"Goasdou\u00e9","sequence":"additional","affiliation":[{"name":"Universit\u00e9 Rennes 1 &amp; INRIA, Lannion, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ioana","family":"Manolescu","sequence":"additional","affiliation":[{"name":"INRIA &amp; Universit\u00e9 Paris-Sud, Saclay, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2015,8]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Foundations of Databases","author":"Abiteboul S.","year":"1995","unstructured":"S. Abiteboul , R. Hull , and V. Vianu . Foundations of Databases . Addison-Wesley , 1995 . S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1995."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03754-2_4"},{"key":"e_1_2_1_3_1","volume-title":"Implem.","author":"Baader F.","year":"2003","unstructured":"F. Baader , D. Calvanese , D. L. McGuinness , D. Nardi , and P. F. Patel-Schneider , editors . The Description Logic Handbook: Theory , Implem. , and Applications , 2003 . F. Baader, D. Calvanese, D. L. McGuinness, D. Nardi, and P. F. Patel-Schneider, editors. The Description Logic Handbook: Theory, Implem., and Applications, 2003."},{"key":"e_1_2_1_4_1","volume-title":"SIGMOD","author":"Bornea M. A.","year":"2013","unstructured":"M. A. Bornea , J. Dolby , A. Kementsietsidis , K. Srinivas , P. Dantressangle , O. Udrea , and B. Bhattacharjee . Building an efficient RDF store over a relational database . In SIGMOD , 2013 . 10.1145\/2463676.2463718 M. A. Bornea, J. Dolby, A. Kementsietsidis, K. Srinivas, P. Dantressangle, O. Udrea, and B. Bhattacharjee. Building an efficient RDF store over a relational database. In SIGMOD, 2013. 10.1145\/2463676.2463718"},{"key":"e_1_2_1_5_1","volume-title":"EDBT","author":"Bursztyn D.","year":"2015","unstructured":"D. Bursztyn , F. Goasdou\u00e9 , and I. Manolescu . Optimizing reformulation-based query answering in RDF . In EDBT , 2015 . D. Bursztyn, F. Goasdou\u00e9, and I. Manolescu. Optimizing reformulation-based query answering in RDF. In EDBT, 2015."},{"key":"e_1_2_1_6_1","volume-title":"ICDE","author":"Bursztyn D.","year":"2015","unstructured":"D. Bursztyn , F. Goasdou\u00e9 , I. Manolescu , and A. Roatis . Reasoning on web data: Algorithms and performance . In ICDE , 2015 . D. Bursztyn, F. Goasdou\u00e9, I. Manolescu, and A. Roatis. Reasoning on web data: Algorithms and performance. In ICDE, 2015."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-007-9078-x"},{"key":"e_1_2_1_8_1","volume-title":"ORE","author":"Giacomo G. D.","year":"2012","unstructured":"G. D. Giacomo , D. Lembo , M. Lenzerini , A. Poggi , R. Rosati , M. Ruzzi , and D. Savo . MASTRO: A reasoner for effective ontology-based data access . In ORE , 2012 . G. D. Giacomo, D. Lembo, M. Lenzerini, A. Poggi, R. Rosati, M. Ruzzi, and D. Savo. MASTRO: A reasoner for effective ontology-based data access. In ORE, 2012."},{"key":"e_1_2_1_9_1","volume-title":"EDBT","author":"Goasdou\u00e9 F.","year":"2013","unstructured":"F. Goasdou\u00e9 , I. Manolescu , and A. Roati\u015f . Efficient query answering against dynamic RDF databases . In EDBT , 2013 . 10.1145\/2452376.2452412 F. Goasdou\u00e9, I. Manolescu, and A. Roati\u015f. Efficient query answering against dynamic RDF databases. In EDBT, 2013. 10.1145\/2452376.2452412"},{"key":"e_1_2_1_10_1","volume-title":"ACM TODS","author":"Gottlob G.","year":"2014","unstructured":"G. Gottlob , G. Orsi , and A. Pieris . Query rewriting and optimization for ontological databases . ACM TODS , 2014 . 10.1145\/2638546 G. Gottlob, G. Orsi, and A. Pieris. Query rewriting and optimization for ontological databases. ACM TODS, 2014. 10.1145\/2638546"},{"key":"e_1_2_1_11_1","volume-title":"Web Semant., 2005","author":"Guo Y.","year":"2005","unstructured":"Y. Guo , Z. Pan , and J. Heflin . LUBM: A benchmark for OWL knowledge base systems . Web Semant., 2005 . 10.1016\/j.websem. 2005 .06.005 Y. Guo, Z. Pan, and J. Heflin. LUBM: A benchmark for OWL knowledge base systems. Web Semant., 2005. 10.1016\/j.websem.2005.06.005"},{"key":"e_1_2_1_12_1","volume-title":"ISWC","author":"Kaoudi Z.","year":"2008","unstructured":"Z. Kaoudi , I. Miliaraki , and M. Koubarakis . RDFS reasoning and query answering on top of DHTs . In ISWC , 2008 . 10.1007\/978-3-540-88564-1_32 Z. Kaoudi, I. Miliaraki, and M. Koubarakis. RDFS reasoning and query answering on top of DHTs. In ISWC, 2008. 10.1007\/978-3-540-88564-1_32"},{"key":"e_1_2_1_13_1","volume-title":"EDBT","author":"Lanti D.","year":"2015","unstructured":"D. Lanti , M. Rezk , G. Xiao , and D. Calvanese . The NPD benchmark: Reality check for OBDA systems . In EDBT , 2015 . D. Lanti, M. Rezk, G. Xiao, and D. Calvanese. The NPD benchmark: Reality check for OBDA systems. In EDBT, 2015."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-009-0165-y"},{"key":"e_1_2_1_15_1","volume-title":"IJCAI","author":"Thomazo M.","year":"2013","unstructured":"M. Thomazo . Compact rewriting for existential rules . IJCAI , 2013 . M. Thomazo. Compact rewriting for existential rules. IJCAI, 2013."},{"key":"e_1_2_1_16_1","volume-title":"ISWC","author":"Urbani J.","year":"2011","unstructured":"J. Urbani , F. van Harmelen , S. Schlobach , and H. Bal . QueryPIE: Backward reasoning for OWL Horst over very large knowledge bases . In ISWC , 2011 . J. Urbani, F. van Harmelen, S. Schlobach, and H. Bal. QueryPIE: Backward reasoning for OWL Horst over very large knowledge bases. In ISWC, 2011."}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/2824032.2824093","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T10:22:14Z","timestamp":1672222934000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/2824032.2824093"}},"subtitle":["alternatives and performance"],"short-title":[],"issued":{"date-parts":[[2015,8]]},"references-count":16,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2015,8]]}},"alternative-id":["10.14778\/2824032.2824093"],"URL":"https:\/\/doi.org\/10.14778\/2824032.2824093","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2015,8]]}}}