{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T09:35:18Z","timestamp":1774949718760,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540856535","type":"print"},{"value":"9783540856542","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-85654-2_7","type":"book-chapter","created":{"date-parts":[[2008,8,27]],"date-time":"2008-08-27T07:30:03Z","timestamp":1219822203000},"page":"57-64","source":"Crossref","is-referenced-by-count":3,"title":["HRG: A Graph Structure for Fast Similarity Search in Metric Spaces"],"prefix":"10.1007","author":[{"given":"Omar U.","family":"Florez","sequence":"first","affiliation":[]},{"given":"SeungJin","family":"Lim","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","unstructured":"Ciaccia, P., Patella, M., Zezula, P.: M-tree: An efficient access method for similarity search in metric spaces. In: Proceedings of the 23rd International Conference on Very Large Data Bases, San Francisco, CA, USA, pp. 426\u2013435 (1997)"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Traina, C., Traina, A., 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)","DOI":"10.1007\/3-540-46439-5_4"},{"key":"7_CR3","unstructured":"Vieira, M.R., Traina Jr., C., Chino, F.J.T., Traina, A.J.M.: Dbm-tree: A dynamic metric access method sensitive to local density data. In: Brazilian Symposium on Databases, pp. 163\u2013177 (2004)"},{"issue":"1","key":"7_CR4","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1007\/s007780200060","volume":"11","author":"G. Navarro","year":"2002","unstructured":"Navarro, G.: Searching in metric spaces by spatial approximation. The VLDB Journal\u00a011(1), 28\u201346 (2002)","journal-title":"The VLDB Journal"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Hacid, H., Yoshida, T.: Incremental neighborhood graphs construction for multidimensional databases indexing. In: Advances in Artificial Intelligence, pp. 405\u2013416 (2007)","DOI":"10.1007\/978-3-540-72665-4_35"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Hacid, H., Zighed, A.D.: An effective method for locally neighborhood graphs updating. In: Database and Expert Systems Applications, pp. 930\u2013939 (2005)","DOI":"10.1007\/11546924_91"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Zhao, D., Yang, L.: Incremental construction of neighborhood graphs for nonlinear dimensionality reduction. In: Proceedings of the 18th International Conference on Pattern Recognition, pp. 177\u2013180 (2006)","DOI":"10.1109\/ICPR.2006.707"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Lee, C., Kim, D., Shin, H., Kim, D.-S.: Efficient computation of elliptic gabriel graph. In: International Conference on Computational Science and Applications, pp. 440\u2013448 (2006)","DOI":"10.1007\/11751540_47"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Jaromczyk, J., Toussaint, G.: Relative neighborhood graphs and their relatives. In: Proceedings of IEEE, vol.\u00a080, pp. 1502\u20131517 (1992)","DOI":"10.1109\/5.163414"}],"container-title":["Lecture Notes in Computer Science","Database and Expert Systems Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85654-2_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T17:50:54Z","timestamp":1738345854000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85654-2_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540856535","9783540856542"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85654-2_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[]}}