{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,17]],"date-time":"2026-08-17T15:27:03Z","timestamp":1786980423600,"version":"build-2736575974"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2005,7,22]],"date-time":"2005-07-22T00:00:00Z","timestamp":1121990400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2006,1]]},"DOI":"10.1007\/s00778-004-0146-0","type":"journal-article","created":{"date-parts":[[2006,6,22]],"date-time":"2006-06-22T09:51:14Z","timestamp":1150969874000},"page":"21-39","source":"Crossref","is-referenced-by-count":90,"title":["Grid-partition index: a hybrid method for nearest-neighbor queries in wireless location-based services"],"prefix":"10.1007","volume":"15","author":[{"given":"Baihua","family":"Zheng","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jianliang","family":"Xu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wang-Chien","family":"Lee","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dik Lun","family":"Lee","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,7,22]]},"reference":[{"issue":"1","key":"146_CR1","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1109\/69.842249","volume":"12","author":"S. Berchtold","year":"2000","unstructured":"Berchtold, S., Keim, D.A., Kriegel, H.P., Seidl, T.: Indexing the solution space: a new technique for nearest neighbor search in high-dimensional space. IEEE Trans. Knowl. Data Eng. 12(1), 45\u201357 (2000)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"146_CR2","volume-title":"Computational Geometry: Algorithms and Applications Chap. 7","author":"M. Berg","year":"1996","unstructured":"Berg, M., Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry: Algorithms and Applications Chap. 7. Berlin, Heidelberg, New York: Springer (1996)"},{"issue":"3","key":"146_CR3","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1145\/290593.290596","volume":"27","author":"K.L. Cheung","year":"1998","unstructured":"Cheung, K.L., Fu, W.-C.: Enhanced nearest neighbour search on the r-tree. SIGMOD Rec. 27(3), 16\u201321 (1998)","journal-title":"SIGMOD Rec."},{"key":"146_CR4","unstructured":"Ferhatosmanoglu, H., Tuncel, E., Agrawal, D., Abbadi, A.E.: Approximate nearest neighbor searching in multimedia databases. In: Proc. 17th IEEE Int. Conf. on Data Eng. (ICDE\u201901) (2001)"},{"key":"146_CR5","unstructured":"Goldstein, J., Ramakrishnan, R.: Contrast plots and p-sphere trees: Space vs. time in nearest neighbor searches. In: Proc. 26th Int. Conf. on Very Large Data Bases (VLDB\u201900), pp. 429\u2013440, Cairo, Egypt (2000)"},{"key":"146_CR6","doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-trees: a dynamic index structure for spatial searching. In: Proc. ACM SIGMOD Int. Conf. on Manage. of Data (SIGMOD\u201984), pp. 47\u201354 (1984)","DOI":"10.1145\/602259.602266"},{"key":"146_CR7","unstructured":"Hinneburg, A., Aggarwal, C.C., Keim, D.A.: What is the nearest neighbor in high dimensional spaces? In: Proc. 26th Int. Conf. on Very Large Data Bases (VLDB\u201900) (2000)"},{"issue":"2","key":"146_CR8","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1145\/320248.320255","volume":"24","author":"G\u00ed.R. Hjaltason","year":"1999","unstructured":"Hjaltason, G\u00ed.R., Samet, H.: Distance browsing in spatial databases. ACM Trans. Database Syst. 24(2), 265\u2013318 (1999)","journal-title":"ACM Trans. Database Syst."},{"key":"146_CR9","doi-asserted-by":"crossref","unstructured":"Hu, Q.L., Lee, W.-C., Lee, D.L.: Power conservative multi-attribute queries on data broadcast. In: Proc. 16th Int. Conf. on Data Eng. (ICDE\u201900), pp. 157\u2013166. San Diego (2000)","DOI":"10.1109\/ICDE.2000.839402"},{"issue":"3","key":"146_CR10","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1109\/69.599926","volume":"9","author":"T. Imielinski","year":"1997","unstructured":"Imielinski, T., Viswanathan, S., Badrinath, B.R.: Data on air: organization and access. IEEE Trans. Knowl. Data Eng. 9(3), 353\u2013372 (1997)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"146_CR11","unstructured":"Kamel, I., Faloutsos, C.: Hilbert r-tree: an improved r-tree using fractals. In: Proc. 20th Int. Conf. on Very Large Data Bases (VLDB\u201994), pp. 500\u2013509. Santiago de Chile, Chile (1994)"},{"issue":"3","key":"146_CR12","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1109\/MPRV.2002.1037724","volume":"1","author":"D.L. Lee","year":"2002","unstructured":"Lee, D.L., Lee, W.-C., Xu, J., Zheng, B.: Data management in location-dependent information services. IEEE Pervas. Comput. 1(3), 65\u201372 (2002)","journal-title":"IEEE Pervas. Comput."},{"key":"146_CR13","doi-asserted-by":"crossref","unstructured":"Leutenegger, S.T., Edgington, J.M., Lopez, M.A.: Str: a simple and efficient algorithm for r-tree packing. In: Proc. 13th Int. Conf. on Data Eng. (ICDE\u201997), pp. 497\u2013506. Birmingham, UK (1997)","DOI":"10.1109\/ICDE.1997.582015"},{"issue":"1","key":"146_CR14","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1145\/348.318586","volume":"9","author":"J. Nievergelt","year":"1984","unstructured":"Nievergelt, J., Hinterberger, H., Sevcik, K.C.: The grid file: an adaptable, symmetric multikey file structure. ACM Trans. Database Syst. 9(1), 38\u201371 (1984)","journal-title":"ACM Trans. Database Syst."},{"key":"146_CR15","doi-asserted-by":"crossref","unstructured":"Pramanik, S., Li, J.: Fast approximate search algorithm for nearest neighbor queries in high dimensions. In: Proc. 15th Int. Conf. on Data Eng. (ICDE\u201999), p. 251 (1999)","DOI":"10.1109\/ICDE.1999.754931"},{"key":"146_CR16","doi-asserted-by":"crossref","unstructured":"Roussopoulos, N., Kelley, S., Vincent, F.: Nearest neighbor queries. In: Proc. 1995 ACM SIGMOD Int. Conf. on Manage. of Data (SIGMOD\u201995), pp. 71\u201379 (1995)","DOI":"10.1145\/223784.223794"},{"key":"146_CR17","volume-title":"IT Roadmap to a Geospatial Future","author":"Computer Science and Telecommunications Board","year":"2003","unstructured":"Computer Science and Telecommunications Board. IT Roadmap to a Geospatial Future. Washington, DC: National Academies Press (2003)"},{"key":"146_CR18","unstructured":"Sistla, A.P., Wolfson, O., Chamberlain, S., Dao, S.: Modeling and querying moving objects. In: Proc. 13th Int. Conf. on Data Eng. (ICDE\u201997), pp. 422\u2013432. Birmingham, UK (1997)"},{"key":"146_CR19","doi-asserted-by":"crossref","unstructured":"Song, Z., Roussopoulos, N.: K-nearest neighbor search for moving query point. In: Proc. 7th Int. Symp. Spatial Temp. Databases (SSTD\u201901), pp. 79\u201396. Los Angeles (2001)","DOI":"10.1007\/3-540-47724-1_5"},{"issue":"4","key":"146_CR20","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1007\/BF01759061","volume":"6","author":"R.F. Sproull","year":"1991","unstructured":"Sproull, R.F.: Refinements to nearest-neighbor searching in k-dimensional trees. Algorithmica 6(4), 579\u2013589, (1991)","journal-title":"Algorithmica"},{"key":"146_CR21","doi-asserted-by":"crossref","unstructured":"Tao, Y., Papadias, D.: Time parameterized queries in spatio-temporal databases. In: Proc. 2002 ACM SIGMOD Int. Conf. on Manage. of Data (SIGMOD\u201902), pp. 334\u2013345. Madison, WI (2002)","DOI":"10.1145\/564691.564730"},{"key":"146_CR22","doi-asserted-by":"crossref","unstructured":"Tao, Y., Papadias, D., Shen, Q.: Continuous nearest neighbor search. In: Proc. 28th Int. Conf. on Very Large Data Bases (VLDB\u201902), Hong Kong (2002)","DOI":"10.1016\/B978-155860869-6\/50033-0"},{"key":"146_CR23","unstructured":"Weber, R., Blott, S.: An approximation based structure for similarity search. Technical Report 24, ESPRIT Project HERMES (No. 9141) (1997)"},{"key":"146_CR24","unstructured":"Weber, R., Schek, H., Blott, S.: A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In: Proc. 24th Int. Conf. on Very Large Data Bases (VLDB\u201998), pp. 194\u2013205. New York (1998)"},{"key":"146_CR25","doi-asserted-by":"crossref","unstructured":"Wilfong, G.T.: Nearest neighbor problems. In: Symp. on Computat. Geometry, pp. 224\u2013233 (1991)","DOI":"10.1145\/109648.109673"},{"key":"146_CR26","unstructured":"Xu, J., Zheng, B., Lee, W.-C., Lee, D.L.: Energy efficient index for querying location-dependent data in mobile broadcast environments. In: Proc. 19th IEEE Int. Conf. on Data Eng. (ICDE\u201903), pp. 239\u2013250. Bangalore, India (2003)"},{"key":"146_CR27","unstructured":"Yu, C., Ooi, B.C., Tan, K.-L., Jagadish, H.V.: Indexing the distance: an efficient method to KNN processing. Proc. 27th Int. Conf. on Very Large Data Bases (VLDB\u201901), pp. 421\u2013430. Rome (2001)"},{"key":"146_CR28","doi-asserted-by":"crossref","unstructured":"Zheng, B., Xu, J., Lee, W.C., Lee, D.L.: Energy-conserving air indexes for nearest neighbor search. In: Proc. 9th Int. Conf. on Extending Database Technol. (EDBT\u201904). Heraklion, Crete, Greece (2004)","DOI":"10.1007\/978-3-540-24741-8_5"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-004-0146-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00778-004-0146-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-004-0146-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T11:04:59Z","timestamp":1559127899000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00778-004-0146-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,7,22]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2006,1]]}},"alternative-id":["146"],"URL":"https:\/\/doi.org\/10.1007\/s00778-004-0146-0","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,7,22]]}}}