{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T21:16:53Z","timestamp":1767907013097,"version":"3.49.0"},"reference-count":43,"publisher":"Association for Computing Machinery (ACM)","issue":"10","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2017,6]]},"abstract":"<jats:p>\n            Data science teams often collaboratively analyze datasets, generating dataset versions at each stage of iterative exploration and analysis. There is a pressing need for a system that can support dataset versioning, enabling such teams to efficiently store, track, and query across dataset versions. We introduce O\n            <jats:sc>rpheus<\/jats:sc>\n            DB, a dataset version control system that \"\n            <jats:italic>bolts on<\/jats:italic>\n            \" versioning capabilities to a traditional relational database system, thereby gaining the analytics capabilities of the database \"for free\". We develop and evaluate multiple data models for representing versioned data, as well as a light-weight partitioning scheme, L\n            <jats:sc>yre<\/jats:sc>\n            S\n            <jats:sc>plit<\/jats:sc>\n            , to further optimize the models for reduced query latencies. With L\n            <jats:sc>yre<\/jats:sc>\n            S\n            <jats:sc>plit<\/jats:sc>\n            , O\n            <jats:sc>rpheus<\/jats:sc>\n            DB is on average 10\n            <jats:sup>3<\/jats:sup>\n            \u00d7 faster in finding effective (and better) partitionings than competing approaches, while also reducing the latency of version retrieval by up to 20\u00d7 relative to schemes without partitioning. L\n            <jats:sc>yre<\/jats:sc>\n            S\n            <jats:sc>plit<\/jats:sc>\n            can be applied in an online fashion as new versions are added, alongside an intelligent migration scheme that reduces migration time by 10\u00d7 on average.\n          <\/jats:p>","DOI":"10.14778\/3115404.3115417","type":"journal-article","created":{"date-parts":[[2017,9,7]],"date-time":"2017-09-07T13:35:53Z","timestamp":1504791353000},"page":"1130-1141","source":"Crossref","is-referenced-by-count":22,"title":["O\n            <scp>rpheus<\/scp>\n            DB"],"prefix":"10.14778","volume":"10","author":[{"given":"Silu","family":"Huang","sequence":"first","affiliation":[{"name":"University of Illinois (UIUC)"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liqi","family":"Xu","sequence":"additional","affiliation":[{"name":"University of Illinois (UIUC)"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jialin","family":"Liu","sequence":"additional","affiliation":[{"name":"University of Illinois (UIUC)"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aaron J.","family":"Elmore","sequence":"additional","affiliation":[{"name":"University of Chicago"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aditya","family":"Parameswaran","sequence":"additional","affiliation":[{"name":"University of Illinois (UIUC)"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,6]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"Array in MySql. https:\/\/dev.mysql.com\/worklog\/task\/?id=2081.  Array in MySql. https:\/\/dev.mysql.com\/worklog\/task\/?id=2081."},{"key":"e_1_2_1_2_1","unstructured":"Dat. http:\/\/datproject.org\/.  Dat. http:\/\/datproject.org\/."},{"key":"e_1_2_1_3_1","unstructured":"DB2 9.7 array. https:\/\/www.ibm.com\/support\/knowledgecenter\/SSEPGG_9.7.0\/com.ibm.db2.luw.sql.ref.doc\/doc\/r0050497.html.  DB2 9.7 array. https:\/\/www.ibm.com\/support\/knowledgecenter\/SSEPGG_9.7.0\/com.ibm.db2.luw.sql.ref.doc\/doc\/r0050497.html."},{"key":"e_1_2_1_4_1","unstructured":"dbv. https:\/\/dbv.vizuina.com\/.  dbv. https:\/\/dbv.vizuina.com\/."},{"key":"e_1_2_1_5_1","unstructured":"For big-data scientists 'janitor work' is key hurdle to insights. http:\/\/www.nytimes.com\/2014\/08\/18\/technology\/for-big-data-scientists-hurdle-to-insights-is-janitor-work.html?_r=0.  For big-data scientists 'janitor work' is key hurdle to insights. http:\/\/www.nytimes.com\/2014\/08\/18\/technology\/for-big-data-scientists-hurdle-to-insights-is-janitor-work.html?_r=0."},{"key":"e_1_2_1_6_1","unstructured":"Liquibase. http:\/\/www.liquibase.org\/.  Liquibase. http:\/\/www.liquibase.org\/."},{"key":"e_1_2_1_7_1","unstructured":"Mode. https:\/\/about.modeanalytics.com\/.  Mode. https:\/\/about.modeanalytics.com\/."},{"key":"e_1_2_1_8_1","unstructured":"PostgreSQL9.5. www.postgresql.org\/docs\/current\/static\/intarray.html.  PostgreSQL9.5. www.postgresql.org\/docs\/current\/static\/intarray.html."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.14778\/2336664.2336670"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2452376.2452443"},{"key":"e_1_2_1_12_1","volume-title":"CIDR","author":"Bhardwaj A.","year":"2015","unstructured":"A. Bhardwaj : Collaborative data science & dataset version management at scale . CIDR , 2015 . A. Bhardwaj et al. Datahub: Collaborative data science & dataset version management at scale. CIDR, 2015."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.14778\/2824032.2824035"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/974750.974752"},{"key":"e_1_2_1_15_1","volume-title":"TaPP","author":"Chavan A.","year":"2015","unstructured":"A. Chavan Towards a unified query language for provenance and versioning . In TaPP , 2015 . A. Chavan et al. Towards a unified query language for provenance and versioning. In TaPP, 2015."},{"key":"e_1_2_1_16_1","volume-title":"Gene ontology consortium: going forward. Nucleic acids research, 43(D1):D1049--D1056","author":"G. O. Consortium et al.","year":"2015","unstructured":"G. O. Consortium et al. Gene ontology consortium: going forward. Nucleic acids research, 43(D1):D1049--D1056 , 2015 . G. O. Consortium et al. Gene ontology consortium: going forward. Nucleic acids research, 43(D1):D1049--D1056, 2015."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/647207.719705"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0306-4379(97)00017-3"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s004530010050"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-003-0111-3"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.755613"},{"key":"e_1_2_1_22_1","first-page":"451","volume-title":"VLDB","author":"Jiang L.","year":"2000","unstructured":"L. Jiang , B. Salzberg , D. B. Lomet , and M. B. Garc\u00eda . The bt-tree: A branched and temporal access method . In VLDB , pages 451 -- 460 , 2000 . L. Jiang, B. Salzberg, D. B. Lomet, and M. B. Garc\u00eda. The bt-tree: A branched and temporal access method. In VLDB, pages 451--460, 2000."},{"key":"e_1_2_1_23_1","doi-asserted-by":"crossref","unstructured":"G. Karypis etal Multilevel k-way hypergraph partitioning. VLSI design 11(3).  G. Karypis et al. Multilevel k-way hypergraph partitioning. VLSI design 11(3).","DOI":"10.1155\/2000\/19436"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827595287997"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465293"},{"key":"e_1_2_1_26_1","first-page":"738","volume-title":"EDBT","author":"Kaufmann M.","year":"2014","unstructured":"M. Kaufmann Benchmarking bitemporal database systems: Ready for the future or stuck in the past ? In EDBT , pages 738 -- 749 , 2014 . M. Kaufmann et al. Benchmarking bitemporal database systems: Ready for the future or stuck in the past? In EDBT, pages 738--749, 2014."},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2380776.2380786"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-014-0362-1"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01354880"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/119995.115861"},{"key":"e_1_2_1_31_1","volume-title":"Feb. 20","author":"Lee J. W.","year":"2007","unstructured":"J. W. Lee , J. Loaiza , M. J. Stewart , W.-M. Hu , and W. H. Bridge Jr . Flashback database , Feb. 20 2007 . US Patent 7,181,476. J. W. Lee, J. Loaiza, M. J. Stewart, W.-M. Hu, and W. H. Bridge Jr. Flashback database, Feb. 20 2007. US Patent 7,181,476."},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/0306-4379(96)00024-5"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.14778\/2947618.2947619"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807192"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453952"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.404027"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-015-0405-2"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/319806.319816"},{"key":"e_1_2_1_39_1","volume-title":"Branched and Temporal Index Structures","author":"Salzberg B. J.","year":"1995","unstructured":"B. J. Salzberg and D. B. Lomet . Branched and Temporal Index Structures . College of Computer Science , Northeastern University , 1995 . B. J. Salzberg and D. B. Lomet. Branched and Temporal Index Structures. College of Computer Science, Northeastern University, 1995."},{"key":"e_1_2_1_40_1","volume-title":"A matter of time: Temporal data management in db2 for z","author":"Saracco C. M.","year":"2010","unstructured":"C. M. Saracco , M. Nicola , and L. Gandhi . A matter of time: Temporal data management in db2 for z . IBM Corporation , New York , 2010 . C. M. Saracco, M. Nicola, and L. Gandhi. A matter of time: Temporal data management in db2 for z. IBM Corporation, New York, 2010."},{"key":"e_1_2_1_41_1","doi-asserted-by":"crossref","unstructured":"D. Szklarczyk etal The string database in 2011: functional interaction networks of proteins globally integrated and scored. Nucleic acids research.  D. Szklarczyk et al. The string database in 2011: functional interaction networks of proteins globally integrated and scored. Nucleic acids research.","DOI":"10.1093\/nar\/gkq973"},{"key":"e_1_2_1_42_1","volume-title":"Temporal databases: theory, design, and implementation","author":"Tansel A. U.","year":"1993","unstructured":"A. U. Tansel Temporal databases: theory, design, and implementation . Benjamin-Cummings Publishing Co., Inc. , 1993 . A. U. Tansel et al. Temporal databases: theory, design, and implementation. Benjamin-Cummings Publishing Co., Inc., 1993."},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.5555\/551941.857548"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3058744"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3115404.3115417","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T09:49:49Z","timestamp":1672220989000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3115404.3115417"}},"subtitle":["bolt-on versioning for relational databases"],"short-title":[],"issued":{"date-parts":[[2017,6]]},"references-count":43,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2017,6]]}},"alternative-id":["10.14778\/3115404.3115417"],"URL":"https:\/\/doi.org\/10.14778\/3115404.3115417","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2017,6]]}}}