NoSQL Databases

In this document, I present the main notions of NoSQL databases and compare four selected products (Riak, MongoDB, Cassandra, Neo4J) according to their capabilities with respect to consistency, availability, and partition tolerance, as well as performance. I also propose a few criteria for selecting the right tool for the right situation.

[1]  Clarence J M Tauro,et al.  Comparative Study of the New Generation, Agile, Scalable, High Performance NOSQL Databases , 2012 .

[2]  Hendrik Decker,et al.  Avenues to Flexible Data Integrity Checking , 2006, 17th International Workshop on Database and Expert Systems Applications (DEXA'06).

[3]  David R. Karger,et al.  Web Caching with Consistent Hashing , 1999, Comput. Networks.

[4]  Davide Martinenghi.  Simplification of Integrity Constraints with Aggregates and Arithmetic Built-Ins , 2004, FQAS.

[5]  Henning Christiansen,et al.  Simplification of Integrity Constraints for Data Integration , 2004, FoIKS.

[6]  Henning Christiansen,et al.  Transaction Management with Integrity Checking , 2005, DEXA.

[7]  Hendrik Decker,et al.  Inconsistency-Tolerant Integrity Checking , 2011, IEEE Transactions on Knowledge and Data Engineering.

[8]  Werner Vogels,et al.  Dynamo: amazon's highly available key-value store , 2007, SOSP.

[9]  Davide Martinenghi,et al.  Rank-Join Algorithms for Search Computing , 2009, SeCO Workshop.

[10]  Hendrik Decker,et al.  Modeling, Measuring and Monitoring the Quality of Information , 2009, ER Workshops.

[11]  Davide Martinenghi,et al.  Top-k diversity queries over bounded regions , 2013, TODS.

[12]  Davide Martinenghi,et al.  On the difference between checking integrity constraints before or after updates , 2013, ArXiv.

[13]  Andrea Calì,et al.  Dynamic Query Optimization under Access Limitations and Dependencies , 2009, J. Univers. Comput. Sci..

[14]  Wilson C. Hsieh,et al.  Bigtable: A Distributed Storage System for Structured Data , 2006, TOCS.

[15]  Davide Martinenghi,et al.  Proximity rank join , 2010, Proc. VLDB Endow..

[16]  Henning Christiansen,et al.  On Using Simplification and Correction Tables for Integrity Maintenance in Integrated Databases , 2006, 17th International Workshop on Database and Expert Systems Applications (DEXA'06).

[17]  Andrea Calì,et al.  Optimization of Query Plans in the presence of Access Limitations , 2007, EROW.

[18]  Davide Martinenghi,et al.  Advanced Techniques for Efficient Data Integrity Checking , 2005 .

[19]  Laks V. S. Lakshmanan,et al.  Selected papers from the Logic in Databases Workshop 2008 , 2010, J. Appl. Log..

[20]  Andrea Calì,et al.  Optimizing Query Processing for the Hidden Web , 2010, 2010 12th International Asia-Pacific Web Conference.

[21]  Davide Martinenghi.  Access Pattern , 2011, Encyclopedia of Cryptography and Security.

[22]  Henning Christiansen,et al.  Incremental Integrity Checking: Limitations and Possibilities , 2005, LPAR.

[23]  Davide Martinenghi,et al.  Ranking with uncertain scoring functions: semantics and sensitivity measures , 2011, SIGMOD '11.

[24]  Hendrik Decker,et al.  A Relaxed Approach to Integrity and Inconsistency in Databases , 2006, LPAR.

[25]  Laks V. S. Lakshmanan,et al.  Logic in databases: report on the LID 2008 workshop , 2010, SGMD.

[26]  Henning Christiansen,et al.  Efficient Integrity Checking for Databases with Recursive Views , 2005, ADBIS.

[27]  Henning Christiansen,et al.  Symbolic constraints for meta-logic programming , 2000, Appl. Artif. Intell..

[28]  Hendrik Decker,et al.  Database Integrity Checking , 2009, Database Technologies: Concepts, Methodologies, Tools, and Applications.

[29]  Andrea Calì,et al.  Querying incomplete data over extended ER schemata , 2010, Theory and Practice of Logic Programming.

[30]  Davide Martinenghi,et al.  Optimal Database Locks for Efficient Integrity Checking , 2004, ADBIS.

[31]  Andrea Calì,et al.  Query Optimisation for Web Data Sources: Minimisation of the Number of Accesses , 2007, SEBD.

[32]  Hendrik Decker,et al.  Classifying integrity checking methods with regard to inconsistency tolerance , 2008, PPDP.

[33]  David J. DeWitt,et al.  Can the Elephants Handle the NoSQL Onslaught? , 2012, Proc. VLDB Endow..

[34]  Hendrik Decker,et al.  Integrity Checking and Maintenance in Relational and Deductive Database and Beyond , 2007 .

[35]  Davide Martinenghi,et al.  Efficient Diversification of Top-k Queries over Bounded Regions , 2012, SEBD.

[36]  Davide Martinenghi,et al.  Top-k bounded diversification , 2012, SIGMOD Conference.

[37]  Henning Christiansen,et al.  Simplification of Database Integrity Constraints Revisited: A Transformational Approach , 2003, LOPSTR.

[38]  Henning Christiansen,et al.  On Simplification of Database Integrity Constraints , 2006, Fundam. Informaticae.

[39]  Hendrik Decker,et al.  Getting Rid of Straitjackets for Flexible Integrity Checking , 2007, 18th International Workshop on Database and Expert Systems Applications (DEXA 2007).

[40]  Laurian M. Chirica,et al.  The entity-relationship model: toward a unified view of data , 1975, SIGF.

[41]  Hendrik Decker,et al.  Checking Violation Tolerance of Approaches to Database Integrity , 2006, ADVIS.

[42]  Davide Martinenghi,et al.  Top-k pipe join , 2010, 2010 IEEE 26th International Conference on Data Engineering Workshops (ICDEW 2010).

[43]  Davide Martinenghi,et al.  Cost-Aware Rank Join with Random and Sorted Access , 2012, IEEE Transactions on Knowledge and Data Engineering.

[44]  Davide Martinenghi,et al.  Proximity measures for rank join , 2012, ACM Trans. Database Syst..

[45]  Andrea Calì,et al.  Conjunctive Query Containment under Access Limitations , 2008, ER.

[46]  Andrea Calì,et al.  Querying Data under Access Limitations , 2008, 2008 IEEE 24th International Conference on Data Engineering.