{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T04:07:44Z","timestamp":1748318864609,"version":"3.41.0"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Multimedia Tools and Applications"],"published-print":{"date-parts":[[2003,1]]},"DOI":"10.1023\/a:1021121030238","type":"journal-article","created":{"date-parts":[[2003,3,21]],"date-time":"2003-03-21T00:40:25Z","timestamp":1048207225000},"page":"79-103","source":"Crossref","is-referenced-by-count":8,"title":["An Enhanced Technique for k-Nearest Neighbor Queries with Non-Spatial Selection Predicates"],"prefix":"10.1007","volume":"19","author":[{"given":"Dong-Joo","family":"Park","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hyoung-Joo","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5109257_CR1","doi-asserted-by":"crossref","unstructured":"S. Arya, D.M. Mount, N.S. Netanyahu, R. Silverman, and A.Y. Wu, \u201cAn optimal algorithm for approximate nearest neighbor searching fixed dimensions,\u201d Journal of the ACM, Vol. 45, No. 6, 1998.","DOI":"10.1145\/293347.293348"},{"key":"5109257_CR2","doi-asserted-by":"crossref","unstructured":"N. Beckmann, H.P. Kriegel, R. Schneider, and B. Seeger, \u201cThe R*a-tree: An efficient and robust access method for points and rectangles,\u201d in Proceedings of the ACM SIGMOD Conference, June 1990.","DOI":"10.1145\/93597.98741"},{"key":"5109257_CR3","doi-asserted-by":"crossref","unstructured":"S. Berchtold, C. Bohm, B. Braunmuller, D.A. Keim, and H.-P. Kriegel, \u201cFast parallel similarity search in multimedia databases,\u201d in Proceedings of the ACM SIGMOD Conference, June 1997.","DOI":"10.1145\/253262.253263"},{"key":"5109257_CR4","doi-asserted-by":"crossref","unstructured":"S. Berchtold, C. Bohm, D.A. Keim, and H.-P. Kriegel, \u201cA cost model for nearest neighbor search in highdimensional data space,\u201d in Proceedings of the 16th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, May 1997.","DOI":"10.1145\/263661.263671"},{"key":"5109257_CR5","unstructured":"S. Berchtold, B. Ertl, D.A. Keim, H.-P. Kriegel, and T. Seidl, \u201cFast nearest neighbor search in high-dimensional spaces,\u201d in Proceedings of the 14th Int'l. Conf. on Data Engineering, February 1998."},{"key":"5109257_CR6","doi-asserted-by":"crossref","unstructured":"A.J. Broder, \u201cStrategies for efficient incremental nearest neighbor search,\u201d Pattern Recognition, Vol. 23, No. 1\/2, 1990.","DOI":"10.1016\/0031-3203(90)90057-R"},{"key":"5109257_CR7","doi-asserted-by":"crossref","unstructured":"M.J. Carey and D. Kossmann, \u201cOn saying \u201cEnough Already!\u201d in SQL,\u201d in Proceedings of the ACMSIGMOD Conference, June 1997.","DOI":"10.1145\/253262.253302"},{"key":"5109257_CR8","unstructured":"M.J. Carey and D. Kossmann, \u201cReducing the braking distance of an SQL query engine,\u201d in Proceedings of 24th International Conference on Very Large Data Bases, August 1998."},{"key":"5109257_CR9","unstructured":"W.W. Chang and H.J. Schek, \u201cA signature access method for the startbust database system,\u201d in Proc. of the 15th Int'l Conference on Very Large Data Bases, August 1989."},{"key":"5109257_CR10","unstructured":"S. Chaudhuri and L. Gravano, \u201cEvaluating top-K selection queries,\u201d in Proceedings of 25th International Conference on Very Large Data Bases, September 1999."},{"key":"5109257_CR11","doi-asserted-by":"crossref","unstructured":"R. Fagin, \u201cFuzzy queries in multimedia database systems,\u201d in Proceedings of the 16th ACM SIGACTSIGMOD-SIGART Symposium on Principles of Database Systems, June 1998.","DOI":"10.1145\/275487.275488"},{"key":"5109257_CR12","doi-asserted-by":"crossref","unstructured":"C. Faloutsos and S. Christodoulakis, \u201cOptimal signature extraction and information loss,\u201d ACMTransactions on Database Systems, Vol. 12, No. 3, 1987.","DOI":"10.1145\/27629.214285"},{"key":"5109257_CR13","doi-asserted-by":"crossref","unstructured":"M. Flickner et al., \u201cQuery by image and video content: The QBIC system,\u201d IEEE Computer, Vol. 28, No. 9, 1995.","DOI":"10.1109\/2.410146"},{"key":"5109257_CR14","doi-asserted-by":"crossref","unstructured":"S. Grumbach, P. Rigaux, and L. Segoufin, \u201cThe DEDALE system for complex spatial queries,\u201d in Proceedings of the ACM SIGMOD Conference, June 1998.","DOI":"10.1145\/276304.276324"},{"key":"5109257_CR15","unstructured":"A. Henrich, \u201cA distance-scan algorithm for spatial access structures,\u201d in Proceedings of the Second ACM Workshop on Geographic Information Systems, December 1994."}],"container-title":["Multimedia Tools and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1021121030238.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1021121030238\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1021121030238.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,26]],"date-time":"2025-05-26T06:31:57Z","timestamp":1748241117000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1021121030238"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,1]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,1]]}},"alternative-id":["5109257"],"URL":"https:\/\/doi.org\/10.1023\/a:1021121030238","relation":{},"ISSN":["1380-7501","1573-7721"],"issn-type":[{"type":"print","value":"1380-7501"},{"type":"electronic","value":"1573-7721"}],"subject":[],"published":{"date-parts":[[2003,1]]}}}