{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,29]],"date-time":"2022-12-29T05:21:37Z","timestamp":1672291297054},"reference-count":8,"publisher":"Association for Computing Machinery (ACM)","issue":"12","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2012,8]]},"abstract":"<jats:p>FDB is an in-memory query engine for factorised databases, which are relational databases that use compact factorised representations at the physical layer to reduce data redundancy and boost query performance.<\/jats:p>\n          <jats:p>We demonstrate FDB using real data sets from IMDB, DBLP, and the NELL repository of facts learned from Web pages. The users can inspect factorisations as well as plans used by FDB to compute factorised results of select-project-join queries on factorised databases.<\/jats:p>","DOI":"10.14778\/2367502.2367545","type":"journal-article","created":{"date-parts":[[2014,6,24]],"date-time":"2014-06-24T12:17:57Z","timestamp":1403612277000},"page":"1950-1953","source":"Crossref","is-referenced-by-count":0,"title":["Demonstration of the FDB query engine for factorised databases"],"prefix":"10.14778","volume":"5","author":[{"given":"Nurzhan","family":"Bakibayev","sequence":"first","affiliation":[{"name":"University of Oxford, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dan","family":"Olteanu","sequence":"additional","affiliation":[{"name":"University of Oxford, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jakub","family":"Z\u00e1vodn\u00fd","sequence":"additional","affiliation":[{"name":"University of Oxford, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,8]]},"reference":[{"key":"e_1_2_1_1_1","first-page":"606","volume-title":"ICDE","author":"Antova L.","year":"2007","unstructured":"L. Antova , C. Koch , and D. Olteanu . 1010-6 worlds and beyond: Efficient representation and processing of incomplete information . In ICDE , pages 606 -- 615 , 2007 . L. Antova, C. Koch, and D. Olteanu. 1010-6 worlds and beyond: Efficient representation and processing of incomplete information. In ICDE, pages 606--615, 2007."},{"key":"e_1_2_1_2_1","first-page":"497 11","volume-title":"IJCAI","author":"Aschinger M.","year":"2011","unstructured":"M. Aschinger , C. Drescher , G. Gottlob , P. Jeavons , and E. Thorstensen . Tackling the partner units configuration problem . In IJCAI , pages 497 -- 503 , 2011 . 10.5591\/978-1-57735-516-8\/IJCAI 11 - 091 M. Aschinger, C. Drescher, G. Gottlob, P. Jeavons, and E. Thorstensen. Tackling the partner units configuration problem. In IJCAI, pages 497--503, 2011. 10.5591\/978-1-57735-516-8\/IJCAI11-091"},{"issue":"11","key":"e_1_2_1_3_1","first-page":"1232","article-title":"FDB: A query engine for factorised relational databases","volume":"5","author":"Bakibayev N.","year":"2012","unstructured":"N. Bakibayev , D. Olteanu , and J. Z\u00e1vodn\u00fd . FDB: A query engine for factorised relational databases . PVLDB , 5 ( 11 ): 1232 -- 1243 , 2012 . N. Bakibayev, D. Olteanu, and J. Z\u00e1vodn\u00fd. FDB: A query engine for factorised relational databases. PVLDB, 5(11):1232--1243, 2012.","journal-title":"PVLDB"},{"key":"e_1_2_1_4_1","first-page":"1306","volume-title":"AAAI","author":"Carlson A.","year":"2010","unstructured":"A. Carlson , J. Betteridge , B. Kisiel , B. Settles , E. H. Jr. , and T. Mitchell . Toward an architecture for Never-Ending Language Learning . In AAAI , pages 1306 -- 1313 , 2010 . A. Carlson, J. Betteridge, B. Kisiel, B. Settles, E. H. Jr., and T. Mitchell. Toward an architecture for Never-Ending Language Learning. In AAAI, pages 1306--1313, 2010."},{"key":"e_1_2_1_5_1","first-page":"288","volume-title":"SIGMOD","author":"Imielinski T.","year":"1991","unstructured":"T. Imielinski , S. Naqvi , and K. Vadaparty . Incomplete objects --- a data model for design and planning applications . In SIGMOD , pages 288 -- 297 , 1991 . 10.1145\/115790.115838 T. Imielinski, S. Naqvi, and K. Vadaparty. Incomplete objects --- a data model for design and planning applications. In SIGMOD, pages 288--297, 1991. 10.1145\/115790.115838"},{"key":"e_1_2_1_6_1","volume-title":"TaPP","author":"Olteanu D.","year":"2011","unstructured":"D. Olteanu and J. Z\u00e1vodn\u00fd . On factorisation of provenance polynomials . In TaPP , 2011 . D. Olteanu and J. Z\u00e1vodn\u00fd. On factorisation of provenance polynomials. In TaPP, 2011."},{"key":"e_1_2_1_7_1","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1145\/2274576.2274607","volume-title":"ICDT","author":"Olteanu D.","year":"2012","unstructured":"D. Olteanu and J. Z\u00e1vodn\u00fd . Factorised representations of query results: Size bounds and readability . In ICDT , pages 285 -- 298 , 2012 . 10.1145\/2274576.2274607 D. Olteanu and J. Z\u00e1vodn\u00fd. Factorised representations of query results: Size bounds and readability. In ICDT, pages 285--298, 2012. 10.1145\/2274576.2274607"},{"key":"e_1_2_1_8_1","volume-title":"Probabilistic Databases. Synthesis Lectures on Data Management","author":"Suciu D.","year":"2011","unstructured":"D. Suciu , D. Olteanu , C. R\u00e9 , and C. Koch . Probabilistic Databases. Synthesis Lectures on Data Management . Morgan & Claypool Publishers , 2011 . D. Suciu, D. Olteanu, C. R\u00e9, and C. Koch. Probabilistic Databases. Synthesis Lectures on Data Management. Morgan & Claypool Publishers, 2011."}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/2367502.2367545","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T10:47:35Z","timestamp":1672224455000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/2367502.2367545"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,8]]},"references-count":8,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2012,8]]}},"alternative-id":["10.14778\/2367502.2367545"],"URL":"https:\/\/doi.org\/10.14778\/2367502.2367545","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2012,8]]}}}