Author:
Bellam Haritha,Rahul Saladi,Rajan Krishnan
Publisher
Springer Berlin Heidelberg
Reference15 articles.
1. http://www.mcobject.com/in_memory_database
2. http://www.ics.uci.edu/mlearn/MLRepository.html
3. Lecture Notes in Computer Science;P.K. Agarwal,2002
4. Beckmann, N., Kriegel, H.-P., Schneider, R., Seeger, B.: The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles. In: ACM SIGMOD Conference, pp. 322–331 (1990)
5. Bentley, J.L.: Multidimensional binary search trees used for associative searching. Communications of the ACM 18, 509–517 (1975)