Author:
Kolbe Dashiell,Zhu Qiang,Pramanik Sakti
Funder
US National Science Foundation
Subject
Hardware and Architecture,Information Systems,Software
Reference16 articles.
1. N. Beckmann, H.-P. Kriegel, R. Schneider, B. Seeger, The R⁎-tree: an efficient and robust access method for points and rectangles, in: Proceedings of ACM SIGMOD, 1990, pp. 322–331.
2. Dynamic indexing for multidimensional non-ordered discrete data spaces using a data-partitioning approach;Qian;ACM Trans. Database Syst.,2006
3. P. Ciaccia, M. Patella, P. Zezula, M-tree: an efficient access method for similarity search in metric spaces, in: Proceedings of VLDB, 1997, pp. 426–435.
4. Fast indexing and visualization of metric data sets using slim-trees;Traina;IEEE Trans. Knowl. Data Eng.,2002
5. Dynamic spatial approximation trees;Navarro;ACM J. Exp. Algorithmics,2008