{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T10:24:43Z","timestamp":1725531883289},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642013461"},{"type":"electronic","value":"9783642013478"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-01347-8_13","type":"book-chapter","created":{"date-parts":[[2009,5,4]],"date-time":"2009-05-04T13:06:48Z","timestamp":1241442408000},"page":"149-159","source":"Crossref","is-referenced-by-count":0,"title":["A Study of Indexing Strategies for Hybrid Data Spaces"],"prefix":"10.1007","author":[{"given":"Changqing","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sakti","family":"Pramanik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiang","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gang","family":"Qian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","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, pp. 322\u2013331 (1990)","DOI":"10.1145\/93597.98741"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Catlett, J.: On changing continuous attributes into ordered discrete attributes. In: Proceedings of the European Working Session on Machine Learning, pp. 164\u2013178 (1991)","DOI":"10.1007\/BFb0017012"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Chakrabarti, K., Mehrotra, S.: The hybrid tree: an index structure for high dimensional feature spaces. In: Proceedings of the 15th International Conference on Data Engineering, pp. 440\u2013447 (1999)","DOI":"10.1109\/ICDE.1999.754960"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Chen, C., Pramanik, S., Watve, A., Zhu, Q., Qiang, G.: The C-ND Tree: A Multidimensional Index for Hybrid Continuous and Non-ordered Discrete Data Spaces. In: Proceedings of the 12th International Conference on Extending Database Technology (2009)","DOI":"10.1145\/1516360.1516414"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Freitas, A.A.: A survey of evolutionary algorithms for data mining and knowledge discovery. In: Advances in Evolutionary Computing: Theory and Applications, pp. 819\u2013845 (2003)","DOI":"10.1007\/978-3-642-18965-4_33"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-trees: a dynamic index structure for spatial searching. In: Proceedings of ACM SIGMOD, pp. 47\u201357 (1984)","DOI":"10.1145\/602259.602266"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Henrich, A.: The LSDh-tree: an access structure for feature vectors. In: Proceedings of the 14th International Conference on Data Engineering, pp. 362\u2013369 (1998)","DOI":"10.1109\/ICDE.1998.655799"},{"issue":"1","key":"13_CR8","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/S0004-3702(02)00359-4","volume":"143","author":"S.A. Macskassy","year":"2003","unstructured":"Macskassy, S.A., Hirsh, H., Banerjee, A., Dayanik, A.A.: Converting numerical classification into text classification. Artificial Intelligence\u00a0143(1), 51\u201377 (2003)","journal-title":"Artificial Intelligence"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Qian, G., Zhu, Q., Xue, Q., Pramanik, S.: The ND-tree: a dynamic indexing technique for multidimensional non-ordered discrete data spaces. In: Proceedings of the 29th International Conference on VLDB, pp. 620\u2013631 (2003)","DOI":"10.1016\/B978-012722442-8\/50061-6"},{"issue":"2","key":"13_CR10","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1145\/1138394.1138395","volume":"31","author":"G. Qian","year":"2006","unstructured":"Qian, G., Zhu, Q., Xue, Q., Pramanik, S.: Dynamic indexing for multidimensional non-ordered discrete data spaces using a data-partitioning approach. Proceedings of ACM Transactions on Database Systems\u00a031(2), 439\u2013484 (2006)","journal-title":"Proceedings of ACM Transactions on Database Systems"},{"issue":"1","key":"13_CR11","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1145\/1125857.1125860","volume":"23","author":"G. Qian","year":"2006","unstructured":"Qian, G., Zhu, Q., Xue, Q., Pramanik, S.: A space-partitioning-based indexing method for multidimensional non-ordered discrete data spaces. ACM Trans. on Information Syst.\u00a023(1), 79\u2013110 (2006)","journal-title":"ACM Trans. on Information Syst."},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Robinson, J.T.: The K-D-B-tree: a search structure for large multidimensional dynamic indexes. In: Proceedings of ACM SIGMOD, pp. 10\u201318 (1981)","DOI":"10.1145\/582318.582321"}],"container-title":["Lecture Notes in Business Information Processing","Enterprise Information Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-01347-8_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T16:39:38Z","timestamp":1558283978000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-01347-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642013461","9783642013478"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-01347-8_13","relation":{},"ISSN":["1865-1348","1865-1356"],"issn-type":[{"type":"print","value":"1865-1348"},{"type":"electronic","value":"1865-1356"}],"subject":[],"published":{"date-parts":[[2009]]}}}