{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:50:10Z","timestamp":1725573010712},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540253341"},{"type":"electronic","value":"9783540320050"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11408079_58","type":"book-chapter","created":{"date-parts":[[2010,12,20]],"date-time":"2010-12-20T20:38:10Z","timestamp":1292877490000},"page":"625-636","source":"Crossref","is-referenced-by-count":4,"title":["A Spatial Index Using MBR Compression and Hashing Technique for Mobile Map Service"],"prefix":"10.1007","author":[{"given":"Jin-Deog","family":"Kim","sequence":"first","affiliation":[]},{"given":"Sang-Ho","family":"Moon","sequence":"additional","affiliation":[]},{"given":"Jin-Oh","family":"Choi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"58_CR1","doi-asserted-by":"crossref","unstructured":"Beckmann, N., Kriegel, H.P., Schneider, R., Seeger, B.: R*-tree: An Efficient and Robust Access Method for Points and Rectangles. In: Int. Conf. on ACM SIGMOD, pp. 322\u2013331 (1990)","DOI":"10.1145\/93605.98741"},{"key":"58_CR2","doi-asserted-by":"crossref","unstructured":"Hoel, E.G., Samet, H.: A Qualitative Study of Data Structures for Large Line Segment Databases. In: Int. Conf. on ACM SIGMOD, pp. 205\u2013214 (1992)","DOI":"10.1145\/130283.130316"},{"key":"58_CR3","doi-asserted-by":"crossref","unstructured":"Kim, K.H., Cha, S.K., Kwon, K.J.: Optimizing multidimensional index trees for main memory access. In: Int. Conf. on ACM SIGMOD (2001)","DOI":"10.1145\/375663.375679"},{"key":"58_CR4","doi-asserted-by":"crossref","unstructured":"Lehman, T.J., Carey, M.J.: A Study of index structures for main memory database management system. In: Int. Conf. on VLDB, pp. 294\u2013303 (1986)","DOI":"10.1145\/16894.16878"},{"issue":"3","key":"58_CR5","first-page":"16","volume":"16","author":"H. Lu","year":"1993","unstructured":"Lu, H., Ooi, B.C.: Spatial Indexing: Past and Future. IEEE Data Engineering Bulletin\u00a016(3), 16\u201321 (1993)","journal-title":"IEEE Data Engineering Bulletin"},{"key":"58_CR6","unstructured":"Rao, J., Ross, K.A.: Cache conscious indexing for decision-support in main memory. In: Int. Conf. on VLDB, pp. 78\u201389 (1999)"},{"key":"58_CR7","doi-asserted-by":"crossref","unstructured":"Rao, J., Ross, K.A.: Making B+-trees cache conscious in main memory. In: Int. Conf. on ACM SIGMOD, pp. 475\u2013486 (2000)","DOI":"10.1145\/335191.335449"},{"key":"58_CR8","unstructured":"Shatdal, A., Kant, C., Naughton, J.F.: Cache conscious algorithms for relational query processing. In: Int. Conf. on VLDB, pp. 510\u2013521 (1994)"},{"key":"58_CR9","doi-asserted-by":"crossref","unstructured":"Stonebraker, M., Frew, J., Gardels, K., Meredith, J.: The SEQUOIA 2000 Storage Benchmark. In: Int. Conf. on ACM SIGMOD, pp. 2\u201311 (1993)","DOI":"10.1145\/170036.170038"},{"key":"58_CR10","unstructured":"Whang, K.Y., Krishnamurthy, R.: The Multilevel Grid Files \u2013 a Dynamic Hierarchical Multidimensional File Structure. In: Int. Conf. on Database Systems for Advanced Applications, pp. 449\u2013459 (1991)"},{"key":"58_CR11","doi-asserted-by":"crossref","unstructured":"Shekhar, S., Huang, Y., Djugash, J.: Dictionary Design Algorithms for Vector Map Compression. In: Proc. of Data Compression Conf., p. 471 (2002)","DOI":"10.1109\/DCC.2002.1000014"},{"key":"58_CR12","doi-asserted-by":"crossref","unstructured":"Shekhar, S., Huang, Y., Djugash, J., Zhou, C.: Vector Map Compression: A Clustering Approach. In: ACM Int. Symposium on Advances in GIS, pp. 74\u201380 (2002)","DOI":"10.1145\/585147.585164"},{"issue":"2","key":"58_CR13","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1109\/18.119686","volume":"38","author":"P.W. Wong","year":"1992","unstructured":"Wong, P.W., Koplowitz, J.: Chain Codes and Their Linear Reconstruction Filters. IEEE Trans. On Information Theory\u00a038(2), 268\u2013280 (1992)","journal-title":"IEEE Trans. On Information Theory"},{"key":"58_CR14","doi-asserted-by":"crossref","unstructured":"Zhou, X., Abel, D.J.: David Truffet: Data Partitioning for Parallel Spatial Join Processing. In: Int. Conf. on SSD, pp. 178\u2013196 (1997)","DOI":"10.1007\/3-540-63238-7_30"},{"key":"58_CR15","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/s00778-002-0066-9","volume":"11","author":"Y. Sakurai","year":"2002","unstructured":"Sakurai, Y., Yoshikawa, M., Uemura, S., Kojima, H.: Spatial indexing of high-dimensional data based on relative approximation. VLDB J.\u00a011, 93\u2013108 (2002)","journal-title":"VLDB J."}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11408079_58.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,16]],"date-time":"2021-11-16T00:01:04Z","timestamp":1637020864000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11408079_58"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540253341","9783540320050"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11408079_58","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}