{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T16:54:26Z","timestamp":1759683266466},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540297406"},{"type":"electronic","value":"9783540322412"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11575832_12","type":"book-chapter","created":{"date-parts":[[2005,10,13]],"date-time":"2005-10-13T14:12:50Z","timestamp":1129212770000},"page":"103-114","source":"Crossref","is-referenced-by-count":17,"title":["Measuring the Difficulty of Distance-Based Indexing"],"prefix":"10.1007","author":[{"given":"Matthew","family":"Skala","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","unstructured":"Arnold, B.C., Balakrishnan, N., Nagaraja, H.N.: A First Course in Order Statistics. Wiley series in probability and mathematical statistics. John Wiley & Sons, Inc., New York (1992)"},{"key":"12_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1007\/3-540-58094-8_18","volume-title":"Combinatorial Pattern Matching","author":"R.A. Baeza-Yates","year":"1994","unstructured":"Baeza-Yates, R.A., Cunto, W., Manber, U., Wu, S.: Proximity matching using fixed-queries trees. In: Crochemore, M., Gusfield, D. (eds.) CPM 1994. LNCS, vol.\u00a0807, pp. 198\u2013212. Springer, Heidelberg (1994)"},{"key":"12_CR3","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: SIGMOD (International Conference on Management of Data), pp. 322\u2013331 (1990)","DOI":"10.1145\/93605.98741"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Berchtold, S., B\u00f6hm, C., Kriegel, H.P.: The pyramid-tree: Breaking the curse of dimensionality. In: SIGMOD (International Conference on Management of Data), pp. 142\u2013153 (1998)","DOI":"10.1145\/276305.276318"},{"key":"12_CR5","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1145\/328939.328959","volume":"24","author":"T. Bozkaya","year":"1999","unstructured":"Bozkaya, T., Ozsoyoglu, M.: Indexing large metric spaces for similarity search queries. ACM Transactions on Database Systems\u00a024, 361\u2013404 (1999)","journal-title":"ACM Transactions on Database Systems"},{"key":"12_CR6","unstructured":"Ch\u00e1vez, E., Navarro, G.: Measuring the dimensionality of general metric spaces. Technical Report TR\/DCC-00-1, Department of Computer Science, University of Chile (2000), Submitted, Online, ftp:\/\/ftp.dcc.uchile.cl\/pub\/users\/gnavarro\/metricmodel.ps.gz"},{"key":"12_CR7","unstructured":"Damiani, E., De Capitani di Vimercati, S., Paraboschi, S., Samarai, P.: An open digest-based technique for spam detection. In: 2004 International Workshop on Security in Parallel and Distributed Systems, San Francisco, CA, USA (2004)"},{"key":"12_CR8","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1017\/S0305004100015681","volume":"24","author":"R.A. Fisher","year":"1928","unstructured":"Fisher, R.A., Tippett, L.H.C.: Limiting forms of the frequency distribution of the largest or smallest member of a sample. Proceedings of the Cambridge Philosophical Society\u00a024, 180\u2013190 (1928)","journal-title":"Proceedings of the Cambridge Philosophical Society"},{"key":"12_CR9","volume-title":"The Asymptotic Theory of Extreme Order Statistics","author":"J. Galambos","year":"1987","unstructured":"Galambos, J.: The Asymptotic Theory of Extreme Order Statistics, 2nd edn. Robert E. Krieger Publishing Company, Malabar (1987)","edition":"2"},{"key":"12_CR10","doi-asserted-by":"publisher","first-page":"875","DOI":"10.1016\/0306-4573(94)90014-0","volume":"30","author":"S. Grumbach","year":"1994","unstructured":"Grumbach, S., Tahi, F.: A new challenge for compression algorithms: Genetic sequences. Journal of Information Processing and Management\u00a030, 875\u2013886 (1994)","journal-title":"Journal of Information Processing and Management"},{"key":"12_CR11","first-page":"47","volume":"14","author":"A. Guttman","year":"1984","unstructured":"Guttman, A.: R-trees: a dynamic index structure for spatial searching. SIGMOD Record (ACM Special Interest Group on Management of Data)\u00a014, 47\u201357 (1984)","journal-title":"SIGMOD Record (ACM Special Interest Group on Management of Data)"},{"key":"12_CR12","doi-asserted-by":"publisher","first-page":"433","DOI":"10.2307\/3212912","volume":"16","author":"P. Hall","year":"1979","unstructured":"Hall, P.: On the rate of convergence of normal extremes. Journal of Applied Probability\u00a016, 433\u2013439 (1979)","journal-title":"Journal of Applied Probability"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Katayama, N., Satoh, S.: The SR-tree: an index structure for high-dimensional nearest neighbor queries. In: SIGMOD (International Conference on Management of Data), pp. 369\u2013380 (1997)","DOI":"10.1145\/253260.253347"},{"key":"12_CR14","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1093\/bioinformatics\/17.2.149","volume":"17","author":"M. Li","year":"2001","unstructured":"Li, M., Badger, J.H., Xin, C., Kwong, S., Kearney, P., Zhang, H.: An information based sequence distance and its application to whole mitochondrial genome phylogeny. Bioinformatics\u00a017, 149\u2013154 (2001)","journal-title":"Bioinformatics"},{"key":"12_CR15","unstructured":"Norwood, C.: cmeclax: Digest:Nilsimsa 0.06. Computer software (2002), Online, http:\/\/search.cpan.org\/~vipul\/Digest-Nilsimsa-0.06\/"},{"key":"12_CR16","volume-title":"ICDE (International Conference on Data Engineering)","author":"S.C. Sahinalp","year":"2003","unstructured":"Sahinalp, S.C., Tasan, M., Macker, J., Ozsoyoglu, Z.M.: Distance based indexing for string proximity search. In: ICDE (International Conference on Data Engineering). IEEE Computer Society, Los Alamitos (2003)"},{"key":"12_CR17","first-page":"507","volume-title":"VLDB 1987 (International Conference on Very Large Data Bases)","author":"T.K. Sellis","year":"1987","unstructured":"Sellis, T.K., Roussopoulos, N., Faloutsos, C.: The R+-tree: A dynamic index for multi-dimensional objects. In: VLDB 1987 (International Conference on Very Large Data Bases), pp. 507\u2013518. Morgan Kaufmann, San Francisco (1987)"},{"key":"12_CR18","unstructured":"SpamArchive.org: Donate your spam to science. Web site (2005), Online, http:\/\/www.spamarchive.org\/"},{"key":"12_CR19","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/0020-0190(91)90074-R","volume":"40","author":"J.K. Uhlmann","year":"1991","unstructured":"Uhlmann, J.K.: Satisfying general proximity\/similarity queries with metric trees. Information Processing Letters\u00a040, 175\u2013179 (1991)","journal-title":"Information Processing Letters"},{"key":"12_CR20","first-page":"311","volume-title":"SODA (Symposium on Discrete Algorithms)","author":"P.N. Yianilos","year":"1993","unstructured":"Yianilos, P.N.: Data structures and algorithms for nearest neighbor search in general metric spaces. In: SODA (Symposium on Discrete Algorithms), pp. 311\u2013321. SIAM, Philadelphia (1993)"},{"key":"12_CR21","unstructured":"Yianilos, P.N.: Excluded middle vantage point forests for nearest neighbour search. In: Goodrich, M.T., McGeoch, C.C. (eds.) ALENEX 1999. LNCS, vol.\u00a01619. Springer, Heidelberg (1999)"}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11575832_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:58:00Z","timestamp":1605643080000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11575832_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540297406","9783540322412"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/11575832_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}