{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:07:30Z","timestamp":1725487650641},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540441236"},{"type":"electronic","value":"9783540461456"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-46145-0_14","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T16:20:28Z","timestamp":1184602828000},"page":"135-149","source":"Crossref","is-referenced-by-count":5,"title":["Optimal Dimension Order: A Generic Technique for the Similarity Join"],"prefix":"10.1007","author":[{"given":"Christian","family":"B\u00f6hm","sequence":"first","affiliation":[]},{"given":"Florian","family":"Krebs","sequence":"additional","affiliation":[]},{"given":"Hans-Peter","family":"Kriegel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,9,2]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Ankerst M., Breunig M.M., Kriegel H.-P., Sander J.: OPTICS: Ordering Points To Identify the Clustering Structure, ACM SIGMOD Int. Conf. on Management of Data, 1999.","DOI":"10.1145\/304182.304187"},{"key":"14_CR2","unstructured":"Agrawal R., Lin K., Sawhney H., Shim K.: Fast Similarity Search in the Presence of Noise, Scaling, and Translation in Time-Series Databases, Int. Conf. on Very Large Data Bases (VLDB), 1995."},{"key":"14_CR3","unstructured":"Arge L., Procopiuc O., Ramaswamy S., Suel T., Vitter J.S.: Scalable Sweeping-Based Spatial Join, Int. Conf. on Very Large Databases (VLDB), 1998."},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"B\u00f6hm C., Braunm\u00fcller B., Breunig M.M., Kriegel H.-P.: Fast Clustering Based on High-Dimensional Similarity Joins, Int. Conf. on Information Knowledge Management (CIKM), 2000.","DOI":"10.1145\/354756.354832"},{"key":"14_CR5","unstructured":"Berchtold S., B\u00f6hm C., Jagadish H.V., Kriegel H.-P., Sander J.: Independent Quantization: An Index Compression Technique for High Dimensional Spaces, IEEE Int. Conf. on Data Engineering (ICDE), 2000."},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Berchtold S., B\u00f6hm C., Keim D., Kriegel H.-P.: A Cost Model For Neurest Neighbor Search in High-Dimensional Data Space, ACM Symposium on Principles of Database Systems (PODS), 1997.","DOI":"10.1145\/263661.263671"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"B\u00f6hm C., Braunm\u00fcller B., Krebs F., Kriegel H.-P.: Epsilon Grid Order: An Algorithm for the Similarity Join on Massive High-Dimensional Data, ACM SIGMOD Int. Conf. on Management of Data, 2001.","DOI":"10.1145\/375663.375714"},{"key":"14_CR8","unstructured":"B\u00f6hm C., Kriegel H.-P.: A Cost Model und Index Architecture for the Similarity Join, IEEE Int. Conf. on Data Engineering (ICDE), 2001."},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Brinkho. T., Kriegel H.-P., Seeger B.: Efficient Processing of Spatial Joins Using R-trees, ACM SIGMOD Int. Conf. on Management of Data, 1993.","DOI":"10.1145\/170035.170075"},{"key":"14_CR10","unstructured":"Brinkho. T., Kriegel H.-P., Seeger B.: Parallel Processing of Spatial Joins Sing R-trees, IEEE Int. Conf. on Data Engineering (ICDE), 1996."},{"key":"14_CR11","unstructured":"Huang Y.-W., Jing N., Rundensteiner E. A.: Spatial Joins Using R-trees: Breadth-First Traversal with Global Optimizations, Int. Conf. on Very Large Databases (VLDB), 1997."},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Koudas N., Sevcik C.: Size Separation Spatial Join, ACM SIGMOD Int. Conf. on Managern. of Data, 1997.","DOI":"10.1145\/253260.253340"},{"key":"14_CR13","unstructured":"Koudas N., Sevcik C.: High Dimensional Similarity Joins: Algorithms and Performance Evaluation, IEEE Int. Conf. on Data Engineering (ICDE), Best Paper Award, 1998."},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Lo M.-L., Ravishankar C.V.: Spatial Joins Using Seeded Trees, ACM SIGMOD Int. Conf., 1994.","DOI":"10.1145\/191839.191881"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"Lo M.-L., Ravishankar C.V.: Spatial Hash Joins, ACM SIGMOD Int. Conf, 1996.","DOI":"10.1145\/233269.233337"},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"Patel J.M., DeWitt D.J., Partition Based Spatial-Merge Join, ACM SIGMOD Int. Conf., 1996.","DOI":"10.1145\/233269.233338"},{"key":"14_CR17","volume-title":"Proximity: Fundamental Algorithms","author":"F.P. Preparata","year":"1985","unstructured":"Preparata F.P., Shamos M.I.: \u2018Computational Geometry\u2019, Chapter 5 (\u2018Proximity: Fundamental Algorithms\u2019), Springer Verlag New York, 1985."},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"Sander J., Ester M., Kriegel H.-P., Xu X.: Density-Based Clustering in Spatial Databases: The Algorithm GDBSCAN and its Applications, Data Mining and Knowledge Discovery, Vol. 2, No. 2, 1998.","DOI":"10.1023\/A:1009745219419"},{"key":"14_CR19","unstructured":"Shim K., Srikant R., Agrawal R.: High-Dimensional Similarity Joins, Int. Conf. on Data Engineering, 1997."},{"key":"14_CR20","volume-title":"Database and Knowledge-Base Systems","author":"J.D. Ullman","year":"1989","unstructured":"Ullman J.D.: Database and Knowledge-Base Systems, Vol. II, Computer Science Press, Rockville MD, 1989"}],"container-title":["Lecture Notes in Computer Science","Data Warehousing and Knowledge Discovery"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46145-0_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T03:29:54Z","timestamp":1556681394000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46145-0_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540441236","9783540461456"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-46145-0_14","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}