skip to main content
research-article
Free Access

A co-Relational Model of Data for Large Shared Data Banks: Contrary to popular belief, SQL and noSQL are really just two sides of the same coin.

Published:18 March 2011Publication History
Skip Abstract Section

Abstract

Fueled by their promise to solve the problem of distilling valuable information and business insight from big data in a scalable and programmer-friendly way, noSQL databases have been one of the hottest topics in our field recently. With a plethora of open source and commercial offerings and a surrounding cacophony of technical terms, however, it is hard for businesses and practitioners to see the forest for the trees.

References

  1. Awodey, S. 2010. Category Theory (second edition). Oxford University Press. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Baker, J., Bond, C., Corbett, J., Furman, J., Khorlin, A., Larson, J., et al. 2011. Megastore: providing scalable, highly available storage for interactive services. Conference on Innovative Data Systems Research (CIDR).Google ScholarGoogle Scholar
  3. Bird, R. 1987. An introduction to the theory of lists. In Logic Programming and Calculi of Discrete Design, ed. M. Broy, 3-42. Springer-Verlag. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Codd, T. 1970. A relational model of data for large shared data banks. Communications of the ACM, 13(6). Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Copeland, G., Maier, D. 1984. Making Smalltalk a database system. Proceedings of the ACM SIGMOD International Conference on Management of Data. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Fokkinga, M. 2008. MapReduce¿a two-page explanation for laymen; http://www.cs.utwente.nl/~fokkinga/mmf2008j.pdf.Google ScholarGoogle Scholar
  7. Ghosh, R. A. 2005. An economic basis for open standards; flosspols.org.Google ScholarGoogle Scholar
  8. Grust, T. 2003. Monad comprehensions: a versatile representation for queries. In The Functional Approach to Data Management, eds. P. Gray, L. Kerschberg, P. King, and A. Poulovassilis, 288-311. Springer Verlag.Google ScholarGoogle Scholar
  9. Grust, T., Rittinger, J., Schreiber, T. 2010. Avalanche-safe LINQ compilation. Proceedings of the VLDB Endowment 3(1-2). Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Meijer, E. 2010. Subject/Observer is dual to iterator. Presented at FIT: Fun Ideas and Thoughts at the Conference on Programming Language Design and Implementation; http://www.cs.stanford.edu/pldi10/fit.html.Google ScholarGoogle Scholar
  11. Meijer, E., Beckman, B., Bierman, G. 2006. LINQ: reconciling objects, relations, and XML in the .NET framework. Proceedings of the ACM SIGMOD International Conference on Management of Data. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Pirayoff, R. 2004. Economics Micro & Macro. Cliffs Notes.Google ScholarGoogle Scholar
  13. Pritchett, D. 2008. BASE: an Acid alternative. ACM Queue (July). Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Stonebraker, M., Hellerstein, J. M. 2005. What goes around comes around. In Readings in Database Systems (Fourth Edition), eds. M. Stonebraker, and J. M. Hellerstein, 2-41. MIT Press.Google ScholarGoogle Scholar
  15. Yuan Yu, M. I. 2008. DryadLINQ: a system for general-purpose distributed data-parallel computing using a high-level language. OSDI (Operating Systems Design and Implementation). Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. A co-Relational Model of Data for Large Shared Data Banks: Contrary to popular belief, SQL and noSQL are really just two sides of the same coin.

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in

      Full Access

      • Published in

        cover image Queue
        Queue  Volume 9, Issue 3
        Programming Languages
        March 2011
        37 pages
        ISSN:1542-7730
        EISSN:1542-7749
        DOI:10.1145/1952746
        Issue’s Table of Contents

        Copyright © 2011 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 18 March 2011

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • research-article
        • Popular
        • Editor picked

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      HTML Format

      View this article in HTML Format .

      View HTML Format