Bibliography

[AAB05] Amitanand Aiyer, Lorenzo Alvisi, and Rida A Bazzi. On the availability of non-strict quorum systems. In Distributed Computing, pages 48–62. Springer, 2005.
[AB13] Veronika Abramova and Jorge Bernardino. NoSQL databases: MongoDB vs Cassandra. In Bipin C. Desai, Ana Maria de Almeida, and Sudhir P. Mudur, editors, International C* Conference on Computer Science & Software Engineering (C3S2E), pages 14–22. ACM, 2013.
[Aba07] Daniel J. Abadi. Column stores for wide and sparse data. In Third Biennial Conference on Innovative Data Systems Research, pages 292–297, 2007.
[Aba12] Daniel J. Abadi. Consistency tradeoffs in modern distributed database system design: CAP is only part of the story. IEEE Computer, 45(2):37–42, 2012.
[ABF14] Veronika Abramova, Jorge Bernardino, and Pedro Furtado. Testing cloud benchmark scalability with cassandra. In Services (SERVICES), 2014 IEEE World Congress on, pages 434–441. IEEE, 2014.
[ABH+13] Daniel J. Abadi, Peter A. Boncz, Stavros Harizopoulos, Stratos Idreos, and Samuel Madden. The design and implementation of modern column-oriented database systems. Foundations and Trends in Databases, 5(3):197–280, 2013.
[ABPA+09] Azza Abouzeid, Kamil Bajda-Pawlikowski, Daniel J. Abadi, Avi Silberschatz, and Alexander Rasin. HadoopDB: An architectural hybrid of MapReduce and DBMS technologies for analytical workloads. Proceedings of the VLDB Endowment, 2(1):922 – 933, 2009.
[ABR14] Paolo Atzeni, Francesca Bugiotti, and Luca Rossi. Uniform access to NoSQL systems. Information Systems, 43:117–133, 2014.
[ACL+07] Mustafa Atay, Artem Chebotko, Dapeng Liu, Shiyong Lu, and Farshad Fotouhi. Efficient schema-based XML-to-relational data mapping. Information Systems, 32(3):458–476, 2007.
[ADA12] Divyakant Agrawal, Sudipto Das, and Amr El Abbadi. Data Management in the Cloud: Challenges and Opportunities. Synthesis Lectures on Data Management. Morgan & Claypool, 2012.
[AKD06] Anish Arora, Sandeep S. Kulkarni, and Murat Demirbas. Resettable vector clocks. Journal of Parallel and Distributed Computing, 66(2):221–237, 2006.
[AL97] Atul Adya and Barbara Liskov. Lazy consistency using loosely synchronized clocks. In ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), pages 73–82. ACM, 1997.
[AMF06] Daniel J. Abadi, Samuel Madden, and Miguel Ferreira. Integrating compression and execution in column-oriented database systems. In ACM SIGMOD International Conference on Management of Data, pages 671–682. ACM, 2006.
[AMH08] Daniel J. Abadi, Samuel Madden, and Nabil Hachem. Column-stores vs. row-stores: how different are they really? In ACM SIGMOD International Conference on Management of Data, pages 967–980. ACM, 2008.
[AN10] Alex Averbuch and Martin Neumann. Partitioning graph databases – a quantitative evaluation. Master’s thesis, KTH Stockholm, 2010. The Computing Research Repository abs/1301.5121.
[ARB+06] Alexandre Andrade, Gabriela Ruberg, Fernanda Baião, Vanessa P Braganholo, and Marta Mattoso. Efficiently processing XML queries over fragmented repositories with PartiX. In Current Trends in Database Technology (EDBT), pages 150–163. Springer, 2006.
[ASS13] Masoud Saeida Ardekani, Pierre Sutra, and Marc Shapiro. Non-monotonic snapshot isolation: scalable and strong consistency for geo-replicated transactional systems. In 32nd International Symposium on Reliable Distributed Systems (SRDS), pages 163–172. IEEE, 2013.
[AW04] Hagit Attiya and Jennifer Welch. Distributed computing: fundamentals, simulations, and advanced topics, volume 19. John Wiley & Sons, 2004.
[BAB+12] Chansup Byun, William Arcand, David Bestor, Bill Bergeron, Matthew Hubbell, Jeremy Kepner, Andrew McCabe, Peter Michaleas, Julie Mullen, David O’Gwynn, Andrew Prout, Albert Reuther, Antonio Rosa, and Charles Yee. Driving big data with big compute. In IEEE Conference on High Performance Extreme Computing (HPEC), pages 1–6. IEEE, 2012.
[BB13] Pablo Barceló Baeza. Querying graph databases. In 32nd ACM Symposium on Principles of Database Systems (PODS), pages 175–188. ACM, 2013.
[BBG+95] Hal Berenson, Phil Bernstein, Jim Gray, Jim Melton, Elizabeth O’Neil, and Patrick O’Neil. A critique of ANSI SQL isolation levels. In ACM SIGMOD Record, volume 24, pages 1–10. ACM, 1995.
[BD13] Philip A. Bernstein and Sudipto Das. Rethinking eventual consistency. In ACM SIGMOD International Conference on Management of Data, pages 923–928. ACM, 2013.
[BDF+10] Gerth Stølting Brodal, Erik D. Demaine, Jeremy T. Fineman, John Iacono, Stefan Langerman, and J. Ian Munro. Cache-oblivious dynamic dictionaries with update/query tradeoffs. In Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms SODA, pages 1448–1456. Society for Industrial and Applied Mathematics, 2010.
[Ber73] Gerald Berman. The gossip problem. Discrete Mathematics, 4(1):91, 1973.
[BFCF+07] Michael A. Bender, Martin Farach-Colton, Jeremy T. Fineman, Yonatan R. Fogel, Bradley C. Kuszmaul, and Jelani Nelson. Cache-oblivious streaming B-trees. In 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pages 81–92. ACM, 2007.
[BFG+13] Peter Bailis, Alan Fekete, Ali Ghodsi, Joseph M Hellerstein, and Ion Stoica. HAT, not CAP: towards highly available transactions. In Proceedings of the 14th USENIX conference on Hot Topics in Operating Systems, pages 24–24. USENIX Association, 2013.
[BG82] Daniel Barbará and Hector Garcia-Molina. How expensive is data replication? an example. In 3rd International Conference on Distributed Computing Systems, pages 263–268. IEEE Computer Society, 1982.
[BG83] Philip A Bernstein and Nathan Goodman. Multiversion concurrency control – theory and algorithms. ACM Transactions on Database Systems (TODS), 8(4):465–483, 1983.
[BG84] Philip A Bernstein and Nathan Goodman. An algorithm for concurrency control and recovery in replicated distributed databases. ACM Transactions on Database Systems (TODS), 9(4):596–615, 1984.
[BG85] Philip A Bernstein and Nathan Goodman. Serializability theory for replicated databases. Journal of Computer and System Sciences, 31(3):355–374, 1985.
[BG13] Peter Bailis and Ali Ghodsi. Eventual consistency today: limitations, extensions, and beyond. Communications of the ACM, 56(5):55–63, 2013.
[BGFvS09] Rena Bakhshi, Daniela Gavidia, Wan Fokkink, and Maarten van Steen. An analytical model of information dissemination for a gossip-based protocol. Comput. Netw., 53(13):2288–2303, August 2009.
[BGK+08] Prosenjit Bose, Hua Guo, Evangelos Kranakis, Anil Maheshwari, Pat Morin, Jason Morrison, Michiel H. M. Smid, and Yihui Tang. On the false-positive rate of Bloom filters. Information Processing Letters, 108(4):210–213, 2008.
[BGS+11] Dhruba Borthakur, Jonathan Gray, Joydeep Sen Sarma, Kannan Muthukkaruppan, Nicolas Spiegelberg, Hairong Kuang, Karthik Ranganathan, Dmytro Molkov, Aravind Menon, Samuel Rash, Rodrigo Schmidt, and Amitanand S. Aiyer. Apache Hadoop goes realtime at Facebook. In ACM SIGMOD International Conference on Management of Data, pages 1071–1080. ACM, 2011.
[BGY13] Sebastian Burckhardt, Alexey Gotsman, and Hongseok Yang. Understanding eventual consistency. Technical report, Technical Report MSR-TR-2013-39, Microsoft Research, 2013.
[BHBL09] Christian Bizer, Tom Heath, and Tim Berners-Lee. Linked data - the story so far. International Journal on Semantic Web and Information Systems, 5(3):1–22, 2009.
[BHEF11] Mihaela A Bornea, Orion Hodson, Sameh Elnikety, and K Fekete. One-copy serializability with snapshot isolation under the hood. In Data Engineering (ICDE), 2011 IEEE 27th International Conference on, pages 625–636. IEEE, 2011.
[BHH09] Sebastian Bächle, Theo Härder, and Michael Peter Haustein. Implementing and optimizing fine-granular lock management for XML document trees. In 14th International Conference on Database Systems for Advanced Applications (DASFAA), volume 5463 of Lecture Notes in Computer Science, pages 631–645. Springer, 2009.
[Blo70] Burton H. Bloom. Space/time trade-offs in hash coding with allowable errors. Communications of the ACM, 13(7):422–426, 1970.
[BM14] Vanessa Braganholo and Marta Mattoso. A survey on XML fragmentation. ACM SIGMOD Record, 43(3):24–35, 2014.
[BR02] Roberto Baldoni and Michel Raynal. Fundamentals of distributed computing: A practical tour of vector clock systems. IEEE Distributed Systems Online, 3(2), 2002.
[Bre12] Eric Brewer. CAP twelve years later: How the “rules” have changed. Computer, 45(2):23–29, 2012.
[BRJ05] Grady Booch, James Rumbaugh, and Ivar Jacobson. The Unified Modeling Language User Guide. Addison-Wesley, 2nd edition, 2005.
[BS14] Peter Baumann and Heinrich Stamerjohanns. Towards a systematic benchmark for array database systems. In Specifying Big Data Benchmarks, pages 94–102. Springer, 2014.
[BVF+12] Peter Bailis, Shivaram Venkataraman, Michael J Franklin, Joseph M Hellerstein, and Ion Stoica. Probabilistically bounded staleness for practical partial quorums. Proceedings of the VLDB Endowment, 5(8):776–787, 2012.
[BWK07] Hendrik Blockeel, Tijn Witsenburg, and Joost N. Kok. Graphs, hypergraphs, and inductive logic programming. In Mining and Learning with Graphs. MLG, 2007.
[BZS14] David Bermbach, Liang Zhao, and Sherif Sakr. Towards comprehensive measurement of consistency guarantees for cloud-hosted data storage services. In Performance Characterization and Benchmarking, pages 32–47. Springer, 2014.
[CAH12] Marek Ciglan, Alex Averbuch, and Ladialav Hluchy. Benchmarking traversal operations over graph databases. In 28th International Conference on Data Engineering Workshops (ICDEW), pages 186–189. IEEE, 2012.
[Cat11] Rick Cattell. Scalable SQL and NoSQL data stores. ACM SIGMOD Record, 39(4):12– 27, 2011.
[CB09] Thomas M. Connolly and Carolyn E. Begg. Database Systems: A Practical Approach to Design, Implementation and Management. Addison-Wesley, 5th edition, 2009.
[CCA+10] Tyson Condie, Neil Conway, Peter Alvaro, Joseph M. Hellerstein, Khaled Elmeleegy, and Russell Sears. MapReduce online. In Networked Systems Design and Implementation, pages 313–328. USENIX Association, 2010.
[CDG+06] Fay Chang, Jeffrey Dean, Sanjay Ghemawat, Wilson C. Hsieh, Deborah A. Wallach, Michael Burrows, Tushar Chandra, Andrew Fikes, and Robert Gruber. Bigtable: A distributed storage system for structured data. In 7th Symposium on Operating Systems Design and Implementation (OSDI’06), pages 205–218. USENIX Association, 2006.
[CGR07] Tushar D Chandra, Robert Griesemer, and Joshua Redstone. Paxos made live: an engineering perspective. In Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing, pages 398–407. ACM, 2007.
[Cha10] Kang-tsung Chang. Introduction to geographic information systems. McGraw-Hill New York, 2010.
[Che76] Peter Pin-Shan Chen. The entity-relationship model – toward a unified view of data. ACM Transactions on Database Systems (TODS), 1(1):9–36, 1976.
[CK85] George P. Copeland and Setrag Khoshafian. A decomposition storage model. In ACM SIGMOD International Conference on Management of Data, pages 268–279. ACM, 1985.
[Cod70] Edgar F. Codd. A relational model of data for large shared data banks. Communications of the ACM, 13(6):377–387, 1970.
[COK86] Brian A. Coan, Brian M. Oki, and Elliot K. Kolodner. Limitations on database availability when networks partition. In Joseph Y. Halpern, editor, Fifth Annual ACM Symposium on Principles of Distributed Computing, pages 187–194. ACM, 1986.
[CST+10] Brian F Cooper, Adam Silberstein, Erwin Tam, Raghu Ramakrishnan, and Russell Sears. Benchmarking cloud serving systems with YCSB. In Proceedings of the 1st ACM symposium on Cloud computing, pages 143–154. ACM, 2010.
[CZ12] Gary Chartrand and Ping Zhang. A first course in graph theory. Courier Dover Publications, 2012.
[Dat07] Chris J. Date. Logic and Databases: The Roots of Relational Theory. Trafford Publishing, 2007.
[DG04] Jeffrey Dean and Sanjay Ghemawat. MapReduce: Simplified data processing on large clusters. In Operating Systems Design and Implementation (OSDI), pages 137–150. USENIX Association, 2004.
[DG10] Jeffrey Dean and Sanjay Ghemawat. MapReduce: a flexible data processing tool. Communications of the ACM, 53(1):72–77, 2010.
[DGH+88] Alan J. Demers, Daniel H. Greene, Carl Hauser, Wes Irish, John Larson, Scott Shenker, Howard E. Sturgis, Daniel C. Swinehart, and Douglas B. Terry. Epidemic algorithms for replicated database maintenance. Operating Systems Review, 22(1):8 – 32, 1988.
[DGMS85] Susan B Davidson, Hector Garcia-Molina, and Dale Skeen. Consistency in a partitioned network: a survey. ACM Computing Surveys (CSUR), 17(3):341–370, 1985.
[DHJ+07] Giuseppe DeCandia, Deniz Hastorun, Madan Jampani, Gunavardhan Kakulapati, Avinash Lakshman, Alex Pilchin, Swaminathan Sivasubramanian, Peter Vosshall, and Werner Vogels. Dynamo: Amazon’s highly available key-value store. In Symposium on Operating Systems Principles (SOSP), pages 205–220. ACM, 2007.
[Die12] Reinhard Diestel. Graph Theory, volume 173 of Springer Graduate Texts in Mathematics. Springer, 2012.
[DQRJ+10] Jens Dittrich, Jorge-Arnulfo Quiané-Ruiz, Alekh Jindal, Yagiz Kargin, Vinay Setty, and Jörg Schad. Hadoop++: Making a yellow elephant run like a cheetah (without it even noticing). Proceedings of the VLDB Endowment, 3(1):518–529, 2010.
[DS12] Miyuru Dayarathna and Toyotaro Suzumura. XGDBench: A benchmarking platform for graph stores in exascale clouds. In IEEE International Conference on Cloud Computing Technology and Science (CloudCom), pages 363–370. IEEE, 2012.
[DSMBMM+11] David Dominguez-Sal, Norbert Martinez-Bazan, Victor Muntes-Mulero, Pere Baleta, and Josep Lluis Larriba-Pey. A discussion on the design of graph database benchmarks. In Performance Evaluation, Measurement and Characterization of Complex Systems – TPC Technology Conference Revised Selected Papers, volume 6417 of Lecture Notes in Computer Science, pages 25–40. Springer, 2011.
[DSUBGV+10] David Dominguez-Sal, P. Urbón-Bayes, Aleix Giménez-Vañó, Sergio Gómez-Villamor, Norbert Martínez-Bazan, and Josep-Lluis Larriba-Pey. Survey of graph database performance on the HPC scalable graph analysis benchmark. In International Conference on Web-Age Information Management (WAIM) Workshops, volume 6185 of Lecture Notes in Computer Science, pages 37–48. Springer, 2010.
[DU11] Suzanne W Dietrich and Susan D Urban. Fundamentals of Object Databases: Object-Oriented and Object-Relational Design. Synthesis Lectures on Data Management. Morgan & Claypool, 2011.
[DuC13] Bob DuCharme. Learning Sparql. O’Reilly, 2013.
[ECM13] ECMA International. ECMA-404: The JSON data interchange format, 2013.
[EPZ05] Sameh Elnikety, Fernando Pedone, and Willy Zwaenepoel. Database replication using generalized snapshot isolation. In 24th IEEE Symposium on Reliable Distributed Systems, pages 73–84. IEEE, 2005.
[FB99] Armando Fox and Eric A. Brewer. Harvest, yield and scalable tolerant systems. In Workshop on Hot Topics in Operating Systems, pages 174–178, 1999.
[FBM10] Guilherme Figueiredo, Vanessa P. Braganholo, and Marta Mattoso. Processing queries over distributed XML databases. Journal of Information and Data Management, 1(3):455–470, 2010.
[Fie00] Roy Thomas Fielding. Architectural styles and the design of network-based software architectures. PhD thesis, University of California, Irvine, 2000.
[FM82] Michael J. Fischer and A. Michael. Sacrificing serializability to attain high availability of data. In Symposium on Principles of Database Systems (PODS), pages 70–75. ACM, 1982.
[FM12] Lizhen Fu and Xiaofeng Meng. Efficient processing of updates in dynamic graph-structured XML data. In 13th International Conference on Web-Age Information Management (WAIM), volume 7418 of Lecture Notes in Computer Science, pages 254–265. Springer, 2012.
[FS12] Martin J. Fowler and Pramodkumar J. Sadalage. NoSQL Distilled: A Brief Guide to the Emerging World of Polyglot Persistence. Prentice Hall, 2012.
[FTD+12] Avrilia Floratou, Nikhil Teletia, David J. DeWitt, Jignesh M. Patel, and Donghui Zhang. Can the elephants handle the NoSQL onslaught? Proceedings of the VLDB Endowment, 5(12):1712–1723, 2012.
[GBR14] Felix Gessert, Florian Bucklers, and Norbert Ritter. Orestes: A scalable database-as-a-service architecture for low latency. In 6th International Workshop on Cloud Data Management – Data Engineering Workshops (ICDEW), pages 215–222. IEEE, 2014.
[GHMT12] Michael T. Goodrich, Daniel S. Hirschberg, Michael Mitzenmacher, and Justin Thaler. Cache-oblivious dictionaries and multimaps with negligible failure probability. In First Mediterranean Conference on Algorithms, volume 7659 of Lecture Notes in Computer Science, pages 203–218. Springer, 2012.
[GHOS96] Jim Gray, Pat Helland, Patrick E. O’Neil, and Dennis Shasha. The dangers of replication and a solution. In ACM SIGMOD International Conference on Management of Data, pages 173–182. ACM, 1996.
[GHTC13] Katarina Grolinger, Wilson A Higashino, Abhinav Tiwari, and Miriam AM Capretz. Data management in cloud environments: Nosql and newsql data stores. Journal of Cloud Computing: Advances, Systems and Applications, 2(1):22, 2013.
[Gif79] David K Gifford. Weighted voting for replicated data. In Proceedings of the seventh ACM symposium on Operating systems principles, pages 150–162. ACM, 1979.
[GL02] Seth Gilbert and Nancy A. Lynch. Brewer’s conjecture and the feasibility of consistent, available, partition-tolerant web services. SIGACT News (ACM), 33(2):51–59, 2002.
[GLP93] Giorgio Gallo, Giustino Longo, and Stefano Pallottino. Directed hypergraphs and applications. Discrete Applied Mathematics, 42(2):177–201, 1993.
[GLS11] Wojciech Golab, Xiaozhou Li, and Mehul A Shah. Analyzing consistency properties for fun and profit. In 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing, pages 197–206. ACM, 2011.
[GMUW08] Hector Garcia-Molina, Jeffrey D. Ullman, and Jennifer Widom. Database Systems: The Complete Book. Prentice Hall, 2nd edition, 2008.
[GÖ10] Lukasz Golab and M Tamer Özsu. Data stream management. Synthesis Lectures on Data Management. Morgan & Claypool Publishers, 2010.
[Gro08] W3C XML Core Working Group. Extensible markup language (XML) 1.0 (fifth edition) W3C recommendation, 2008.
[Gru02] Torsten Grust. Accelerating XPath location steps. In ACM SIGMOD International Conference on Management of Data, pages 109–120. ACM, 2002.
[HCC11] Ian Heywood, Sarah Cornelius, and Steve Carter. An Introduction to Geographical Information Systems. Pearson, 2011.
[HD08] Allison L. Holloway and David J. DeWitt. Read-optimized databases, in depth. Proceedings of the VLDB Endowment, 1(1):502–513, 2008.
[HJ11] Robin Hecht and S Jablonski. NoSQL evaluation: A use case oriented survey. In International Conference on Cloud and Service Computing, pages 336–341, 2011.
[HM10] Terry Halpin and Tony Morgan. Information Modeling and Relational Databases. Morgan Kaufmann, 2010.
[HMB90] Antony L. Hosking, J. Eliot B. Moss, and Cynthia Bliss. Design of an object faulting persistent smalltalk. COINS Technical Report, pages 90–45, 1990.
[HN13] Michael Hausenblas and Jacques Nadeau. Apache Drill: interactive ad-hoc analysis at scale. Big Data, 1(2):100–104, 2013.
[HP13] Florian Holzschuher and René Peinl. Performance of graph query languages: comparison of Cypher, Gremlin and native access in Neo4j. In Proceedings of the Joint EDBT/ICDT 2013 Workshops, pages 195–204. ACM, 2013.
[HRSD07] Allison L. Holloway, Vijayshankar Raman, Garret Swart, and David J. DeWitt. How to barter bits for chronons: compression and bandwidth trade offs for database scans. In ACM SIGMOD International Conference on Management of Data, pages 389–400. ACM, 2007.
[HTV10] Till Haselmann, Gunnar Thies, and Gottfried Vossen. Looking into a REST-based universal API for database-as-a-service systems. In Commerce and Enterprise Computing (CEC), 2010 IEEE 12th Conference on, pages 17–24. IEEE, 2010.
[IGN+12] Stratos Idreos, Fabian Groffen, Niels Nes, Stefan Manegold, K. Sjoerd Mullender, and Martin L. Kersten. MonetDB: Two decades of research in column-oriented database architectures. IEEE Data Engineering Bulletin, 35(1):40–45, 2012.
[Int11] International Organization for Standardization. ISO/IEC 9075:2011 Information technology – Database languages – SQL, 2011.
[IS12] Maria Indrawan-Santiago. Database research: Are we at a crossroad? reflection on NoSQL. In 15th International Conference on Network-Based Information Systems (NBiS), pages 45–51. IEEE, 2012.
[JC06] Kuen-Fang Jack Jea and Shih-Ying Chen. A high concurrency XPath-based locking protocol for XML databases. Information & Software Technology, 48(8):708–716, 2006.
[JPPMAK03] Ricardo Jiménez-Peris, Marta Patiño-Martínez, Gustavo Alonso, and Bettina Kemme. Are quorums an alternative for data replication? ACM Transactions on Database Systems (TODS), 28(3):257–294, 2003.
[Juk13] Nenad Jukic. Database Systems: Introduction to Databases and Data Warehouses. Pearson, 2013.
[JV13] Salim Jouili and Valentin Vansteenberghe. An empirical comparison of graph databases. In International Conference on Social Computing (SocialCom), pages 708–715. IEEE, 2013.
[JVG+07] Márk Jelasity, Spyros Voulgaris, Rachid Guerraoui, Anne-Marie Kermarrec, and Maarten van Steen. Gossip-based peer sampling. ACM Trans. Comput. Syst., 25(3), August 2007.
[KA10] Bettina Kemme and Gustavo Alonso. Database replication: a tale of research across communities. Proceedings of the VLDB Endowment, 3(1-2):5–12, 2010.
[KA14] Vinit Kumar and Ajay Agarwal. Ht-paxos: High throughput state-machine replication protocol for large clustered data centers. CoRR, abs/1407.1237, 2014.
[KCJ+87] Setrag Khoshafian, George P. Copeland, Thomas Jagodis, Haran Boral, and Patrick Valduriez. A query processing strategy for the decomposed storage model. In International Conference on Data Engineering, pages 636–643. IEEE Computer Society, 1987.
[KGGS15] Lukas Kircher, Michael Grossniklaus, Christian Grün, and Marc H Scholl. Efficient structural bulk updates on the Pre/Dist/Size XML encoding. In 31st International Conference on Data Engineering (ICDE), pages 447–458. IEEE, 2015.
[KGT+10] Jens Krueger, Martin Grund, Christian Tinnefeld, Hasso Plattner, Alexander Zeier, and Franz Faerber. Optimizing write performance for read optimized databases. In Database Systems for Advanced Applications, pages 291–305. Springer, 2010.
[KK98] George Karypis and Vipin Kumar. A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM Journal on scientific Computing, 20(1):359–392, 1998.
[KL00] Kamalakar Karlapalem and Qing Li. A framework for class partitioning in object-oriented databases. Distributed and Parallel Databases, 8(3):333–366, 2000.
[KLL+97] David R. Karger, Eric Lehman, Frank Thomson Leighton, Rina Panigrahy, Matthew S. Levine, and Daniel Lewin. Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the world wide web. In Frank Thomson Leighton and Peter W. Shor, editors, Twenty-Ninth Annual ACM Symposium on the Theory of Computing, pages 654–663, 1997.
[KM08] Adam Kirsch and Michael Mitzenmacher. Less hashing, same performance: Building a better Bloom filter. Random Structures & Algorithms, 33(2):187–218, 2008.
[KÖD10] Patrick Kling, M Tamer Özsu, and Khuzaima Daudjee. Generating efficient execution plans for vertically partitioned XML databases. Proceedings of the VLDB Endowment, 4(1):1–11, 2010.
[KSM13a] Vojt¥ch Kolomi£enko, Martin Svoboda, and Irena Holubová Ml`ynková. Experimental comparison of graph databases. In Proceedings of International Conference on Information Integration and Web-based Applications & Services, page 115. ACM, 2013.
[KSM13b] Vojt¥ch Kolomi£enko, Martin Svoboda, and Irena Holubová Mlýnková. Experimental comparison of graph databases. In Proceedings of International Conference on Information Integration and Web-based Applications & Services, pages 115:115–115:124. ACM, 2013.
[KvS07] Anne-Marie Kermarrec and Maarten van Steen. Gossiping in distributed systems. SIGOPS Operating Systems Review, 41(5):2–7, October 2007.
[KZK11] Euclid Keramopoulos, Michael Zounaropoulos, and George Kourouleas. A comparison study of object-oriented database management systems. Fourth International Theoretical and Practical Conference on Object Systems, 2011.
[Lam78] Leslie Lamport. Time, clocks, and the ordering of events in a distributed system. Communications of the ACM, 21(7):558–565, 1978.
[Lam79] Leslie Lamport. How to make a multiprocessor computer that correctly executes multiprocess programs. IEEE Transactions on Computers, 28(9):690–691, 1979.
[Lam86] Leslie Lamport. On interprocess communication. Distributed computing, 1(2):86 – 101, 1986.
[Lam98] Leslie Lamport. The part-time parliament. ACM Transactions on Computer Systems (TOCS), 16(2):133–169, 1998.
[Lam05] Leslie Lamport. Generalized consensus and Paxos. Technical report, Technical Report MSR-TR-2005-33, Microsoft Research, 2005.
[Lam06] Leslie Lamport. Fast Paxos. Distributed Computing, 19(2):79–103, 2006.
[Lam11] Leslie Lamport. Byzantizing Paxos by refinement. In Distributed Computing, pages 211–224. Springer, 2011.
[Lar05] Craig Larman. Applying UML and Patterns: An Introduction to Object-Oriented Analysis and Design and Iterative Development. Pearson, 2005.
[LC01] Dongwon Lee and Wesley W. Chu. CPI: Constraints-preserving inlining algorithm for mapping XML DTD to relational schema. Data & Knowledge Engineering, 39(1):3 – 25, 2001.
[Lea10] Neal Leavitt. Will NoSQL databases live up to their promise? Computer, 43(2):12 – 14, 2010.
[LFKA11] Wyatt Lloyd, Michael J Freedman, Michael Kaminsky, and David G Andersen. Don’t settle for eventual: scalable causal consistency for wide-area storage with cops. In Proceedings of the Twenty-Third ACM Symposium on Operating Systems Principles, pages 401–416. ACM, 2011.
[LFV+12] Andrew Lamb, Matt Fuller, Ramakrishna Varadarajan, Nga Tran, Ben Vandier, Lyric Doshi, and Chuck Bear. The Vertica analytic database: C-store 7 years later. Proceedings of the VLDB Endowment, 5(12):1790–1801, 2012.
[LG07] Fakhar Lodhi and Muhammad Ahmad Ghazali. Design of a simple and effective object-to-relational mapping technique. In ACM Symposium on Applied Computing (SAC), pages 1445–1449. ACM, 2007.
[Lin12] Jimmy Lin. MapReduce is good enough? If all you have is a hammer, throw away everything that’s not a nail! CoRR, abs/1209.2191, 2012.
[LKPMJP05] Yi Lin, Bettina Kemme, Marta Patiño-Martínez, and Ricardo Jiménez-Peris. Middleware based data replication providing snapshot isolation. In ACM SIGMOD International Conference on Management of Data, pages 419–430. ACM, 2005.
[LL95] Mark Levene and George Loizou. A graph-based data model and its ramifications. IEEE Transactions on Knowledge and Data Engineering, 7(5):809–823, 1995.
[LLC+11] Kyong-Ha Lee, Yoon-Joon Lee, Hyunsik Choi, Yon Dohn Chung, and Bongki Moon. Parallel data processing with MapReduce: a survey. ACM SIGMOD International Conference on Management of Data, 40(4):11–20, 2011.
[LLC14] Aldelir Fernando Luiz, Lau Cheuk Lung, and Miguel Correia. MITRA: Byzantine fault-tolerant middleware for transaction processing on replicated databases. ACM SIGMOD Record, 43(1):32–38, 2014.
[LLH08] Changqing Li, Tok Wang Ling, and Min Hu. Efficient updates in dynamic XML data: from binary string to quaternary string. The International Journal on Very Large Data Bases, 17(3):573–601, 2008.
[LLSG92] Rivka Ladin, Barbara Liskov, Liuba Shrira, and Sanjay Ghemawat. Providing high availability using lazy replication. ACM Transactions on Computer Systems (TOCS), 10(4):360–391, 1992.
[LM99] Meng-Jang Lin and Keith Marzullo. Directional gossip: Gossip in a wide area network. In EDCC, pages 364–379. Springer, 1999.
[LM10] Avinash Lakshman and Prashant Malik. Cassandra: a decentralized structured storage system. SIGOPS Operating Systems Review, 44(2):35–40, 2010.
[LM13] Yishan Li and Sathiamoorthy Manoharan. A performance comparison of SQL and NoSQL databases. In Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM), pages 15–19. IEEE, 2013.
[LS71] Raymond A. Lorie and Andrew J. Symonds. A relational access method for interactive applications. In Courant Computer Science Symposia, volume 6, pages 99–124, 1971.
[LSP82] Leslie Lamport, Robert E. Shostak, and Marshall C. Pease. The Byzantine generals problem. ACM Transactions on Programming Languages and Systems (TOPLAS), 4(3):382–401, 1982.
[MA11] Giorgos Margaritis and Stergios V. Anastasiadis. RangeMerge: Online performance tradeoffs in NoSQL datastores. Technical report, Department of Computer Science, University of Ioannina, 2011. Technical Report DCS 2011-13.
[ME98] Wai Yin Mok and David W. Embley. Using NNF to transform conceptual data models to object-oriented database designs. Data & Knowledge Engineering, 24(3):313 – 336, 1998.
[Mer87] Ralph C. Merkle. A digital signature based on a conventional encryption function. In International Cryptology Conference (CRYPTO), pages 369–378. Springer, 1987.
[MG12] Rajeev Tastogi Minos Garofalakis, Johannes Gehrke. Data Stream Management: Processing High-Speed Data Streams. Springer Verlag, 2012.
[MGL+10] Sergey Melnik, Andrey Gubarev, Jing Jing Long, Geoffrey Romer, Shiva Shivakumar, Matt Tolton, and Theo Vassilakis. Dremel: interactive analysis of web-scale datasets. Proceedings of the VLDB Endowment, 3(1-2):330–339, 2010.
[MK13] Pavel Mička and Zdeněk Kouba. DAO dispatcher pattern: A robust design of the data access layer. In Fifth International Conferences on Pervasive Patterns and Applications (PATTERNS), pages 1–6. IARIA, 2013.
[Mos92] J. Eliot B. Moss. Working with persistent objects: to swizzle or not to swizzle. IEEE Transactions on Software Engineering, 18(8):657–673, 1992.
[MS10] Hui Ma and Klaus-Dieter Schewe. Fragmentation of XML documents. Journal of Information and Data Management, 1(1):21–34, 2010.
[MSL+11] Prince Mahajan, Srinath Setty, Sangmin Lee, Allen Clement, Lorenzo Alvisi, Mike Dahlin, and Michael Walfish. Depot: Cloud storage with minimal trust. ACM Transactions on Computer Systems (TOCS), 29(4):12, 2011.
[MT13] Vojtěch Merunka and Jakub Tuma. Normalization rules of the object-oriented data model. In Innovations and Advances in Computer, Information, Systems Sciences, and Engineering, volume 152 of Lecture Notes in Electrical Engineering, pages 1077–1089. Springer, 2013.
[MW15] Nathan Marz and James Warren. Big Data: Principles and best practices of scalable realtime data systems. Manning Publications Co., 2015.
[OCGO96] Patrick E. O’Neil, Edward Cheng, Dieter Gawlick, and Elizabeth J. O’Neil. The log-structured merge tree (LSM-tree). Acta Informatica, 33(4):351–385, 1996.
[Oli07] Antoni Olivé. Conceptual modeling of information systems. Springer, 2007.
[O’N08] Elizabeth J. O’Neil. Object/relational mapping 2008: Hibernate and the entity data model (EDM). In ACM SIGMOD International Conference on Management of Data, pages 1351–1356. ACM, 2008.
[OOP+04] Patrick E. O’Neil, Elizabeth J. O’Neil, Shankar Pal, Istvan Cseri, Gideon Schaller, and Nigel Westbury. ORDPATHs: Insert-friendly XML node labels. In ACM SIGMOD International Conference on Management of Data, pages 903–908. ACM, 2004.
[OR13] Martin F. O’Connor and Mark Roantree. FibLSS: A scalable label storage scheme for dynamic XML updates. In 17th East European Conference on Advances in Databases and Information Systems (ADBIS), volume 8133 of Lecture Notes in Computer Science, pages 218–231. Springer, 2013.
[ORS+08] Christopher Olston, Benjamin Reed, Utkarsh Srivastava, Ravi Kumar, and Andrew Tomkins. Pig latin: a not-so-foreign language for data processing. In Proceedings of the 2008 ACM SIGMOD international conference on Management of data, pages 1099–1110. ACM, 2008.
[ÖV11] M. Tamer Özsu and Patrick Valduriez. Principles of Distributed Database Systems. Springer, 2011.
[PBA+10] Nuno M. Preguiça, Carlos Baquero, Paulo Sérgio Almeida, Victor Fonte, and Ricardo Gonçalves. Dotted version vectors: Logical clocks for optimistic replication. The Computing Research Repository, abs/1011.5808, 2010.
[PK07] Peter Pleshachkov and Sergei Kuznetsov. SXDGL: Snapshot based concurrency control protocol for XML data. In 5th International XML Database Symposium on Database and XML Technologies (XSym), volume 4704 of Lecture Notes in Computer Science, pages 122–136. Springer, 2007.
[PL94] Alexandra Poulovassilis and Mark Levene. A nested-graph model for the representation and manipulation of complex objects. ACM Transactions on Information Systems (TOIS), 12(1):35–68, 1994.
[Pla11] Hasso Plattner. SanssouciDB: An in-memory database for processing enterprise workloads. In BTW, volume 20, pages 2–21, 2011.
[Pok13] Jaroslav Pokorny. NoSQL databases: a step to database scalability in web environment. International Journal of Web Information Systems, 9(1):69–82, 2013.
[PPR+83] Douglas Stott Parker, Gerald J. Popek, Gerard Rudisin, Allen Stoughton, Bruce J. Walker, Evelyn Walton, Johanna M. Chow, David A. Edwards, Stephen Kiser, and Charles S. Kline. Detection of mutual inconsistency in distributed systems. IEEE Transactions on Software Engineering (TSE), 9(3):240–247, 1983.
[PPR+09] Andrew Pavlo, Erik Paulson, Alexander Rasin, Daniel J. Abadi, David J. DeWitt, Samuel R. Madden, and Michael Stonebraker. A comparison of approaches to large scale data analysis. In ACM SIGMOD International Conference on Management of Data, Providence, Rhode Island, USA, 2009. ACM.
[PPR+11] Swapnil Patil, Milo Polte, Kai Ren, Wittawat Tantisiriroj, Lin Xiao, Julio López, Garth Gibson, Adam Fuchs, and Billie Rinaldi. YCSB++: benchmarking and performance debugging advanced features in scalable table stores. In Proceedings of the 2nd ACM Symposium on Cloud Computing, page 9. ACM, 2011.
[PPV13] Zachary Parker, Scott Poe, and Susan V Vrbsky. Comparing NoSQL MongoDB to an SQL DB. In Proceedings of the 51st ACM Southeast Conference, page 5. ACM, 2013.
[PRT14] Vinit Padhye, Gowtham Rajappan, and Anand Tripathi. Transaction management using causal snapshot isolation in partially replicated databases. In 33rd International Symposium on Reliable Distributed Systems (SRDS), pages 105–114. IEEE, 2014.
[PST+97] Karin Petersen, Mike Spreitzer, Douglas B. Terry, Marvin Theimer, and Alan J. Demers. Flexible update propagation for weakly consistent replication. In Symposium on Operating Systems Principles (SOSP), pages 288–301. ACM, 1997.
[PZ11] Hasso Plattner and Alexander Zeier. In-memory data management. Springer, Heidelberg, 2011.
[RC13] Florin Rusu and Yu Cheng. A survey on array storage, query languages, and systems. arXiv preprint arXiv:1302.0103, 2013.
[RG77] James B Rothnie and Nathan Goodman. A survey of research and development in distributed database management. In Proceedings of the third international conference on Very large data bases-Volume 3, pages 48–62. VLDB Endowment, 1977.
[RH93] Mark A. Roth and Scott J. Van Horn. Database compression. ACM SIGMOD Record, 22(3):31–39, 1993.
[Ric11] Catherine Ricardo. Databases Illuminated. Jones & Bartlett Learning, 2011.
[RL14] Maryam Razavian and Patricia Lago. A lean and mean strategy: a data migration industrial study. Journal of Software: Evolution and Process, 26(2):141–171, 2014.
[RST11] Jun Rao, Eugene J. Shekita, and Sandeep Tata. Using paxos to build a scalable, consistent, and highly available datastore. Proceedings of the VLDB Endowment, 4(4):243–254, 2011.
[RW12] Eric Redmond and Jim R. Wilson. Seven Databases in Seven Weeks: A Guide to Modern Databases and the NoSQL Movement. Pragmatic Programmers, 2012.
[RWE13] Ian Robinson, Jim Webber, and Emil Eifrem. Graph databases. O’Reilly, 2013.
[SAB+05] Michael Stonebraker, Daniel J. Abadi, Adam Batkin, Xuedong Chen, Mitch Cherniack, Miguel Ferreira, Edmond Lau, Amerson Lin, Samuel Madden, Elizabeth J. O’Neil, Patrick E. O’Neil, Alex Rasin, Nga Tran, and Stanley B. Zdonik. C-store: A column-oriented DBMS. In International conference on very large databases (VLDB). ACM, 2005.
[SB09] Russell Sears and Eric A. Brewer. Segment-based recovery: write-ahead logging revisited. Proceedings of the VLDB Endowment, 2(1):490–501, 2009.
[SBZB13] Michael Stonebraker, Paul Brown, Donghui Zhang, and Jacek Becla. SciDB: A database management system for applications with complex analytics. Computing in Science & Engineering, 15(3):54–62, 2013.
[SCB+14] Mohammad Sadoghi, Mustafa Canim, Bishwaranjan Bhattacharjee, Fabian Nagel, and Kenneth A Ross. Reducing database locking contention through multi-version concurrency. Proceedings of the VLDB Endowment, 7(13), 2014.
[SFKP13] David Schwalb, Martin Faust, Jens Krueger, and Hasso Plattner. Physical column organization in in-memory column stores. In Database Systems for Advanced Applications, pages 48–63. Springer, 2013.
[SK92] Mukesh Singhal and Ajay D. Kshemkalyani. An efficient implementation of vector clocks. Information Processing Letters, 43(1):47–52, 1992.
[SLJ12] Weifeng Shan, Husheng Liao, and Xueyuan Jin. XML concurrency control protocols: A survey. In International Conference on Web-Age Information Management (WAIM) Workshops, volume 7419 of Lecture Notes in Computer Science, pages 299–308. Springer, 2012.
[SMK+01] Ion Stoica, Robert Morris, David R. Karger, M. Frans Kaashoek, and Hari Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications. In ACM SIGCOMM Conference, pages 149–160. ACM, 2001.
[SPAL11] Yair Sovran, Russell Power, Marcos K Aguilera, and Jinyang Li. Transactional storage for geo-replicated systems. In Proceedings of the Twenty-Third ACM Symposium on Operating Systems Principles, pages 385–400. ACM, 2011.
[Spi12] Richard Paul Spillane. Efficient, Scalable, and Versatile Application and System Transaction Management for Direct Storage Layers. PhD thesis, Computer Science Department, Stony Brook University, 2012.
[SS05] Yasushi Saito and Marc Shapiro. Optimistic replication. ACM Computing Surveys, 37(1):42–81, 2005.
[Sto10] Michael Stonebraker. SQL databases v. NoSQL databases. Communications of the ACM, 53(4):10–11, 2010.
[Sto12] Michael Stonebraker. New opportunities for new SQL. Communications of the ACM, 55(11):10–11, 2012.
[STZ+99] Jayavel Shanmugasundaram, Kristin Tufte, Chun Zhang, Gang He, David J. DeWitt, and Jeffrey F. Naughton. Relational databases for querying XML documents: Limitations and opportunities. In 25th International Conference on Very Large Data Bases (VLDB), pages 302–314. Morgan Kaufmann, 1999.
[SW13] Michael Stonebraker and Ariel Weisberg. The VoltDB main memory DBMS. IEEE Data Engineering Bulletin, 36(2):21–27, 2013.
[TBM+11] Andrew Twigg, Andrew Byde, Grzegorz Milos, Tim D. Moreton, John Wilkes, and Tom Wilkie. Stratified B-trees and versioning dictionaries. CoRR, abs/1103.4282, 2011.
[TDP+94] Douglas B. Terry, Alan J. Demers, Karin Petersen, Mike Spreitzer, Marvin Theimer, and Brent B. Welch. Session guarantees for weakly consistent replicated data. In Conference on Parallel and Distributed Information Systems (PDIS), pages 140–149. IEEE Computer Society, 1994.
[TDW+12] Alexander Thomson, Thaddeus Diamond, Shu-Chun Weng, Kun Ren, Philip Shao, and Daniel J. Abadi. Calvin: Fast distributed transactions for partitioned database systems. In ACM SIGMOD International Conference on Management of Data. ACM, 2012.
[TGGL82] Irving L Traiger, Jim Gray, Cesare A Galtieri, and Bruce G Lindsay. Transactions and consistency in distributed database systems. ACM Transactions on Database Systems (TODS), 7(3):323–342, 1982.
[Tho79] Robert H Thomas. A majority consensus approach to concurrency control for multiple copy databases. ACM Transactions on Database Systems (TODS), 4(2):180–209, 1979.
[TRA96] Francisco J. Torres-Rojas and Mustaque Ahamad. Plausible clocks: Constant size logical clocks for distributed systems. In Workshop on Distributed Algorithms (WDAG), pages 71–88. Springer, 1996.
[TRL12] Sasu Tarkoma, Christian Esteve Rothenberg, and Eemil Lagerspetz. Theory and practice of Bloom filters for distributed systems. IEEE Communications Surveys and Tutorials, 14(1):131–155, 2012.
[TSJ+09] Ashish Thusoo, Joydeep Sen Sarma, Namit Jain, Zheng Shao, Prasad Chakka, Suresh Anthony, Hao Liu, Pete Wyckoff, and Raghotham Murthy. Hive: a warehousing solution over a map-reduce framework. Proceedings of the VLDB Endowment, 2(2):1626–1629, 2009.
[TSK+10] Ilya Taranov, Ivan Shcheklein, Alexander Kalinin, Leonid Novak, Sergei Kuznetsov, Roman Pastukhov, Alexander Boldakov, Denis Turdakov, Konstantin Antipin, Andrey Fomichev, Peter Pleshachkov, Pavel Velikhov, Nikolai Zavaritski, Maxim Grinev, Maria Grineva, and Dmitry Lizorkin. Sedna: Native XML database management system (internals overview). In ACM SIGMOD International Conference on Management of Data, pages 1037–1046. ACM, 2010.
[TSS97] Zahir Tari, John Stokes, and Stefano Spaccapietra. Object normal forms and dependency constraints for object-oriented schemata. ACM Transactions on Database Systems (TODS), 22(4):513–569, 1997.
[TVB+02] Igor Tatarinov, Stratis Viglas, Kevin S. Beyer, Jayavel Shanmugasundaram, Eugene J. Shekita, and Chun Zhang. Storing and querying ordered XML using a relational database system. In ACM SIGMOD International Conference on Management of Data, pages 204–215. ACM, 2002.
[TvS06] Andrew S. Tanenbaum and Maarten van Steen. Distributed Systems: Principles and Paradigms (2nd Edition). Prentice-Hall, Inc., Upper Saddle River, NJ, USA, 2006.
[VCLM13] Luis Vaquero, Félix Cuadrado, Dionysios Logothetis, and Claudio Martella. Adaptive partitioning for large-scale dynamic graphs. In Proceedings of the 4th Annual Symposium on Cloud Computing, SOCC’13, pages 35:1–35:2, New York, NY, USA, 2013. ACM.
[vL09] Axel van Lamsweerde. Requirements Engineering: From System Goals to UML Models to Software Specifications. John Wiley & Sons, 2009.
[WA09] Weihan Wang and Cristiana Amza. On optimal concurrency control for optimistic replication. In Distributed Computing Systems, 2009. ICDCS’09. 29th IEEE International Conference on, pages 317–326. IEEE, 2009.
[WH10] Andreas M. Weiner and Theo Härder. An integrative approach to query optimization in native XML database management systems. In International Database Engineering and Applications Symposium (IDEAS), pages 64–74. ACM, 2010.
[Woo12] Peter T. Wood. Query languages for graph databases. ACM SIGMOD Record, 41(1):50–60, 2012.
[WPS+00] Matthias Wiesmann, Fernando Pedone, André Schiper, Bettina Kemme, and Gustavo Alonso. Database replication techniques: A three parameter classification. In 19th IEEE Symposium on Reliable Distributed Systems, pages 206–215. IEEE, 2000.
[WV01] Gerhard Weikum and Gottfried Vossen. Transactional information systems: theory, algorithms, and the practice of concurrency control and recovery. Morgan Kaufmann, 2001.
[XLW12] Liang Xu, Tok Wang Ling, and Huayu Wu. Labeling dynamic XML documents: an order-centric approach. IEEE Transactions on Knowledge and Data Engineering, 24(1):100–113, 2012.
[YH97] Li-Hsing Yen and Ting-Lu Huang. Resetting vector clocks in distributed systems. Journal of Parallel and Distributed Computing, 43(1):15–20, 1997.
[YTL+14] Fangjin Yang, Eric Tschetter, Xavier Léauté, Nelson Ray, Gian Merlino, and Deep Ganguli. Druid: a real-time analytical data store. In Proceedings of the 2014 ACM SIGMOD international conference on Management of data, pages 157–168. ACM, 2014.
[ZB12] Marcin Zukowski and Peter A. Boncz. Vectorwise: Beyond column stores. IEEE Data Engineering Bulletin, 35(1):21–27, 2012.
[ZCD+12] Matei Zaharia, Mosharaf Chowdhury, Tathagata Das, Ankur Dave, Justin Ma, Murphy McCauley, Michael J Franklin, Scott Shenker, and Ion Stoica. Resilient distributed datasets: A fault-tolerant abstraction for in-memory cluster computing. In Proceedings of the 9th USENIX conference on Networked Systems Design and Implementation, pages 2–2. USENIX Association, 2012.
..................Content has been hidden....................

You can't read the all page of ebook, please click here login for view all page.
Reset
3.144.30.62