{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T20:47:02Z","timestamp":1725742022181},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642402340"},{"type":"electronic","value":"9783642402357"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40235-7_11","type":"book-chapter","created":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:47:24Z","timestamp":1374022044000},"page":"183-200","source":"Crossref","is-referenced-by-count":5,"title":["PL-Tree: An Efficient Indexing Method for High-Dimensional Data"],"prefix":"10.1007","author":[{"given":"Jie","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jian","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zheng","family":"Fang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tingjian","family":"Ge","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cindy","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Arge, L., de Berg, M., Haverkort, H.J., Yi, K.: The priority R-tree: A practically efficient and worst-case optimal R-tree. In: Proceedings of ACM\/SIGMOD Annual Conference on Management of Data (SIGMOD), pp. 347\u2013358 (2004)","key":"11_CR1","DOI":"10.1145\/1007568.1007608"},{"doi-asserted-by":"crossref","unstructured":"Beckmann, N., Kriegel, H.-P., Schneider, R., Seeger, B.: The R*-tree: An efficient and robust access method for points and rectangles. In: Proceedings of ACM\/SIGMOD Annual Conference on Management of Data (SIGMOD), pp. 322\u2013331 (1990)","key":"11_CR2","DOI":"10.1145\/93597.98741"},{"doi-asserted-by":"crossref","unstructured":"Berchtold, S., B\u00f6hm, C., Kriegel, H.-P.: The pyramid-technique: Towards breaking the curse of dimensionality. In: Proceedings of ACM\/SIGMOD Annual Conference on Management of Data (SIGMOD), pp. 142\u2013153 (1998)","key":"11_CR3","DOI":"10.1145\/276304.276318"},{"unstructured":"Berchtold, S., Keim, D.A., Kriegel, H.-P.: The X-tree: An index structure for high-dimensional data. In: Proceedings of International Conference on Very Large Data Bases (VLDB), pp. 28\u201339 (1996)","key":"11_CR4"},{"issue":"3","key":"11_CR5","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1145\/502807.502809","volume":"33","author":"C. B\u00f6hm","year":"2001","unstructured":"B\u00f6hm, C., Berchtold, S., Keim, D.A.: Searching in high-dimensional spaces: Index structures for improving the performance of multimedia databases. ACM Comput. Surv.\u00a033(3), 322\u2013373 (2001)","journal-title":"ACM Comput. Surv."},{"unstructured":"Cantor, G.: Contributions to the Founding of the Theory of Transfinite Numbers. Dover, New York (1955);","key":"#cr-split#-11_CR6.1"},{"unstructured":"Original year was 1915","key":"#cr-split#-11_CR6.2"},{"unstructured":"Ciaccia, P., Patella, M., Zezula, P.: M-tree: An efficient access method for similarity search in metric spaces. In: Proceedings of International Conference on Very Large Data Bases (VLDB), pp. 426\u2013435 (1997)","key":"11_CR7"},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-38076-0_1","volume-title":"Advances in Informatics","author":"A. Corral","year":"2003","unstructured":"Corral, A., Ca\u00f1adas, J., Vassilakopoulos, M.: Processing distance-based queries in multidimensional data spaces using r-trees. In: Manolopoulos, Y., Evripidou, S., Kakas, A.C. (eds.) PCI 2001. LNCS, vol.\u00a02563, pp. 1\u201318. Springer, Heidelberg (2003)"},{"doi-asserted-by":"crossref","unstructured":"Fonseca, M.J., Jorge, J.A.: Indexing high-dimensional data for content-based retrieval in large databases. In: Proceedings of International Conference on Database Systems for Advanced Applications (DASFAA), pp. 267\u2013274 (2003)","key":"11_CR9","DOI":"10.1109\/DASFAA.2003.1192391"},{"issue":"2","key":"11_CR10","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1145\/280277.280279","volume":"30","author":"V. Gaede","year":"1998","unstructured":"Gaede, V., G\u00fcnther, O.: Multidimensional access methods. ACM Comput. Surv.\u00a030(2), 170\u2013231 (1998)","journal-title":"ACM Comput. Surv."},{"doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-trees: A dynamic index structure for spatial searching. In: Proceedings of ACM\/SIGMOD Annual Conference on Management of Data (SIGMOD), pp. 47\u201357 (1984)","key":"11_CR11","DOI":"10.1145\/602259.602266"},{"issue":"2","key":"11_CR12","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1145\/320248.320255","volume":"24","author":"G.R. Hjaltason","year":"1999","unstructured":"Hjaltason, G.R., Samet, H.: Distance browsing in spatial databases. ACM Trans. Database Syst.\u00a024(2), 265\u2013318 (1999)","journal-title":"ACM Trans. Database Syst."},{"unstructured":"Hoel, E.G., Samet, H., Tree, R.: Benchmarking spatial join operations with spatial output. In: Proceedings of the 21st International Conference on Very Large Data Bases, pp. 606\u2013618 (1998)","key":"11_CR13"},{"key":"11_CR14","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1145\/1071610.1071612","volume":"30","author":"H.V. Jagadish","year":"2005","unstructured":"Jagadish, H.V., Ooi, B.C., Tan, K.-L., Yu, C., Zhang, R.: idistance: An adaptive b+-tree based indexing method for nearest neighbor search. ACM Trans. Database Syst.\u00a030, 364\u2013397 (2005)","journal-title":"ACM Trans. Database Syst."},{"unstructured":"Kamel, I., Faloutsos, C.: Hilbert R-tree: An improved R-tree using fractals. In: VLDB, pp. 500\u2013509 (1994)","key":"11_CR15"},{"doi-asserted-by":"crossref","unstructured":"Katayama, N., Satoh, S.: The SR-tree: An index structure for high-dimensional nearest neighbor queries. In: Proceedings of ACM\/SIGMOD Annual Conference on Management of Data (SIGMOD), pp. 369\u2013380 (1997)","key":"11_CR16","DOI":"10.1145\/253260.253347"},{"doi-asserted-by":"crossref","unstructured":"Kim, Y.J., Patel, J.: Performance comparison of the r*-tree and the quadtree for knn and distance join queries. IEEE Transactions on Knowledge and Data Engineering\u00a022(7), 1014\u20131027 July","key":"11_CR17","DOI":"10.1109\/TKDE.2009.141"},{"key":"11_CR18","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1145\/564691.564755","volume-title":"Proceedings of the 2002 ACM SIGMOD International Conference on Management of Data, SIGMOD 2002","author":"R.K.V. Kothuri","year":"2002","unstructured":"Kothuri, R.K.V., Ravada, S., Abugov, D.: Quadtree and r-tree indexes in oracle spatial: a comparison using gis data. In: Proceedings of the 2002 ACM SIGMOD International Conference on Management of Data, SIGMOD 2002, pp. 546\u2013557. ACM, New York (2002)"},{"doi-asserted-by":"crossref","unstructured":"Leutenegger, S., Lopez, M., Edgington, J.: Str: a simple and efficient algorithm for r-tree packing. In: Proceedings of the13th International Conference on Data Engineering, pp. 497\u2013506 (April 1997)","key":"11_CR19","DOI":"10.1109\/ICDE.1997.582015"},{"issue":"4","key":"11_CR20","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/BF01231606","volume":"3","author":"K.-I. Lin","year":"1994","unstructured":"Lin, K.-I., Jagadish, H.V., Faloutsos, C.: The TV-tree: An index structure for high-dimensional data. VLDB Journal\u00a03(4), 517\u2013542 (1994)","journal-title":"VLDB Journal"},{"issue":"1","key":"11_CR21","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1145\/348.318586","volume":"9","author":"J. Nievergelt","year":"1984","unstructured":"Nievergelt, J., Hinterberger, H., Sevcik, K.C.: The grid file: An adaptable, symmetric multikey file structure. ACM Trans. Database Syst.\u00a09(1), 38\u201371 (1984)","journal-title":"ACM Trans. Database Syst."},{"key":"11_CR22","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1145\/335168.335219","volume-title":"Proceedings of the Nineteenth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2000","author":"B.C. Ooi","year":"2000","unstructured":"Ooi, B.C., Tan, K.-L., Yu, C., Bressan, S.: Indexing the edges - a simple and yet efficient approach to high-dimensional indexing. In: Proceedings of the Nineteenth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2000, pp. 166\u2013174. ACM, New York (2000)"},{"unstructured":"Sakurai, Y., Yoshikawa, M., Uemura, S., Kojima, H.: The A-tree: An index structure for high-dimensional spaces using relative approximation. In: Proceedings of International Conference on Very Large Data Bases (VLDB), pp. 516\u2013526 (2000)","key":"11_CR23"},{"issue":"3","key":"11_CR24","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1145\/282957.282966","volume":"4","author":"H. Samet","year":"1985","unstructured":"Samet, H., Webber, R.E.: Storing a collection of polygons using quadtrees. ACM Trans. Graph.\u00a04(3), 182\u2013222 (1985)","journal-title":"ACM Trans. Graph."},{"unstructured":"Sellis, T.K., Roussopoulos, N., Faloutsos, C.: The R+-tree: A dynamic index for multi-dimensional objects. In: Proceedings of International Conference on Very Large Data Bases (VLDB), pp. 507\u2013518 (1987)","key":"11_CR25"},{"issue":"1-2","key":"11_CR26","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/s10827-009-0180-4","volume":"29","author":"H. Shimazaki","year":"2010","unstructured":"Shimazaki, H., Shinomoto, S.: Kernel bandwidth optimization in spike rate estimation. Journal of Computational Neuroscience\u00a029(1-2), 171\u2013182 (2010)","journal-title":"Journal of Computational Neuroscience"},{"unstructured":"Weber, R., Schek, H.-J., Blott, S.: A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In: Proceedings of International Conference on Very Large Data Bases (VLDB), pp. 194\u2013205 (1998)","key":"11_CR27"},{"doi-asserted-by":"crossref","unstructured":"White, D.A., Jain, R.: Similarity indexing with the SS-tree. In: Proceedings of International Conference on Data Engineering (ICDE), pp. 516\u2013523 (1996)","key":"11_CR28","DOI":"10.1109\/ICDE.1996.492202"},{"unstructured":"Yianilos, P.N.: Data structures and algorithms for nearest neighbor search in general metric spaces. In: Proceedings of Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 311\u2013321 (1993)","key":"11_CR29"}],"container-title":["Lecture Notes in Computer Science","Advances in Spatial and Temporal Databases"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40235-7_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,18]],"date-time":"2019-07-18T10:19:23Z","timestamp":1563445163000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40235-7_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642402340","9783642402357"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40235-7_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}