Accelerating range queries for brain simulations

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2012, Pages 941-952

  Tauheed, Farhan ^a   Biveinis, Laurynas ^b   Heinis, Thomas ^a   Schurmann, Felix ^a   Markram, Henry ^a   Ailamaki, Anastasia ^a  

^a EPFL   (Switzerland)

^b AALBORG UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL TOOLS; DATA SET SIZE; DATA SETS; IN-BUILDINGS; LEVEL OF DETAIL; QUERY EXECUTION; QUERY RESULTS; RANGE QUERY; SECOND PHASE; SPATIAL INDICES; SPATIAL MODELS; TREE STRUCTURES;

DECISION TREES; FORESTRY; INDEXING (OF INFORMATION); TREES (MATHEMATICS);

BRAIN MODELS;

DATA PROCESSING; DECISION THEORY; INDEXING; INFORMATION RETRIEVAL; MATHEMATICAL MODELS; SIMULATION;

EID: 84864267949     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2012.56     Document Type: Conference Paper

References (22)

1. L. Arge, M. de Berg, H. J. Haverkort, and K. Yi. The Priority R-tree: a practically efficient and worst-case optimal R-tree. In SIGMOD '04.
2. R. Bayer. Binary B-Trees for Virtual Memory. In Proceedings of the Workshop on Data Description, Access and Control, 1971.
3. N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger. The R*-Tree: an efficient and robust access method for points and rectangles. SIGMOD Record, 19(2):322-331, 1990.
4. J. L. Bentley. Multidimensional Binary Search Trees Used for Associative Searching. Communications of the ACM, 18(9):509-517, 1975.
5. J. L. Bentley and J. H. Friedman. Data Structures for Range Searching. ACM Computing Surveys, 11(4):397-409, 1979.
6. V. Gaede and O. Günther. Multidimensional Access Methods. ACM Computing Surveys, 30(2), 1998.
7. Y. J. García, M. A. López, and S. T. Leutenegger. A Greedy Algorithm for Bulk Loading R-trees. In GIS '96.
8. J. Gray, A. Szalay, A. Thakar, P. Kunszt, C. Stoughton, D. Slutz, and J. Vandenberg. Data Mining the SDSS SkyServer Database. In Technical Report, MSR-TR-2002-01, Microsoft Research, 2002.
9. L. Grinberg, T. Anor, J. R. Madsen, A. Yakhot, and G. E. Karniadakis. Large-scale simulation of the human arterial tree. Clinical and Experimental Pharmacology and Physiology, 36(2):194-205, 2009.
10. A. Guttman. R-Trees: A Dynamic Index Structure for Spatial Searching. In SIGMOD '84.
11. M. Hadjieleftheriou, May 2010. http://www2.research.att.com/~marioh/ spatialindex/.
12. C. L. Jackins and S. L. Tanimoto. Oct-trees and Their Use in Representing Three-dimensional Objects. Computer Graphics and Image Processing, 14(3), 1980.
13. I. Kamel and C. Faloutsos. Hilbert R-Tree: An Improved R-Tree using Fractals. In VLDB '94.
14. D. Komatitsch, S. Tsuboi, C. Ji, and J. Tromp. A 14.6 Billion Degrees of Freedom, 5 Teraflops, 2.5 Terabyte Earthquake Simulation on the Earth Simulator. In SC '03.
15. Y. Kwon, D. Nunley, J. Gardner, M. Balazinska, B. Howe, and S. Loebman. Scalable clustering algorithm for n-body simulations in a sharednothing cluster. In SSDBM 2010.
16. S. Leutenegger, M. Lopez, and J. Edgington. STR: a Simple and Efficient Algorithm for R-Tree Packing. In ICDE '97.
17. H. Markram. The Blue Brain Project. Nature Reviews Neuroscience, 7(2):153-160, 2006.
18. S. Papadomanolakis, A. Ailamaki, J. C. Lopez, T. Tu, D. R. O'Hallaron, and G. Heber. Efficient Query Processing on Unstructured Tetrahedral Meshes. In SIGMOD '06.
19. O. Procopiuc, P. K. Agarwal, L. Arge, and J. S. Vitter. Bkd-Tree: A Dynamic Scalable kd-Tree. In Advances in Spatial and Temporal Databases, volume 2750 of Lecture Notes in Computer Science, 2003.
20. H. Samet. The Quadtree and Related Hierarchical Data Structures. ACM Computing Surveys, 16(2):187-260, 1984.
21. T. K. Sellis, N. Roussopoulos, and C. Faloutsos. The R+-Tree: A Dynamic Index for Multi-Dimensional Objects. In VLDB '87.
22. D. K. Walters and W. H. Luke. Computational fluid dynamics simulations of particle deposition in large-scale, multigenerational lung models. Journal of Biomechanical Engineering, 133(1):011003-8, 2011.