{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:34:51Z","timestamp":1725557691992},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540408062"},{"type":"electronic","value":"9783540452270"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45227-0_37","type":"book-chapter","created":{"date-parts":[[2010,6,22]],"date-time":"2010-06-22T19:57:53Z","timestamp":1277236673000},"page":"371-380","source":"Crossref","is-referenced-by-count":1,"title":["An Access Time Cost Model for Spatial Range Queries on Broadcast Geographical Data over Air"],"prefix":"10.1007","author":[{"given":"Jianting","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Le","family":"Gruenwald","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"37_CR1","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: SIGMOD Conference, pp. 322\u2013331 (1990)","DOI":"10.1145\/93597.98741"},{"issue":"1","key":"37_CR2","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1023\/A:1009675130545","volume":"9","author":"Y.C. Chehadeh","year":"1999","unstructured":"Chehadeh, Y.C., Hurson, A.R., Kavehrad, M.: Object Organization on a Single Broadcast Channel in the Mobile Computing Environment. Multimedia Tools and Applications\u00a09(1), 69\u201394 (1999)","journal-title":"Multimedia Tools and Applications"},{"issue":"3","key":"37_CR3","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1145\/568522.568523","volume":"34","author":"J. Da\u00edz","year":"2002","unstructured":"Da\u00edz, J., Petit, J., Serna, M.: A Survey on Graph Layout Problems. ACM Computing Surveys\u00a034(3), 313\u2013356 (2002)","journal-title":"ACM Computing Surveys"},{"issue":"2","key":"37_CR4","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1023\/A:1018992406195","volume":"9","author":"Y.D. Chung","year":"2001","unstructured":"Chung, Y.D., Kim, M.-H.: Effective Data Placement for Wireless Broadcast. Distributed and Parallel Databases\u00a09(2), 133\u2013150 (2001)","journal-title":"Distributed and Parallel Databases"},{"issue":"2","key":"37_CR5","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1145\/280277.280279","volume":"30","author":"V. Gaede","year":"1998","unstructured":"Gaede, V., G\u00fcnther, O.: Multidimensional access methods. ACM Computing Survey\u00a030(2), 170\u2013231 (1998)","journal-title":"ACM Computing Survey"},{"key":"37_CR6","doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-trees: A dynamic index structure for spatial searching. In: SIGMOD Conference, pp. 47\u201354 (1984)","DOI":"10.1145\/602259.602266"},{"key":"37_CR7","doi-asserted-by":"crossref","unstructured":"Hambrusch, S., Liu, C.-M., Aref, W., Prabhakar, S.: Query Processing in Broadcasted Spatial Index Trees. In: SSTD, pp. 502\u2013521 (2001)","DOI":"10.1007\/3-540-47724-1_26"},{"issue":"2","key":"37_CR8","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1023\/A:1018944523033","volume":"9","author":"Q. Hu","year":"2001","unstructured":"Hu, Q., Lee, W.-C., Lee, D.L.: A Hybrid Index Technique for Power Efficient Data Broadcast. Distributed and Parallel Databases\u00a09(2), 151\u2013177 (2001)","journal-title":"Distributed and Parallel Databases"},{"issue":"2","key":"37_CR9","first-page":"185","volume":"6","author":"Q. Hu","year":"2001","unstructured":"Hu, Q., Lee, W.-C., Lee, D.L.: Indexing Techniques for Power Management in Multi-Attribute Data Broadcast. MONET\u00a06(2), 185\u2013197 (2001)","journal-title":"MONET"},{"key":"37_CR10","doi-asserted-by":"crossref","unstructured":"Imielinski, T., Viswanathan, S., Badrinath, B.R.: Energy Efficient Indexing On Air. In: SIGMOD Conference, 25\u201336 (1994)","DOI":"10.1145\/191839.191846"},{"key":"37_CR11","doi-asserted-by":"crossref","unstructured":"Imielinski, T., Viswanathan, S., Badrinath, B.: Power Efficient Filtering of Data on Air. In: EDBT, pp. 245\u2013258 (1994)","DOI":"10.1007\/3-540-57818-8_55"},{"issue":"3","key":"37_CR12","doi-asserted-by":"publisher","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 Transactions on Knowledge and Data Engineering\u00a09(3), 353\u2013372 (1997)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"2","key":"37_CR13","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1145\/565117.565134","volume":"31","author":"B. K\u00f6nig-Ries","year":"2002","unstructured":"K\u00f6nig-Ries, B., et al.: Report on the NSF Workshop on Building an Infrastructure for Mobile and Wireless Systems. SIGMOD Record\u00a031(2), 73\u201379 (2002)","journal-title":"SIGMOD Record"},{"key":"37_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/3-540-36379-3_26","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"Y. Koren","year":"2002","unstructured":"Koren, Y., Harel, D.: A Multi-Scale Algorithm for the Linear Arrangement Problem. In: Ku\u010dera, L. (ed.) WG 2002. LNCS, vol.\u00a02573, pp. 293\u2013306. Springer, Heidelberg (2002)"},{"issue":"10","key":"37_CR15","doi-asserted-by":"publisher","first-page":"1237","DOI":"10.1109\/TC.2002.1039850","volume":"51","author":"G. Lee","year":"2002","unstructured":"Lee, G., Lo, S.-C., Chen, A.L.P.: Data Allocation on Wireless Broadcast Channels for Efficient Query Processing. IEEE Transactions on Computers\u00a051(10), 1237\u20131252 (2002)","journal-title":"IEEE Transactions on Computers"},{"issue":"3","key":"37_CR16","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/BF00140950","volume":"4","author":"W.-C. Lee","year":"1996","unstructured":"Lee, W.-C., Lee, D.L.: Using Signature Techniques for Information Filtering in Wireless and Mobile Environments. Distributed and Parallel Databases\u00a04(3), 205\u2013227 (1996)","journal-title":"Distributed and Parallel Databases"},{"key":"37_CR17","doi-asserted-by":"crossref","unstructured":"Pagel, B.-U., Six, H.-W., Toben, H., Widmayer, P.: Towards an Analysis of Range Query Performance in Spatial Data Structures. In: PODS 1993, pp. 214\u2013221 (1993)","DOI":"10.1145\/153850.153878"},{"key":"37_CR18","volume-title":"Spatial Databases: With Application to GIS","author":"P. Rigaux","year":"2002","unstructured":"Rigaux, P., Scholl, M.O., Voisard, A.: Spatial Databases: With Application to GIS. Academic Press, San Diego (2002)"},{"key":"37_CR19","unstructured":"Sellis, T., Roussopoulos, N., Faloutsos, C.: The R+-Tree: A Dynamic Index for Multi-Dimensional Objects. VLDB Journal, 507\u2013518 (1987)"},{"key":"37_CR20","doi-asserted-by":"crossref","unstructured":"Seydim, A.Y., Dunham, M.H., Kumar, V.: Location dependent query processing. MobiDE, 47\u201353 (2001)","DOI":"10.1145\/376868.376895"},{"key":"37_CR21","doi-asserted-by":"crossref","unstructured":"Theodoridis, Y., Sellis, T.K.: A Model for the Prediction of R-tree Performance. In: PODS, pp. 161\u2013171 (1996)","DOI":"10.1145\/237661.237705"},{"issue":"1","key":"37_CR22","first-page":"19","volume":"12","author":"Y. Theodoridis","year":"2000","unstructured":"Theodoridis, Y., Stefanakis, E., Sellis, T.K.: Efficient Cost Models for Spatial Queries Using R-Trees. TKDE\u00a012(1), 19\u201332 (2000)","journal-title":"TKDE"},{"issue":"4","key":"37_CR23","doi-asserted-by":"crossref","first-page":"1","DOI":"10.7155\/jgaa.00035","volume":"5","author":"R. Bar-Yehuda","year":"2001","unstructured":"Bar-Yehuda, R.: Computing an optimal orientation of a balanced decomposition tree for linear arrangement problems. Journal of Graph Algorithms and Applications\u00a05(4), 1\u201327 (2001)","journal-title":"Journal of Graph Algorithms and Applications"},{"key":"37_CR24","unstructured":"[HREF 1] \n                    \n                      http:\/\/www.mapinfo.com"},{"key":"37_CR25","unstructured":"[HREF 2] \n                    \n                      http:\/\/www.caam.rice.edu\/~dougm\/twiddle\/Hilbert\/"},{"key":"37_CR26","unstructured":"[HREF 3] \n                    \n                      http:\/\/www.cs.ucr.edu\/~marioh\/rtree\/index.html"}],"container-title":["Lecture Notes in Computer Science","Database and Expert Systems Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45227-0_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,14]],"date-time":"2019-03-14T22:41:35Z","timestamp":1552603295000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45227-0_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540408062","9783540452270"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45227-0_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}