{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:13:33Z","timestamp":1750306413332,"version":"3.41.0"},"publisher-location":"New York, New York, USA","reference-count":27,"publisher":"ACM Press","license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1145\/2790755.2790770","type":"proceedings-article","created":{"date-parts":[[2015,7,27]],"date-time":"2015-07-27T14:35:23Z","timestamp":1438007723000},"page":"81-89","source":"Crossref","is-referenced-by-count":2,"title":["Towards Archiving-as-a-Service"],"prefix":"10.1145","author":[{"given":"Filip-Martin","family":"Brinkmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Heiko","family":"Schuldt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","reference":[{"key":"key-10.1145\/2790755.2790770-1","doi-asserted-by":"crossref","unstructured":"M. K. Aguilera, W. Golab, and M. A. Shah. A practical scalable distributed B-Tree. Proceedings of the VLDB Endowment, 1(1):598--609, 2008.","DOI":"10.14778\/1453856.1453922"},{"key":"key-10.1145\/2790755.2790770-2","unstructured":"F. Akal, C. Türker, H. Schek, Y. Breitbart, T. Grabs, and L. Veen. Fine-Grained Replication and Scheduling with Freshness and Correctness Guarantees. In Proceedings of the 31st International Conference on Very Large Data Bases, pages 565--576, Trondheim, Norway, 2005. ACM."},{"key":"key-10.1145\/2790755.2790770-3","doi-asserted-by":"crossref","unstructured":"B. Becker, S. Gschwind, T. Ohler, B. Seeger, and P. Widmayer. An asymptotically optimal multiversion b-tree. The VLDB Journal, 5(4):264--275, Dec. 1996.","DOI":"10.1007\/s007780050028"},{"key":"key-10.1145\/2790755.2790770-4","doi-asserted-by":"crossref","unstructured":"P. A. Bernstein and N. Goodman. Concurrency control algorithms for multiversion database systems. In Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of Distributed Computing, PODC '82, pages 209--215. ACM, 1982.","DOI":"10.1145\/800220.806699"},{"key":"key-10.1145\/2790755.2790770-5","doi-asserted-by":"crossref","unstructured":"P. A. Bernstein and N. Goodman. Multiversion concurrency control-theory and algorithms. ACM Trans. Database Syst., 8(4):465--483, Dec. 1983.","DOI":"10.1145\/319996.319998"},{"key":"key-10.1145\/2790755.2790770-6","doi-asserted-by":"crossref","unstructured":"E. A. Brewer. Towards robust distributed systems. In Symposium on Principles of Distributed Computing (PODC), 2000.","DOI":"10.1145\/343477.343502"},{"key":"key-10.1145\/2790755.2790770-7","doi-asserted-by":"crossref","unstructured":"J. Cho and H. Garcia-Molina. Synchronizing a database to improve freshness. In ACM Sigmod Record, volume 29, pages 117--128. ACM, 2000.","DOI":"10.1145\/342009.335391"},{"key":"key-10.1145\/2790755.2790770-8","unstructured":"R. Elmasri, G. T. J. Wuu, and Y.-J. Kim. The time index: An access structure for temporal data. In Proceedings of the 16th International Conference on Very Large Data Bases, VLDB '90, pages 1--12, San Francisco, CA, USA, 1990."},{"key":"key-10.1145\/2790755.2790770-9","doi-asserted-by":"crossref","unstructured":"I. Fetai, F. Brinkmann, and H. Schuldt. PolarDBMS: Towards a cost-effective and policy-based data management in the Cloud. In Workshops Proc. of the 30th International Conference on Data Engineering Workshops, pages 170--177, 2014.","DOI":"10.1109\/ICDEW.2014.6818323"},{"key":"key-10.1145\/2790755.2790770-10","doi-asserted-by":"crossref","unstructured":"S. Gilbert and N. Lynch. Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services. SIGACT News, 33(2):51--59, June 2002.","DOI":"10.1145\/564585.564601"},{"key":"key-10.1145\/2790755.2790770-11","doi-asserted-by":"crossref","unstructured":"T. Härder and A. Reuter. Principles of transaction-oriented database recovery. ACM Compututing Surveys, 15(4):287--317, 1983.","DOI":"10.1145\/289.291"},{"key":"key-10.1145\/2790755.2790770-12","doi-asserted-by":"crossref","unstructured":"C. S. Jensen, J. Clifford, S. K. Gadia, A. Segev, and R. T. Snodgrass. A glossary of temporal database concepts. SIGMOD Rec., 21(3):35--43, Sept. 1992.","DOI":"10.1145\/140979.140996"},{"key":"key-10.1145\/2790755.2790770-13","doi-asserted-by":"crossref","unstructured":"C. S. Jensen and R. T. Snodgrass. Semantics of time-varying information. Information Systems, 21(4):311--352, June 1996.","DOI":"10.1016\/0306-4379(96)00017-8"},{"key":"key-10.1145\/2790755.2790770-14","doi-asserted-by":"crossref","unstructured":"M. Kaufmann, P. M. Fischer, N. May, A. Tonder, and D. Kossmann. TPC-BiH: A Benchmark for Bitemporal Databases. In Proceedings of the 5th TPC Technology Conference on Performance Characterization and Benchmarking (TPCTC 2013), pages 16--31, Trento, Italy, Aug. 2013.","DOI":"10.1007\/978-3-319-04936-6_2"},{"key":"key-10.1145\/2790755.2790770-15","doi-asserted-by":"crossref","unstructured":"K. Kulkarni and J.-E. Michels. Temporal features in SQL:2011. SIGMOD Rec., 41(3):34--43, Oct. 2012.","DOI":"10.1145\/2380776.2380786"},{"key":"key-10.1145\/2790755.2790770-16","doi-asserted-by":"crossref","unstructured":"D. Lomet and B. Salzberg. Access methods for multiversion data. In Proceedings of the 1989 ACM SIGMOD international conference on Management of data, SIGMOD '89, pages 315--324, New York, NY, USA, 1989. ACM.","DOI":"10.1145\/67544.66956"},{"key":"key-10.1145\/2790755.2790770-17","doi-asserted-by":"crossref","unstructured":"C. Mohan, D. J. Haderle, B. G. Lindsay, H. Pirahesh, and P. M. Schwarz. ARIES: A transaction recovery method supporting fine-granularity locking and partial rollbacks using write-ahead logging. ACM Transactions on Database Systems, 17(1):94--162, 1992.","DOI":"10.1145\/128765.128770"},{"key":"key-10.1145\/2790755.2790770-18","doi-asserted-by":"crossref","unstructured":"P. Muth, P. O'Neil, A. Pick, and G. Weikum. The LHAM log-structured history data access method. The VLDB Journal, 8(3-4):199--221, Feb. 2000.","DOI":"10.1007\/s007780050004"},{"key":"key-10.1145\/2790755.2790770-19","doi-asserted-by":"crossref","unstructured":"P. O'Neil, E. Cheng, D. Gawlick, and E. O'Neil. The log-structured merge-tree (LSM-tree). Acta Informatica, 33(4):351--385, June 1996.","DOI":"10.1007\/s002360050048"},{"key":"key-10.1145\/2790755.2790770-20","doi-asserted-by":"crossref","unstructured":"D. Pritchett. BASE: An ACID Alternative. Queue, 6(3):48--55, May 2008.","DOI":"10.1145\/1394127.1394128"},{"key":"key-10.1145\/2790755.2790770-21","doi-asserted-by":"crossref","unstructured":"U. Röhm, K. Böhm, H. Schek, and H. Schuldt. FAS - A freshness-sensitive coordination middleware for a cluster of OLAP components. In Proceedings of the 28th International Conference on Very Large Data Bases (VLDB 2002), pages 754--765, Hong Kong, China, Aug. 2002. Morgan Kaufmann.","DOI":"10.1016\/B978-155860869-6\/50072-X"},{"key":"key-10.1145\/2790755.2790770-22","doi-asserted-by":"crossref","unstructured":"B. Salzberg and V. J. Tsotras. Comparison of access methods for time-evolving data. ACM Comput. Surv., 31(2):158--221, June 1999.","DOI":"10.1145\/319806.319816"},{"key":"key-10.1145\/2790755.2790770-23","doi-asserted-by":"crossref","unstructured":"R. T. Snodgrass. Temporal databases. IEEE Computer, 19:35--42, 1986.","DOI":"10.1109\/MC.1986.1663327"},{"key":"key-10.1145\/2790755.2790770-24","doi-asserted-by":"crossref","unstructured":"R. T. Snodgrass. The TSQL2 temporal query language, volume 330. Springer Science & Business Media, 1995.","DOI":"10.1007\/978-1-4615-2289-8"},{"key":"key-10.1145\/2790755.2790770-25","doi-asserted-by":"crossref","unstructured":"B. Sowell, W. Golab, and M. A. Shah. Minuet: a scalable distributed multiversion b-tree. Proceedings of the VLDB Endowment, 5(9):884--895, 2012.","DOI":"10.14778\/2311906.2311915"},{"key":"key-10.1145\/2790755.2790770-26","doi-asserted-by":"crossref","unstructured":"V. J. Tsotras and N. Kangelaris. The snapshot index: An i\/o-optimal access method for timeslice queries. Information Systems, 20(3):237--260, May 1995.","DOI":"10.1016\/0306-4379(95)00011-R"},{"key":"key-10.1145\/2790755.2790770-27","doi-asserted-by":"crossref","unstructured":"L. Voicu, H. Schuldt, Y. Breitbart, and H.-J. Schek. Flexible data access in a cloud based on freshness requirements. In 2010 IEEE 3rd International Conference on Cloud Computing (CLOUD), pages 180--187, 2010.","DOI":"10.1109\/CLOUD.2010.75"}],"event":{"number":"19","sponsor":["BytePress","Concordia University","Keio University"],"acronym":"IDEAS '15","name":"the 19th International Database Engineering & Applications Symposium","start":{"date-parts":[[2015,7,13]]},"location":"Yokohama, Japan","end":{"date-parts":[[2015,7,15]]}},"container-title":["Proceedings of the 19th International Database Engineering & Applications Symposium on - IDEAS '15"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2790755.2790770","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/dl.acm.org\/ft_gateway.cfm?id=2790770&ftid=1608490&dwn=1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:07:46Z","timestamp":1750223266000},"score":1,"resource":{"primary":{"URL":"http:\/\/dl.acm.org\/citation.cfm?doid=2790755.2790770"}},"subtitle":["A Distributed Index for the Cost-effective Access to Replicated Multi-Version Data"],"short-title":[],"issued":{"date-parts":[[2014]]},"references-count":27,"URL":"https:\/\/doi.org\/10.1145\/2790755.2790770","relation":{},"subject":[],"published":{"date-parts":[[2014]]}}}