Skip to main content
Browse Subject Areas

Click through the PLOS taxonomy to find articles in your field.

For more information about PLOS Subject Areas, click here.

  • Loading metrics

Mynodbcsv: Lightweight Zero-Config Database Solution for Handling Very Large CSV Files


Volumes of data used in science and industry are growing rapidly. When researchers face the challenge of analyzing them, their format is often the first obstacle. Lack of standardized ways of exploring different data layouts requires an effort each time to solve the problem from scratch. Possibility to access data in a rich, uniform manner, e.g. using Structured Query Language (SQL) would offer expressiveness and user-friendliness. Comma-separated values (CSV) are one of the most common data storage formats. Despite its simplicity, with growing file size handling it becomes non-trivial. Importing CSVs into existing databases is time-consuming and troublesome, or even impossible if its horizontal dimension reaches thousands of columns. Most databases are optimized for handling large number of rows rather than columns, therefore, performance for datasets with non-typical layouts is often unacceptable. Other challenges include schema creation, updates and repeated data imports. To address the above-mentioned problems, I present a system for accessing very large CSV-based datasets by means of SQL. It's characterized by: “no copy” approach – data stay mostly in the CSV files; “zero configuration” – no need to specify database schema; written in C++, with boost [1], SQLite [2] and Qt [3], doesn't require installation and has very small size; query rewriting, dynamic creation of indices for appropriate columns and static data retrieval directly from CSV files ensure efficient plan execution; effortless support for millions of columns; due to per-value typing, using mixed text/numbers data is easy; very simple network protocol provides efficient interface for MATLAB and reduces implementation time for other languages. The software is available as freeware along with educational videos on its website [4]. It doesn't need any prerequisites to run, as all of the libraries are included in the distribution package. I test it against existing database solutions using a battery of benchmarks and discuss the results.


When considering processing of big and wide data, emphasis is often put on custom solutions (e.g. scripts in MATLAB/R/Python, programs in C/C++, different NoSQL [5] solutions) that promise performance and customizability traditionally unavailable to normalized solutions like SQL-capable relational databases. However, it's worth realizing the benefits of using a standardized language for querying the data. Those include: shorter development time, maintainability, expressive and natural way of formulating queries, ease of sharing them with collaborators who need just to understand SQL to know the purpose of a query. Additionally, with scripting approaches to big data even reading the data source is frequently not easy because of inefficiency of high-level languages in running parsers. In light of these facts, it seems that reasons stopping potential users from choosing a database approach to handling their data are: inability of the latter to accommodate modern dataset sizes (big data) and layouts (wide data), necessity to install appropriate software and move data into the system, as well as designing an appropriate database schema beforehand. However, as solutions satisfying needs of efficient ad-hoc access to computationally demanding datasets using standard languages like SQL come to existence (NoDB [6], mynodbcsv), this situation becomes likely to change.

Problems described above have been previously studied in the field of database research. Among the better explored ones are those of auto-tuning – offline [7][16] and online [17], [18] and adaptive indexing [19][25]. Mynodbcsv satisfies both philosophies online, albeit it relies on a very simplistic, however effective strategy – it greedily indexes all columns used in dynamic (arithmetic/functional/conditional expressions, WHERE, ORDER BY, GROUP BY and JOIN clauses) parts of the queries. At risk of being suboptimal this design choice gives one significant benefit to the end-user – predictability. Each time a column is used for the first time in a dynamic way, it will be indexed.

Information extraction for the static part of the query is done using optimized CSV lookup algorithm, described in Table 1. The solution for integrating SQL semantics with unstructured text data retrieval as described in [26] is not required in case of mynodbcsv - since dynamic part of the query (therefore all the computationally demanding tasks of joining and filtering the data) is handled by SQLite, my software is limited to retrieving corresponding rows/columns from the static part using optimized linear scan.

In-situ processing as described in [27][33] is reinforced in mynodbcsv compared to previous accomplishments by its completely zero-config nature. Schemas are built automatically assuming that first rows of CSV files contain column names. New CSV files are introduced to the system by dragging and dropping them over the GUI or using a classical file selection dialog. Their names are converted to table names. SQL queries are instantly possible for all new data.

Materials and Methods

A good example of almost entirely CSV-based dataset is the tabular data from Alzheimer's Disease Neuroimaging Initiative (ADNI) [34]. A subset of it containing roughly 130 CSV files with clinical data about subjects was frequently used in neuroscience studies in recent years. In the first test, I tried to import all of the data into an SQLite database. This proved to be efficient for querying but the import process itself was slow. The necessity to prepare a schema beforehand and re-import each file whenever certain kinds of change of the original data were made (e.g. inserting new records, performing global text processing) was also a hassle. Another type of data that ADNI provides is structural magnetic resonance imaging (sMRI) data of the brain. After pre-processing those data, there were about 400000 features for each scan, corresponding to voxels of gray matter. With this amount of columns no database solution at my disposal could handle it. At the same time, I realized that the set of interesting queries requiring all of the above data combined was limited. It consisted mostly of simple filtering, grouping and ordering using subject's diagnosis, age or gender as criteria. This notion called for a more efficient way of accessing the data, which didn't require loading all of it into the database but rather reduced the imported parts to absolute minimum, i.e. just the columns used in SQL's WHERE/GROUP BY/ORDER BY clauses and in the dynamic expressions in the SELECT clause, while obtaining the rest of the data directly from the original CSV files.

Achieving the above in a completely robust manner (e.g. supporting nested SELECT queries in the FROM clause, column aliases, JOINs) excluded any simple text processing and required writing a proper SQL parser. The idea was to restructure [Figures 1,2] the original query in such a way that only dynamic parts were retained and row identifiers added for the static parts which later could be used to fetch data from the original CSV files. For implementing the parser I used Boost Spirit parsing library and defined the syntax corresponding to SELECT syntax in SQLite. The parser takes a string containing an SQL query as input and produces the Abstract Syntax Tree (AST), which already specifies (to limited extent) which parts of the query are dynamic. Further analysis step is necessary to determine if expressions, which syntactically seem to be static are in fact dynamic because they come from nested dynamic SELECT queries. The analysis module detects these cases and for each dynamic identifier makes sure that “id” column of each of the tables used to produce that expression is included once in the list of SELECT values. These added identifiers are named by convention “id___N” where N is an increasing integer number for each new generated identifier. All “id___N” values are propagated across nested queries regardless whether they are used in the final output. The tables and columns are imported on-demand only for the dynamic parts of the query. This is the key to obtaining good performance. Temporary in-memory tables can be used to be even faster. After retrieving identifiers from the reformatted query results, original AST is used to fill in the missing static parts by accessing CSV files. Large CSV files support is achieved by keeping them mostly in memory (since file mapping is used to this end, the percentage of file loaded into physical memory depends on the amount of memory available and the file usage pattern) with minimum overhead for caching some of the column positions. Afterwards, columns are accessed by parsing the file on the fly, using cached positions to amortize search time for each particular column. This proved to be more efficient both performance- and memory-wise than keeping parsed data in arrays of strings or variant types. Finally, results are either printed out as CSV file, presented by means of a dedicated graphical user interface (GUI) implemented using the Qt library and a special data model (derived from QAbstractItemModel class) or sent in CSV format over a network socket. This approach is more robust than trying to wrap the algorithm in an existing database interface (either native SQLite or a generic one like ODBC) and provides the necessary performance level to do online analysis of all the results. Wrapping it in an existing API would have had an added benefit of offering a drop-in replacement functionality for existing applications but I chose to prioritize implementation time, robustness and speed. My solution doesn't require schema specification. All CSV files found in the current working directory are automatically seen as tables in the database with all the necessary columns imported on-demand. Further files can be added using a drag-and-drop interface or from the menu. For an overview of the architecture, see [Figure 3].

Figure 1. Examples of static and dynamic column references.

Dynamic references are kept in the reformatted query, whereas for static ones the identifier column of the corresponding table is added and subsequently they are fetched directly from the original CSV file.

Figure 2. Query rewriting pipeline.

In the first step, wildcard expressions are expanded and necessary identifier columns added. In the second step, static values are filtered out giving the query that is actually executed by SQLite.

I tested mynodbcsv against three established database management systems (DBMS), in order of decreasing similarity to mynodbcsv – HSQLDB [35] (support for unlimited columns and CSV data storage), H2 [36] (unlimited columns, requires data import) and PostgreSQL [37] (limited columns, requires import). When possible I created indices for columns used in WHERE clauses. HSQLDB failed to create such indices for CSV-backed tables within 10 minutes, so I proceeded without them.

In order to evaluate basic function of my implementation I performed a set of queries on the abovementioned ADNI dataset including genetic data (about 30000 single nucleotide polymorphisms (SNPs)) and imaging dataset reduced using custom atlas from 400000 to 6800 features – an approach I used before to store the data in a PostgreSQL database. Even after such reduction it was impossible to store the data in a single table in PostgreSQL because of the built-in limit of (depending on the type) 250-1600 columns per table. Therefore, I decided to store only columns that were going to be used in expressions and put the remaining data without modifications in one additional column named “rest”.

Furthermore, to demonstrate its performance on big data, I used Allen Brain Atlas single subject gene expression data (900 MB CSV file, 60000 rows, 1000 columns), as well as an artificially generated file with 1000 rows and 400000 columns mimicking the situation with original imaging data. The latter scenario exceeded beyond what was possible with existing database solutions. I didn't perform it using other databases because of the vast performance gap between them and mynodbcsv, which would require too much time to complete.

All of the above tests were executed under Windows 7 operating system running on a PC with 16GB of memory and Intel Core i5-2400 processor running at the frequency of 3.10 GHz. Code was compiled with optimizations using GCC C++ Compiler version 4.6.2.

Furthermore, in order to place mynodbcsv in relation to NoDB, I performed a test similar to the first microbenchmark in [6] on a Macbook Air 13” 2013 model with 8 GB of RAM, Intel i7 CPU at 1.8 GHz and an SSD hard drive. Benchmark data consisted of 7.5 million rows with 150 columns containing integers in the range [0, 109). 10 SELECT queries without WHERE clause were executed with 10 random columns each. Next, 10 SELECT queries on 10 random columns with WHERE clause for one random column, were executed.

The abovementioned microbenchmark is representative of “narrow” data performance. Since this is the case, I decided to include also traditional (MySQL [38]) and innovative (wormtable [39], Teiid [40]) database systems, which were created for handling datasets with vertical extent much bigger than the horizontal one. This comparison further illustrates mynodbcsv's position in the database landscape.

In order to save storage space (in excess of 1 gigabyte) and bandwidth, mock-up versions of data files necessary to reproduce all of the above tests can be generated by scripts in File S1. Copies of original data (where applicable) are available from the ADNI [34] and Allen Brain Atlas [41] websites.


In the “wide” data benchmarks, mynodbcsv was the only truly satisfactory solution feature-wise, most of the time outperforming competitors also performance-wise [Tables 2,3,4].

Table 2. Performance comparison of mynodbcsv and HSQLDB/H2/PostgreSQL.

Table 3. Performance comparison of mynodbcsv and HSQLDB/H2/PostgreSQL using single subject Allen Brain Atlas data.

Table 4. mynodbcsv performance on a table with 400000 columns and 1000 rows (dummy); dummy2 has 10000 columns and 1000 rows.

It could be seen that performance of PostgreSQL was severely reduced when serving big TEXT-type column. In order to determine the root cause of this inefficiency I've run PostgreSQL with its data folder placed on a RAM disk created using ImDisk Virtual Disk Driver to remove any unfair advantage of mynodbcsv keeping data in-memory all the time. The difference in timings for PostgreSQL was negligible, therefore, I didn't report the second timings. I suppose that this poor performance might be a result of sockets-based API of PostgreSQL, which has to perform reformatting necessary for the protocol and push large volumes of data through a loopback network connection. Mynodbcsv on the other hand has direct access to the data. This model is better suited for local access and doesn't constitute a security issue if shared memory with appropriate protection flags is used to exchange data between different processes.

Mynodbcsv had a tendency for query time increase as function of number of columns. This performance hit was caused by the query rewriting mechanism which tracks all of the columns coming from tables in FROM and JOIN clauses throughout the query. It could be further optimized to either remove tracking of columns not specified explicitly in the SELECT clause (e.g. when “*” is used) or to decrease the computational complexity of column tracking. Removing this overhead would offer an order of magnitude increase in efficiency in some situations. Noteworthy, for image file formats where numbers of columns can reach millions, a very efficient array-addressing extension was introduced to the syntax, allowing column access using offset specification instead of name lookup. This practically eliminated the above problem.

Overall, mynodbcsv was the only solution to offer this level of performance and not suffer from any limitations.

In the first microbenchmark results [Tables 5,6], it took about 120 s for mynodbcsv to perform initial file scan and then 34 s for the 1st query. The second query took 8.4 s. Successively the query time stabilized at about 4.5 s. Probably NoDB would be significantly better than mynodbcsv in the other benchmarks used to evaluate it against existing DBMSes in [6] because queries containing projections/aggregations on all of the attributes would force mynodbcsv to build full SQLite database with all of the columns. Overcoming this is impossible in the current “intermediate” framework of mynodbcsv, however in my experience this is 1) a rare scenario, 2) can be easily circumvented by streaming query results to a custom application instead of projecting/aggregating on the DB side.

Table 5. Query time comparison in microbenchmark similar to the first one from [6], without WHERE condition.

Table 6. Query time comparison in microbenchmark based on first one from [6], with WHERE condition.

In the second test, mynodbcsv suffered a bit from on-the-fly parsing of CSVs which was tuned for parsing wide rather than long data. It didn't approach the performance of NoDB, falling behind by a factor of approximately 4 times. Perhaps different hardware configurations also affected the results in favor of NoDB.

Compared to wormtable and Teiid, mynodbcsv was again outperforming the other two by 1–2 orders of magnitude in both microbenchmark variants. When it comes to MySQL, mynodbcsv was an order of magnitude faster in the first variant (without WHERE clause) and about two times slower when the WHERE clause was present. This is yet again attributable to the way the benchmark was constructed, forcing mynodbcsv to add a new column to its SQLite store in each run.


The idea of using textual format for database storage isn't new and has been implemented completely or partially in existing solutions already. Mynodbcsv, however, is using an intermediate approach between building a new database engine and importing data to existing one. Doing so using query rewriting provides an efficient, robust and lightweight solution for many typical use-cases. It manages to reduce standard database involvement to the minimum and accesses bulk of the data directly in CSV files.

As can be seen in comparison to NoDB, it shares many of the same on-the-fly parsing mechanisms, however as it is less coupled with the query, it follows a more greedy approach when deciding what to parse (i.e. entire columns of data).

Since mynodbcsv uses an existing database engine without any modifications it can be configured with different backends. SQLite has been chosen as a particularly lightweight and standalone solution, however any database with appropriate Qt connector could be a drop-in replacement. For example, a binding to PGSQL (PostgreSQL) is a work in progress. It will be useful in certain situations because PGSQL supports FULL OUTER JOIN semantics, while SQLite doesn't.

Support for CSV as data storage format is also not the only option. The engine itself is completely unaware of using them, as they are represented transparently with a QAbstractItemModel interface. Mynodbcsv is easily extensible in terms of supported data formats, as long as similar representation is possible for them. Such a mapping for Nifti [42] files is a work in progress and future possibilities include also Hierarchical Data Format (HDF5), Extensible Markup Language (XML), MATLAB file format and others.

HSQLDB was the only freely available competitor offering support for unlimited number of columns and CSV-based tables. However, in the benchmarks it fell a long way behind both mynodbcsv and PostgreSQL in terms of performance. Having support for “real” columns and being able to execute functions on them as part of the query gives HSQLDB certain advantage, but in my experience with such wide tables, the typical use case is not to analyze them entirely within a database query. Usually it's rather a matter of data integrity. Robustness benefits from keeping everything in a single table, without resorting to cross filesystem linking. It's also convenient to retrieve selected parts of data by name. I tried to improve HSQLDB performance by creating indices on the columns used in WHERE clauses of the queries. This operation was taking an indefinite amount of time when text table sources were attached, so following the software documentation I detached them, created the indices and reattached the sources. However after this operation, queries involving JOIN clause started failing with “unsupported internal operation RowStoreAVL” error message. Therefore, results for HSQLDB are given without using indices.

H2 was significantly faster than HSQLDB with its support for unlimited columns when data were imported into the database, yet it was still far from the performance offered both by PostgreSQL and mynodbcsv. Also its limitation of only one process accessing the database at any given time was problematic already during testing and most probably would escalate in production environment.

Although mynodbcsv was slower than NoDB for some queries, it's noteworthy that at the same time it used only 2 * 7500000 * 4 = 60 MB of additional lookup space, with everything else effectively staying in the CSV files.

Mynodbcsv managed as well to outperform interesting and innovative solutions like wormtable and Teiid in the microbenchmark tests, falling behind MySQL slightly in the second benchmark variant. This deficiency could be mitigated by improving performance of SQLite imports, for example by importing columns into separate tables and joining them using views as opposed to re-creating a new table with all the necessary columns each time as it is done now. More radical solutions involve embedding mynodbcsv's CSV support directly in SQLite or writing a custom query execution engine from scratch.

From the perspective of end-user, mynodbcsv is already a versatile tool - facilitating easy handling of big data stored in CSV files. Despite the above examples being biased towards neuroscientific research, it's a completely generic solution with applications that are much broader and in fact valid for any type of tabular or “convertible to tabular” data. Potential uses - scientific, industrial and personal include astronomy, physics, economy, education, public health and more.

One could consider adding SQL completion solutions such as SQLSUGG [43] to the GUI in order to offer a helping hand to the users with less SQL expertise. On the backend side, support for horizontal aggregations [44] seems like a great addition to the big data nature of mynodbcsv.

Network access to mynodbcsv is another potential area for improvement. Issues involved include formatting of the results, which at the moment is plain CSV but could be optimized using binary encoding and/or compression. Combining these two approaches would improve performance on the client side because of reduced network bandwidth and CSV processing overhead. The problem of database locking while importing columns is currently solved using a global mutex, which allows one client to block the others when running a query that requires importing of too much data. This could be solved either by switching from SQLite backend to one that allows simultaneous writes to a database or by creating a dedicated SQLite database for each connected client. For many scenarios the latter solution seems like a fast and reliable option.


Processing very big and wide data is now commonplace in many professional environments. Ability to access it efficiently without building the usual database infrastructure is the holy grail of in-situ approach. Mynodbcsv offers the “best of both worlds” alternative for everybody who would like to benefit from in-situ SQL data processing without the hassle of setting up heavier and more elaborate systems. It's also to the best of my knowledge the only truly zero-config solution, which takes as little as drag and drop to attach data. Last but not least thanks to the portability of libraries used, it works out of the box on Windows, Linux and Mac OS X platforms. There are still many areas for improvement (tighter coupling of query analysis and data indexing/caching, better network performance, multi-threading), however current imperfections are counterbalanced by interesting properties of the system – speed, robustness, small footprint and predictability. I keep working on it so that one day it may join the family of next generation software solutions for data mining.

Supporting Information

File S1.

Set of Python scripts to generate data for benchmarks: equivalents of ADNI_Clin_6800_geno.csv, PTDEMOG.csv, MicroarrayExpression_fixed.csv and Probes.csv files, the dummy.csv, dummy2.csv and the microbenchmark CSV files.


Author Contributions

Conceived and designed the experiments: SA. Performed the experiments: SA. Analyzed the data: SA. Contributed reagents/materials/analysis tools: SA. Contributed to the writing of the manuscript: SA.


  1. 1. Boost Website (n.d.). Available: Accessed 2014 July 2.
  2. 2. SQLite Website (n.d.). Available: Accessed 2014 July 2.
  3. 3. Qt Project Website (n.d.). Available: Accessed 2014 July 2.
  4. 4. MyNoDbCsv Website (n.d.). Available: Accessed 2014 July 2.
  5. 5. Stonebraker M (2010) SQL databases v. NoSQL databases. Commun ACM 53: 10
  6. 6. Alagiannis I, Borovica R, Branco M, Idreos S, Ailamaki A (2012) NoDB: efficient query execution on raw data files. Proc 2012 ACM SIGMOD Int Conf Manag Data: 241–252. doi:10.1145/2213836.2213864
  7. 7. Agrawal S, Chaudhuri S, Narasayya V (2000) Automated Selection of Materialized Views and Indexes in SQL Databases. VLDB.
  8. 8. Agrawal S, Narasayya V, Yang B (2004) Integrating vertical and horizontal partitioning into automated physical database design. Proceedings of the 2004 ACM SIGMOD international conference on Management of data - SIGMOD '04. p. 359. doi:10.1145/1007568.1007609
  9. 9. Agrawal S, Chaudhuri S, Kollar L, Marathe A, Narasayya V, et al.. (2005) Database tuning advisor for microsoft SQL server 2005: demo. Proceedings of the 2005 ACM SIGMOD international conference on Management of data SE - SIGMOD '05. pp. 930–932. doi:10.1145/1066157.1066292
  10. 10. Bruno N, Chaudhuri S (2005) Automatic physical database tuning: a relaxation-based approach. Proceedings of the 2005 ACM SIGMOD international conference on Management of data. pp. 227–238. doi:10.1145/1066157.1066184
  11. 11. Chaudhuri S, Narasayya VR (1997) An Efficient Cost-Driven Index Selection Tool for Microsoft SQL Server. Proceedings of the 23rd International Conference on Very Large Data Bases. pp. 146–155.
  12. 12. Dageville B, Das D, Dias K, Yagoub K, Zait M, et al.. (2004) Automatic SQL tuning in oracle 10g. VLDB '04: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 SE - VLDB '04. pp. 1098–1109.
  13. 13. Dash D, Polyzotis N, Ailamaki A (2011) CoPhy: a scalable, portable, and interactive index advisor for large workloads. Proc VLDB Endow: 362–372.
  14. 14. Papadomanolakis S, Ailamaki A (2004) AutoPart: automating schema design for large scientific databases using data partitioning. Proceedings 16th Int Conf Sci Stat Database Manag 2004. doi:10.1109/SSDM.2004.1311234
  15. 15. Valentin G, Zuliani M, Zilio DC, Lohman G, Skelley A (2000) DB2 advisor: an optimizer smart enough to recommend its own indexes. Proc 16th Int Conf Data Eng (Cat No00CB37073). doi:10.1109/ICDE.2000.839397
  16. 16. Zilio DC, Rao J, Lightstone S, Lohman G, Storm A, et al.. (2004) DB2 design advisor: integrated automatic physical database design. VLDB '04. pp. 1087–1097.
  17. 17. Bruno N, Chaudhuri S (2006) To tune or not to tune?: a lightweight physical design alerter. VLDB '06: Proceedings of the 32nd international conference on Very large data bases. pp. 499–510.
  18. 18. Schnaitter K, Abiteboul S, Milo T, Polyzotis N (2006) COLT: continuous on-line tuning. SIGMOD '06: Proceedings of the 2006 ACM SIGMOD international conference on Management of data. pp. 793–795. doi:10.1145/1142473.1142592
  19. 19. Graefe G, Kuno H (2010) Adaptive indexing for relational keys. Proceedings - International Conference on Data Engineering. pp. 69–74. doi:10.1109/ICDEW.2010.5452743
  20. 20. Graefe G, Kuno H (2010) Self-selecting, self-tuning, incrementally optimized indexes. Proceedings of the 13th International Conference on Extending Database Technology - EDBT '10. p. 371. doi:10.1145/1739041.1739087
  21. 21. Graefe G, Idreos S, Kuno H, Manegold S (2011) Benchmarking adaptive indexing. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6417 LNCS. pp. 169–184. doi:10.1007/978-3-642-18206-8_13.
  22. 22. Idreos S, Kersten ML, Manegold S (2007) Database Cracking. Proc CIDR 369: 68–78
  23. 23. Idreos S, Kersten ML, Manegold S (2009) Self-organizing Tuple Reconstruction in Column-stores. SIGMOD ' 09: 297–308
  24. 24. Idreos S, Manegold S, Kuno H, Graefe G (2011) Merging what's cracked, cracking what's merged: adaptive indexing in main-memory column-stores. Proc VLDB.
  25. 25. Idreos S, Kersten ML, Manegold S (2007) Updating a cracked database. Proc 2007 ACM SIGMOD Int Conf Manag data - SIGMOD ' 07: 413
  26. 26. Jain A, Doan A, Gravano L (2008) Optimizing SQL queries over text databases. Proceedings - International Conference on Data Engineering. pp. 636–645. doi:10.1109/ICDE.2008.4497472
  27. 27. Ailamaki A, Kantere V, Dash D (2010) Managing scientific data. Commun ACM 53: 68
  28. 28. Cohen J, Dolan B, Dunlap M, Hellerstein JM, Welton C (2009) MAD Skills: New Analysis Practices for Big Data. Proc VLDB Endow 2: 1481–1492.
  29. 29. Gray J, Liu DT, Nieto-santisteban M, Szalay AS, Dewitt D, et al.. (2005) Scientific Data Management in the Coming Decade. ACM SIGMOD Rec.
  30. 30. Idreos S, Alagiannis I, Johnson R, Ailamaki A (2011) Here are my Data Files. Here are my Queries. Where are my Results? 5th Biennial Conference on Innovative Data Systems Research CIDR'11. pp. 1–12.
  31. 31. Kersten M, Idreos S, Manegold S, Liarou E (2011) The researcher's guide to the data deluge: Querying a scientific database in just a few seconds. Proc VLDB Endow 4: 1474–1477.
  32. 32. K Lorincz, K Redwine JT (2003) Grep versus FlatSQL versus MySQL. Available: Accessed 2014 July 2.
  33. 33. Stonebraker M (2009) Requirements for Science Data Bases and SciDB. 4th Biennial Conference on Innovative Data Systems Research CIDR'09. p. 173184. doi:
  34. 34. Alzheimer's Disease Neuroimaging Initiative Website (n.d.). Available: Accessed 2014 July 2.
  35. 35. HSQLDB Website (n.d.). Available: Accessed 2014 July 2.
  36. 36. H2 Database Website (n.d.). Available: Accessed 2014 July 2.
  37. 37. PostgreSQL Website (n.d.). Available: Accessed 2014 July 2.
  38. 38. MySQL Website (n.d.). Available: Accessed 2014 July 2.
  39. 39. Wormtable Website (n.d.). Available: Accessed 2014 July 2.
  40. 40. Teiid Website (n.d.). Available: Accessed 2014 July 2.
  41. 41. Allen Brain Atlas Website (n.d.). Available: Accessed 2014 July 2.
  42. 42. NIFTI-1 Format Website (n.d.). Available: Accessed 2014 July 2.
  43. 43. Fan J, Li G, Zhou L (2011) Interactive SQL query suggestion: Making databases user-friendly. Proceedings - International Conference on Data Engineering. pp. 351–362. doi:10.1109/ICDE.2011.5767843
  44. 44. Ordonez C, Chen Z (2012) Horizontal aggregations in SQL to prepare data sets for data mining analysis. IEEE Trans Knowl Data Eng 24: 678–691