{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:47:38Z","timestamp":1725511658843},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540788485"},{"type":"electronic","value":"9783540788492"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-78849-2_44","type":"book-chapter","created":{"date-parts":[[2008,4,28]],"date-time":"2008-04-28T13:49:01Z","timestamp":1209390541000},"page":"438-449","source":"Crossref","is-referenced-by-count":1,"title":["Squeezing Long Sequence Data for Efficient Similarity Search"],"prefix":"10.1007","author":[{"given":"Guojie","family":"Song","sequence":"first","affiliation":[]},{"given":"Bin","family":"Cui","sequence":"additional","affiliation":[]},{"given":"Baihua","family":"Zheng","sequence":"additional","affiliation":[]},{"given":"Kunqing","family":"Xie","sequence":"additional","affiliation":[]},{"given":"Dongqing","family":"Yang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"44_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/3-540-46439-5_4","volume-title":"Advances in Database Technology - EDBT 2000","author":"C. Traina","year":"2000","unstructured":"Traina, C., Traina, A.J.M., Seeger, B., Faloutsos, C.: Slim-Trees: High Performance Metric Trees Minimizing Overlap Between Nodes. In: Zaniolo, C., Grust, T., Scholl, M.H., Lockemann, P.C. (eds.) EDBT 2000. LNCS, vol.\u00a01777, pp. 51\u201365. Springer, Heidelberg (2000)"},{"key":"44_CR2","doi-asserted-by":"crossref","unstructured":"Faloutsos, C., Lin, K.I.: Fast Map: A fast algorithm for indexing, data mining and visualization of traditional and multimedia datasets. In: Proc. of the International Conference on Management of Data (SIGMOD 1995), pp. 163\u2013174 (1995)","DOI":"10.1145\/568271.223812"},{"key":"44_CR3","unstructured":"Cormode, G., Muthukrishnan, S.: The string edit distance matching problem with moves. In: Proc. of the 13th annual ACM-SIAM symposium on Discrete Algorithms, pp. 667\u2013676 (2002)"},{"issue":"2","key":"44_CR4","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 \u2009+\u2009-tree based indexing method for nearest neighbor search. ACM Trans. on Data Base Systems\u00a030(2), 364\u2013397 (2005)","journal-title":"ACM Trans. on Data Base Systems"},{"key":"44_CR5","unstructured":"Venkateswaran, J., Lachwani, D., Kahveci, T., Jermaine, C.M.: Reference-based Indexing of Sequence Databases. In: Proc. 24th VLDB Conference (VLDB 2006), pp. 906\u2013917 (2006)"},{"key":"44_CR6","unstructured":"Vieira, M.R., Traina, C., Chino, F.J.T., Traina, A.J.M.: DBM-Tree: A Dynamic Metric Access Method Sensitive to Local Density Data. In: Simposio Brasileiro de Bancos de Dados (SBBD 2004), pp. 163\u2013177 (2004)"},{"key":"44_CR7","unstructured":"Ciaccia, P., Patella, M., Zezula, P.: M-tree: An efficient access method for similarity search in metric spaces. In: Proc. 24th VLDB Conference (VLDB 1997), pp. 194\u2013205 (1997)"},{"key":"44_CR8","doi-asserted-by":"crossref","unstructured":"Weiner, P.: Linear Pattern Matching Algorithms. In: IEEE Symposium on Switching and Automata Theory, pp. 1\u201311 (1973)","DOI":"10.1109\/SWAT.1973.13"},{"key":"44_CR9","doi-asserted-by":"crossref","unstructured":"Filho, R.F.S., Traina, A.J.M., Traina, C., Faloutsos, C.: Similarity Search without Tears: The OMNI Family of All-purpose Access Methods. In: Roberto, F. (ed.) Proc, of the 19th International Conference on Data Engineering (ICDE 2001), pp. 623\u2013630 (2001)","DOI":"10.1109\/ICDE.2001.914877"},{"key":"44_CR10","doi-asserted-by":"crossref","unstructured":"Wang, T.L., Wang, X., Lin, K.I., Shasha, D., Shapiro, B., Zhang, K.: Evaluating a class of distance-mapping algorithms for data mining and clustering. In: Proc. of the 5th ACM International Conference of Knowledge Discovery and Data Mining (SIGKDD 1999), pp. 307\u2013311 (1999)","DOI":"10.1145\/312129.312264"},{"key":"44_CR11","unstructured":"http:\/\/www-db.stanford.edu\/pleiades\/SUMATRA.html"},{"key":"44_CR12","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1089\/10665270050081478","volume":"7","author":"Z. Zhang","year":"2000","unstructured":"Zhang, Z., Schwartz, S., Wagner, L., Miller, W.: A greedy algorithm for aligning DNA sequences. J. Comput. Biol.\u00a07, 203\u2013214 (2000)","journal-title":"J. Comput. Biol."},{"key":"44_CR13","doi-asserted-by":"crossref","unstructured":"Sahinalp, S.C., Tasan, M., Macker, J., Ozsoyoglu, Z.M.: Distance-Based Indexing for String Proximity Search. In: Proceeding of the 19th International Conference on Data Engineering (ICDE 2003), Bangalore, India, March 2003, pp. 125\u2013136 (2003)","DOI":"10.1109\/ICDE.2003.1260787"}],"container-title":["Lecture Notes in Computer Science","Progress in WWW Research and Development"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-78849-2_44.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:02:26Z","timestamp":1619521346000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78849-2_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540788485","9783540788492"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78849-2_44","relation":{},"subject":[]}}