{"type":"ScholarlyArticle","title":"Ontology-Mediated Query Answering for Key-Value Stores","authors":[{"name":"Meghyn Bienvenu","slug":"meghyn-bienvenu","given":"Meghyn","family":"Bienvenu","affiliation":"† CNRS , France; * Université de Lille 1 , France"},{"name":"Pierre Bourhis","slug":"pierre-bourhis","given":"Pierre","family":"Bourhis","affiliation":"† CNRS , France; * Université de Lille 1 , France"},{"name":"Marie-Laure Mugnier","slug":"marie-laure-mugnier","given":"Marie-Laure","family":"Mugnier","affiliation":"‡ Université de Montpellier , France; * Université de Lille 1 , France; INRIA , France"},{"name":"Sophie Tison","slug":"sophie-tison","given":"Sophie","family":"Tison","affiliation":"* Université de Lille 1 , France"},{"name":"Federico Ulliana","slug":"federico-ulliana","given":"Federico","family":"Ulliana","affiliation":"‡ Université de Montpellier , France; * Université de Lille 1 , France"}],"abstract":"We propose a novel rule-based ontology language for JSON records and investigate its computational properties. After providing a natural translation into first-order logic, we identify relationships to existing ontology languages, which yield decidability of query answering but only rough complexity bounds. By establishing an interesting and non-trivial connection to word rewriting, we are able to pinpoint the exact combined complexity of query answering in our framework and obtain tractability results for data complexity. The upper bounds are proven using a query reformulation technique, which can be implemented on top of key-value stores, thereby exploiting their querying  facilities.","doi":"10.24963/ijcai.2017/117","url":"https://ijcai.org/proceedings/2017/117","pdf":"https://ijcai.org/proceedings/2017/0117.pdf","markdown":"https://ijcai.org/proceedings/2017/117.md","bibtex":"https://ijcai.org/proceedings/2017/bibtex/117","volume":{"slug":"2017","title":"Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2017","url":"https://ijcai.org/proceedings/2017/","year":2017,"location":"Melbourne, Australia","dates":"19-25 August 2017","editors":"Carles Sierra","isbn":"978-0-9992411-0-3","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2017"},"section":"Knowledge Representation, Reasoning, and Logic","track":"Main track","number":117,"pages":{"first":844,"last":851},"keywords":["Knowledge Representation, Reasoning, and Logic: Logics for Knowledge Representation","Knowledge Representation, Reasoning, and Logic: Description Logics and Ontologies","Multidisciplinary Topics and Applications: Intelligent Database Systems"],"videos":[],"references":[{"position":1,"raw":"[Abiteboul and Vianu, 1997] Serge Abiteboul and Victor Vianu. Regular path queries with constraints. In Proceed- ings of the Sixteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, May 12- 14, 1997, Tucson, Arizona, USA, pages 122-133, 1997.","title":"Regular path queries with constraints","authors":"Vianu Abiteboul, Serge Abiteboul, Victor Vianu","year":"1997","venue":"Proceedings of the Sixteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Abiteboul and Vianu, 1999] Serge Abiteboul and Victor Vianu. Regular path queries with constraints. J. Comput. Syst. Sci., 58(3):428-452, June 1999.","title":"Regular path queries with constraints","authors":"Serge Abiteboul, Victor Vianu","year":"1999","venue":"J. Comput. Syst. Sci","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Abiteboul et al., 1995] Serge Abiteboul, Richard Hull, and Victor Vianu, editors. Foundations of Databases: The Logical Level. Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA, 1st edition, 1995.","title":"Foundations of Databases: The Logical Level","authors":null,"year":"1995","venue":null,"doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Andre et al., 2007] Yves Andre, Anne-Cécile Caron, Denis Debarbieux, Yves Roos, and Sophie Tison. Path con- straints in semistructured data. Theor. Comput. Sci., 385(1- 3):11-33, 2007.","title":"Path constraints in semistructured data","authors":"Yves Andre, Anne-Cécile Caron, Denis Debarbieux, Yves Roos, Sophie Tison","year":"2007","venue":"Theor. Comput. Sci","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Baader et al., 2008] Franz Baader, Carsten Lutz, and Sebas- tian Brandt. Pushing the el envelope further. In Kendall Clark and Peter F. Patel-Schneider, editors, OWLED (Spring), volume 496 of CEUR Workshop Proceedings. CEUR-WS.org, 2008.","title":"Pushing the el envelope further","authors":"Franz Baader, Carsten Lutz, Sebastian Brandt","year":"2008","venue":"CEUR Workshop Proceedings. CEUR-WS.org","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Baget et al., 2011] J.-F. Baget, M. Leclère, M.-L. Mugnier, and E. Salvat. On Rules with Existential Variables: Walk- ing the Decidability Line. Artificial Intelligence, 175(9- 10):1620-1654, 2011.","title":"On Rules with Existential Variables: Walking the Decidability Line","authors":"J.-F Baget, M Leclère, M.-L Mugnier, E Salvat","year":"2011","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Botoeva et al., 2016] Elena Botoeva, Diego Calvanese, Benjamin Cogrel, Martin Rezk, and Guohui Xiao. OBDA beyond relational dbs: A study for mongodb. In Pro- ceedings of the 29th International Workshop on Descrip- tion Logics, Cape Town, South Africa, April 22-25, 2016., 2016.","title":"OBDA beyond relational dbs: A study for mongodb","authors":"Elena Botoeva, Diego Calvanese, Benjamin Cogrel, Martin Rezk, Guohui Xiao","year":"2016","venue":"Proceedings of the 29th International Workshop on Description Logics","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Büchi, 1962] J. Richard Büchi. Regular canonical sys- tems. Archiv für mathematische Logik und Grundlagen- forschung, 1962.","title":"Archiv für mathematische Logik und Grundlagenforschung","authors":"J Richard Büchi","year":"1962","venue":null,"doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Buneman et al., 2000] Peter Buneman, Wenfei Fan, and Scott Weinstein. Path constraints in semistructured databases. Journal of Computer and System Sciences, 61(2):146-193, 2000.","title":"Path constraints in semistructured databases","authors":"Buneman","year":"2000","venue":"Journal of Computer and System Sciences","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Calì et al., 2012] Andrea Calì, Georg Gottlob, and Andreas Pieris. Towards more expressive ontology languages: The query answering problem. Artificial Intelligence, 193:87- 128, 2012.","title":"Towards more expressive ontology languages: The query answering problem","authors":"Andrea Calì, Georg Gottlob, Andreas Pieris","year":"2012","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Calì et al., 2013] Andrea Calì, Georg Gottlob, and Michael Kifer. Taming the infinite chase: Query answering un- der expressive relational constraints. J. Artif. Intell. Res. (JAIR), 48:115-174, 2013.","title":"Taming the infinite chase: Query answering under expressive relational constraints","authors":"Andrea Calì, Georg Gottlob, Michael Kifer","year":"2013","venue":"J. Artif. Intell. Res. (JAIR)","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Calvanese et al., 2007] D. Calvanese, G. De Giacomo, D. Lembo, M. Lenzerini, and R. Rosati. Tractable Reason- ing and Efficient Query Answering in Description Logics: The DL-Lite Family. J. Autom. Reasoning, 39(3):385-429, 2007.","title":"Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family","authors":"D Calvanese, G De Giacomo, D Lembo, M Lenzerini, R Rosati","year":"2007","venue":"J. Autom. Reasoning","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Calvanese et al., 2016] Diego Calvanese, Magdalena Ortiz, and Mantas Šimkus. Verification of evolving graph- structured data under expressive path constraints. In 19th International Conference on Database Theory, 2016.","title":"Verification of evolving graph-structured data under expressive path constraints","authors":"Calvanese","year":"2016","venue":"19th International Conference on Database Theory","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Cattell, 2010] Rick Cattell. Scalable SQL and nosql data stores. SIGMOD Record, 39(4):12-27, 2010.","title":"Scalable SQL and nosql data stores","authors":"Cattell","year":"2010","venue":"SIGMOD Record","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Caucal, 2000] Didier Caucal. On word rewriting systems having a rational derivation. In Jerzy Tiuryn, editor, FOS- SACS 2000, volume 1784 of Lecture Notes in Computer Science, pages 48-62. Springer, 2000.","title":"On word rewriting systems having a rational derivation","authors":"Didier Caucal","year":"2000","venue":"FOS-SACS 2000","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Chasseur et al., 2013] Craig Chasseur, Yinan Li, and Jig- nesh M. Patel. Enabling json document stores in relational systems. In Angela Bonifati and Cong Yu, editors, WebDB, pages 1-6, 2013.","title":"Enabling json document stores in relational systems","authors":"Craig Chasseur, Yinan Li, Jignesh M Patel","year":"2013","venue":"WebDB","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Eiter et al., 2012] T. Eiter, M. Ortiz, M. Simkus, T.-K. Tran, and G. Xiao. Query Rewriting for Horn-SHIQ Plus Rules. In AAAI., 2012.","title":"Query Rewriting for Horn-SHIQ Plus Rules","authors":"T Eiter, M Ortiz, M Simkus, T.-K Tran, G Xiao","year":"2012","venue":"AAAI","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Goldman and Widom, 1997] Roy Goldman and Jennifer Widom. Dataguides: Enabling query formulation and op- timization in semistructured databases. In Proceedings of the 23rd International Conference on Very Large Data Bases, VLDB '97, pages 436-445, San Francisco, CA, USA, 1997.","title":"Dataguides: Enabling query formulation and optimization in semistructured databases","authors":"Widom Goldman, Roy Goldman, Jennifer Widom","year":"1997","venue":"Proceedings of the 23rd International Conference on Very Large Data Bases, VLDB '97","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"Morgan Kaufmann Publishers Inc. [Mugnier et al., 2016]","title":null,"authors":"Mugnier","year":"2016","venue":null,"doi":null,"url":null,"internal_url":null},{"position":20,"raw":"Marie-Laure Mugnier, Marie- Christine Rousset, and Federico Ulliana. Ontology- mediated queries for NOSQL databases. In Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, February 12-17, 2016, Phoenix, Arizona, USA., pages 1051-1057, 2016.","title":"Ontologymediated queries for NOSQL databases","authors":"Marie-Laure Mugnier, Marie-Christine Rousset, Federico Ulliana","year":"2016","venue":"Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Poggi et al., 2008] Antonella Poggi, Domenico Lembo, Diego Calvanese, Giuseppe De Giacomo, Maurizio Lenz- erini, and Riccardo Rosati. Linking data to ontologies. J. Data Semantics, 10:133-173, 2008.","title":"Linking data to ontologies","authors":"Antonella Poggi, Domenico Lembo, Diego Calvanese, Giuseppe De Giacomo, Maurizio Lenzerini, Riccardo Rosati","year":"2008","venue":"J. Data Semantics","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}