Accelerating Queries on Very Large Datasets - Scientific Data Management - page 230

[37] R. Grossi and J. S. Vitter. Compressed sux arrays and sux trees with
applications to text indexing and string matching. SIAM J. Comput. ,
35(2):378-407, 2005.
[38] A. Gupta, K. C. Davis, and J. Grommon-Litton. Performance compar-
ison of property map and bitmap indexing. In DOLAP'02 , pp. 65-71.
ACM, 2002.
[39] D. Gusfield. Algorithms on strings, trees and sequences: Computer
science

and computational biology . Cambridge University Press,

Cambridge, MA, 1997.
[40] A. Guttman. R-trees: A dynamic index structure for spatial searching.
In SIGMOD , pp. 47-57. ACM, 1984.
[41] R. J. Hanisch, A. Farris, E. W. Greisen, W. D. Pence, B. M. Schlesinger,
P. J. Teuben, R. W. Thompson, and A. Warmork III. Definition of the
flexible image transport system (FITS). Astronomy and Astrophysics.
Supp. Ser. , 376:359-380, 2001.
[42] HDF5 home page. http://www.hdfgroup.org/HDF5.
[43] S. Heinz, J. Zobel, and H. E. Williams. Burst tries: A fast, ecient data
structure for string keys. ACM Trans. Inf. Syst. , 20(2):192-223, 2002.
[44] M. Jarke and J. Koch. Query optimization in database systems. ACM
Computing Surveys , 16(2):111-152, 1984.
[45] T. Johnson. Performance measurements of compressed bitmap indices.
In VLDB , Edinburgh, Scotland, September 1999. Morgan Kaufmann.
[46] N. Katayama and S. Satoh. The SR-tree: An index structure for high-
dimensional nearest neighbor queries. In SIGMOD'97 , pp. 369-380.
ACM, 1997.
[47] D. Knuth. The art of computer programming: Sorting and searching ,
volume 3. Addison-Wesley, Reading, MA, 2nd edition, 1973.
[48] N. Koudas. Space ecient bitmap indexing. In CIKM'00 , pp. 194-201.
ACM, 2000.
[49] Z. Lacroix and T. Critchlow, editors. Bioinformatics: Managing
scientific data . San Francisco: Morgan Kaufmann, 2003.
[50] R. Lammel. Google's mapreduce programming model—revisited.

Science of Computer Programming , 70(1):1-30, 2008.
[51] P. Larson. Dynamic hashing. BIT , 18:184-201, 1978.
[52] J. K. Lawder and P. J. H. King. Using space-filling curves for mul-
tidimensional indexing. In BNCOD , volume 1832 of Lecture Notes in
Computer Science . Springer, 2000.