
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Bin Cui, Beng Chin Ooi, Jianwen Su, KianLee Tan, "Indexing HighDimensional Data for Efficient InMemory Similarity Search," IEEE Transactions on Knowledge and Data Engineering, vol. 17, no. 3, pp. 339353, March, 2005.  
BibTex  x  
@article{ 10.1109/TKDE.2005.46, author = {Bin Cui and Beng Chin Ooi and Jianwen Su and KianLee Tan}, title = {Indexing HighDimensional Data for Efficient InMemory Similarity Search}, journal ={IEEE Transactions on Knowledge and Data Engineering}, volume = {17}, number = {3}, issn = {10414347}, year = {2005}, pages = {339353}, doi = {http://doi.ieeecomputersociety.org/10.1109/TKDE.2005.46}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Knowledge and Data Engineering TI  Indexing HighDimensional Data for Efficient InMemory Similarity Search IS  3 SN  10414347 SP339 EP353 EPD  339353 A1  Bin Cui, A1  Beng Chin Ooi, A1  Jianwen Su, A1  KianLee Tan, PY  2005 KW  Highdimensional index KW  main memory KW  similarity query. VL  17 JA  IEEE Transactions on Knowledge and Data Engineering ER   
[1] CMU Graphics Lab Motion Capture Database, available from http:/mocap.cs.cmu.edu/, 2004.
[2] Corel Image Features, available from http:/kdd.ics.uci.edu, 2000.
[3] S. Berchtold, C. Böhm, and H.P. Kriegel, “The PyramidTree: Breaking the Curse of Dimensionality,” Proc. ACM SIGMOD Conf., pp. 142153, 1998.
[4] S. Berchtold, C. Bohm, D. Keim, F. Krebs, and H.P. Kriegel, “On Optimizing Nearest Neighbor Queries in HighDimensional Data Spaces,” Proc. Eighth Int'l Conf. Database Theory, pp. 435449, 2001.
[5] P. Bohannon, P. Mcllroy, and R. Rastogi, “MainMemory Index Structures with FixedSize Partial Keys,” Proc. ACM SIGMOD Conf., pp. 163174, 2001.
[6] C. Bohm, S. Berchtold, and D. Keim, “Searching in HighDimensional Spaces: Index Structures for Improving the Performance of Multimedia Databases,” ACM Computing Surveys, pp. 322373, 2001.
[7] T. Bozkaya and M. Ozsoyoglu, “DistanceBased Indexing for HighDimensional Metric Spaces,” Proc. ACM SIGMOD Conf., pp. 357368, 1997.
[8] K. Chakrabarti and S. Mehrotra, “Local Dimensionality Reduction: A New Approach to Indexing High Dimensional Spaces,” Proc. 26th Very Large Data Bases Conf., pp. 89100, 2000.
[9] S. Chen, P.B. Gibbons, and T.C. Mowry, “Improving Index Performance through Prefetching,” Proc. ACM SIGMOD Conf., pp. 139150, 2001.
[10] P. Ciaccia, M. Patella, and P. Zezula, “MTree: An Efficient Access Method for Similarity Search in Metric Spaces,” Proc. 24th Very Large Data Bases Conf., pp. 194205, 1997.
[11] B. Cui, B.C. Ooi, J.W. Su, and K.L. Tan, “Contorting High Dimensional Data for Efficient Main Memory Processing,” Proc. ACM SIGMOD Conf., pp. 479490, 2003.
[12] B. Cui, B.C. Ooi, J.W. Su, and K.L. Tan, “Main Memory Indexing: The Case for BDTree,” IEEE Trans. Knowledge and Data Eng., 2003.
[13] R. Enbody Perfmon: Performance Monitoring Tool, available from http://www.cps.msu.edu/enbodyperfmon.html , 1999.
[14] R.F.S. Filho, A. Traina, C. TrainaJr., and C. Faloutsos, “Similarity Search without Tears: The OmniFamily of AllPurpose Access Methods,” Proc. 17th Int'l Conf. Data Eng., 2001.
[15] G.H. Golub and C.F. Van Loan, Matrix Computations. The Johns Hopkins Univ. Press, 1989.
[16] J. Hui, B.C. Ooi, H. Shen, C. Yu, and A. Zhou, “An Adaptive and Efficient Dimensionality Reduction Algorithm for HighDimensional Indexing,” Proc. 19th Int'l Conf. Data Eng., 2003.
[17] I.T. Jolliffe, Principal Component Analysis. SpringerVerlag, 1986.
[18] C. TrainaJr., A. Traina, C. Faloutsos, and B. Seeger, “Fast Indexing and Visualization of Metric Data Sets Using SlimTrees,” IEEE Trans. Knowledge and Data Eng., 2002.
[19] K. Kim, S.K. Cha, and K. Kwon, “Optimizing Multidimensional Index Trees for Main Memory Access,” Proc. ACM SIGMOD Conf., pp. 139150, 2001.
[20] K. Lin, H.V. Jagadish, and C. Faloutsos, “The TVTree: An Index Structure for HighDimensional Data,” The VLDB J., vol. 3, no. 4, pp. 517542, 1994.
[21] J. Rao and K. Ross, “Making B+Trees Cache Conscious in Main Memory,” Proc. ACM SIGMOD Conf., pp. 475486, 2000.
[22] R. Weber, H.J. Schek, and S. Blott, “A Quantitative Analysis and Performance Study for SimilaritySearch Methods in HighDimensional Spaces,” Proc. 24th Very Large Data Bases Conf., pp. 194205, 1998.
[23] C. Yu, B.C. Ooi, K.L. Tan, and H.V. Jagadish, “Indexing the Distance: An Efficient Method to KNN Processing,” Proc. 27th Very Large Data Bases Conf., pp. 421430, 2001.