{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:02:40Z","timestamp":1725552160306},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540329602"},{"type":"electronic","value":"9783540329619"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11687238_39","type":"book-chapter","created":{"date-parts":[[2006,3,9]],"date-time":"2006-03-09T02:05:50Z","timestamp":1141869950000},"page":"645-663","source":"Crossref","is-referenced-by-count":2,"title":["Finding Data Broadness Via Generalized Nearest Neighbors"],"prefix":"10.1007","author":[{"given":"Jayendra","family":"Venkateswaran","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tamer","family":"Kahveci","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Orhan","family":"Camoglu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"39_CR1","unstructured":"Albers, S.: Competitive Online Algorithms. Technical Report LS-96-2, brics (September 1996)"},{"key":"39_CR2","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: International Conference on Management of Data (SIGMOD), pp. 322\u2013331 (1990)","DOI":"10.1145\/93597.98741"},{"key":"39_CR3","doi-asserted-by":"crossref","unstructured":"Berchtold, S., Ertl, B., Keim, D.A., Kriegel, H.-P., Seidl, T.: Fast Nearest Neighbor Search in High-dimensional Space. In: International Conference on Data Engineering (ICDE), pp. 209\u2013218 (1998)","DOI":"10.1109\/ICDE.1998.655779"},{"key":"39_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/3-540-49257-7_15","volume-title":"Database Theory - ICDT\u201999","author":"K. Beyer","year":"1998","unstructured":"Beyer, K., Goldstein, J., Ramakrishnan, R., Shaft, U.: When is nearest neighbor meaningful? In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol.\u00a01540, pp. 217\u2013235. Springer, Heidelberg (1998)"},{"key":"39_CR5","doi-asserted-by":"crossref","unstructured":"B\u00f6hm, C., Krebs, F.: The k-Nearest Neighbour Join: Turbo Charging the KDD Process. Knowledge and Information Systems (KAIS)\u00a06(6) (2004)","DOI":"10.1007\/s10115-003-0122-9"},{"issue":"1","key":"39_CR6","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1142\/S0219720004000491","volume":"2","author":"O. \u00c7amo\u011flu","year":"2004","unstructured":"\u00c7amo\u011flu, O., Kahveci, T., Singh, A.K.: Towards Index-based Similarity Search for Protein Structure Databases. Journal of Bioinformatics and Computational Biology (JBCB)\u00a02(1), 99\u2013126 (2004)","journal-title":"Journal of Bioinformatics and Computational Biology (JBCB)"},{"issue":"6","key":"39_CR7","doi-asserted-by":"publisher","first-page":"1005","DOI":"10.1109\/69.649322","volume":"9","author":"C.Y. Chan","year":"1997","unstructured":"Chan, C.Y., Ooi, B.C.: Efficient Scheduling of Page Access in Index- Based Join Processing. IEEE Transactions on Knowledge and Data Engineering (TKDE)\u00a09(6), 1005\u20131011 (1997)","journal-title":"IEEE Transactions on Knowledge and Data Engineering (TKDE)"},{"key":"39_CR8","doi-asserted-by":"crossref","unstructured":"Ding, C., Peng, H.: Minimum redundancy feature selection from microarray gene expression data. In: Computational Systems Bioinformatics Conference (CSB), pp. 523\u2013528 (2003)","DOI":"10.1109\/CSB.2003.1227396"},{"key":"39_CR9","doi-asserted-by":"crossref","unstructured":"Hjaltason, G.R., Samet, H.: Ranking in Spatial Databases. In: Symposium on Spatial Databases, Portland, Maine, August 1995, pp. 83\u201395 (1995)","DOI":"10.1007\/3-540-60159-7_6"},{"issue":"9","key":"39_CR10","doi-asserted-by":"publisher","first-page":"868","DOI":"10.1101\/gr.9.9.868","volume":"9","author":"X. Huang","year":"1999","unstructured":"Huang, X., Madan, A.: CAP3: A DNA Sequence Assembly Program. Genome Research\u00a09(9), 868\u2013877 (1999)","journal-title":"Genome Research"},{"key":"39_CR11","unstructured":"Kamel, I., Faloutsos, C.: Hilbert R-tree: An Improved R-tree using Fractals. In: International Conference on Very Large Databases (VLDB), pp. 500\u2013509 (1994)"},{"key":"39_CR12","doi-asserted-by":"crossref","unstructured":"Korn, F., Muthukrishnan, S.: Influence sets based on reverse nearest neighbor queries. In: International Conference on Management of Data (SIGMOD), pp. 201\u2013212 (2000)","DOI":"10.1145\/342009.335415"},{"key":"39_CR13","unstructured":"Korn, F., Sidiropoulos, N., Faloutsos, C., Siegel, E., Protopapas, Z.: Fast Nearest Neighbor Search in Medical Databases. In: International Conference on Very Large Databases (VLDB), India, pp. 215\u2013226 (1996)"},{"key":"39_CR14","unstructured":"Merrett, T.H., Kambayashi, Y., Yasuura, H.: Scheduling of Page-Fetches in Join Operations. In: International Conference on Very Large Databases (VLDB), pp. 488\u2013498 (1981)"},{"key":"39_CR15","doi-asserted-by":"crossref","unstructured":"Roussopoulos, N., Kelley, S., Vincent, F.: Nearest Neighbor Queries. In: International Conference on Management of Data (SIGMOD), San Jose, CA (1995)","DOI":"10.1145\/223784.223794"},{"key":"39_CR16","doi-asserted-by":"crossref","unstructured":"Leutenegger, M.L.S., Edgington, J.: STR: A Simple and Efficient Algorithm for R-Tree Packing. In: International Conference on Data Engineering (ICDE), pp. 497\u2013506 (1997)","DOI":"10.1109\/ICDE.1997.582015"},{"issue":"5","key":"39_CR17","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1016\/0306-4379(96)84498-X","volume":"21","author":"B. Seeger","year":"1996","unstructured":"Seeger, B.: An analysis of schedules for performing multi-page requests. Information Systems\u00a021(5), 387\u2013407 (1996)","journal-title":"Information Systems"},{"key":"39_CR18","doi-asserted-by":"crossref","unstructured":"Seidl, T., Kriegel, H.P.: Optimal Multi-Step k-Nearest Neighbor Search. In: International Conference on Management of Data, SIGMOD (1998)","DOI":"10.1145\/276304.276319"},{"key":"39_CR19","unstructured":"Stanoi, I., Riedewald, M., Agrawal, D., Abbadi, A.E.: Discovery of Influence Sets in Frequently Updated Databases. In: International Conference on Very Large Databases (VLDB), pp. 99\u2013108 (2001)"},{"key":"39_CR20","doi-asserted-by":"crossref","unstructured":"Tao, Y., Papadias, D., Lian, X.: Reverse kNN Search in Arbitrary Dimensionality. In: International Conference on Very Large Databases, VLDB (2004)","DOI":"10.1016\/B978-012088469-8.50066-8"},{"key":"39_CR21","doi-asserted-by":"crossref","unstructured":"Xia, C., Lu, H., Ooi, B.C., Hu, J.: GORDER: An Efficient Method for KNN Join Processing. In: International Conference on Very Large Databases, VLDB (2004)","DOI":"10.1016\/B978-012088469-8\/50067-X"},{"key":"39_CR22","doi-asserted-by":"crossref","unstructured":"Yang, C., Lin, K.-I.: An Index Structure for Efficient Reverse Nearest Neighbor Queries. In: International Conference on Data Engineering (ICDE), pp. 485\u2013492 (2001)","DOI":"10.1109\/ICDE.2001.914862"}],"container-title":["Lecture Notes in Computer Science","Advances in Database Technology - EDBT 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11687238_39.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:17:21Z","timestamp":1619493441000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11687238_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540329602","9783540329619"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/11687238_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}