{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:13:14Z","timestamp":1725574394947},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540405351"},{"type":"electronic","value":"9783540450726"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45072-6_13","type":"book-chapter","created":{"date-parts":[[2011,1,8]],"date-time":"2011-01-08T13:23:33Z","timestamp":1294493013000},"page":"214-232","source":"Crossref","is-referenced-by-count":3,"title":["Accessing Scientific Data: Simpler is Better"],"prefix":"10.1007","author":[{"given":"Mirek","family":"Riedewald","sequence":"first","affiliation":[]},{"given":"Divyakant","family":"Agrawal","sequence":"additional","affiliation":[]},{"given":"Amr","family":"El Abbadi","sequence":"additional","affiliation":[]},{"given":"Flip","family":"Korn","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"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: Proc. ACM SIGMOD Int. Conf. on Management of Data, pp. 322\u2013331 (1990)","key":"13_CR1","DOI":"10.1145\/93597.98741"},{"key":"13_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/BFb0100987","volume-title":"Advances in Database Technology - EDBT \u201998","author":"S. Berchtold","year":"1998","unstructured":"Berchtold, S., B\u00f6hm, C., Kriegel, H.-P.: Improving the query performance of high-dimensional index structures by bulk-load operations. In: Schek, H.-J., Saltor, F., Ramos, I., Alonso, G. (eds.) EDBT 1998. LNCS, vol.\u00a01377, pp. 216\u2013230. Springer, Heidelberg (1998)"},{"unstructured":"Berchtold, S., Keim, D.A., Kriegel, H.-P.: The X-tree: An index structure for high-dimensional data. In: Proc. Int. Conf. on Very Large Databases (VLDB), pp. 28\u201339 (1996)","key":"13_CR3"},{"issue":"4","key":"13_CR4","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1145\/306101.306137","volume":"27","author":"P.A. Bernstein","year":"1998","unstructured":"Bernstein, P.A., et al.: The Asilomar report on database research. SIGMOD Record\u00a027(4), 74\u201380 (1998)","journal-title":"SIGMOD Record"},{"key":"13_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/3-540-46439-5_3","volume-title":"Advances in Database Technology - EDBT 2000","author":"C. B\u00f6hm","year":"2000","unstructured":"B\u00f6hm, C., Kriegel, H.-P.: Dynamically optimizing high-dimensional index structures. In: Zaniolo, C., Grust, T., Scholl, M.H., Lockemann, P.C. (eds.) EDBT 2000. LNCS, vol.\u00a01777, pp. 36\u201350. Springer, Heidelberg (2000)"},{"issue":"3","key":"13_CR6","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1137\/0217026","volume":"17","author":"B. Chazelle","year":"1988","unstructured":"Chazelle, B.: A functional approach to data structures and its use in multidimensional searching. SIAM Journal on Computing\u00a017(3), 427\u2013462 (1988)","journal-title":"SIAM Journal on Computing"},{"unstructured":"Winter Corporation. Database scalability program (2001), http:\/\/www.wintercorp.com","key":"13_CR7"},{"issue":"2","key":"13_CR8","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 Surveys\u00a030(2), 170\u2013231 (1998)","journal-title":"ACM Computing Surveys"},{"unstructured":"Ganger, G.R., Worthington, B.L., Patt, Y.N.: The DiskSim Simulation Environment Version 2.0 Reference Manual (1999)","key":"13_CR9"},{"doi-asserted-by":"crossref","unstructured":"Gray, J., Chaudhuri, S., Bosworth, A., Layman, A., Reichart, D., Venkatrao, M., Pellow, F., Pirahesh, H.: Data cube: A relational aggregation operator generalizing group-by, cross-tab, and sub-totals. Data Mining and Knowledge Discovery, 29\u201353 (1997)","key":"13_CR10","DOI":"10.1023\/A:1009726021843"},{"doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-trees: A dynamic index structure for spatial searching. In: Proc. ACM SIGMOD Int. Conf. on Management of Data, pp. 47\u201357 (1984)","key":"13_CR11","DOI":"10.1145\/602259.602266"},{"doi-asserted-by":"crossref","unstructured":"Hahn, C.J., Warren, S.G., London, J.: Edited synoptic cloud reports fromsh ips and land stations over the globe (1982-1991), http:\/\/cdiac.esd.ornl.gov\/ftp\/ndp026b (1996)","key":"13_CR12","DOI":"10.3334\/CDIAC\/cli.ndp026b"},{"doi-asserted-by":"crossref","unstructured":"Jagadish, H.V., Lakshmanan, L.V.S., Srivastava, D.: Snakes and sandwiches: Optimal clustering strategies for a data warehouse. In: Proc. ACM SIGMOD Int. Conf. on Management of Data, pp. 37\u201348 (1999)","key":"13_CR13","DOI":"10.1145\/304182.304186"},{"doi-asserted-by":"crossref","unstructured":"Kotidis, Y., Roussopoulos, N.: An alternative storage organization for ROLAP aggregate views based on cubetrees. In: Proc. ACM SIGMOD Int. Conf. on Management of Data, pp. 249\u2013258 (1998)","key":"13_CR14","DOI":"10.1145\/276304.276327"},{"doi-asserted-by":"crossref","unstructured":"Lang, C.A., Singh, A.K.: Modeling high-dimensional index structures using sampling. In: Proc. ACM SIGMOD Int. Conf. on Management of Data, pp. 389\u2013400 (2001)","key":"13_CR15","DOI":"10.1145\/375663.375716"},{"doi-asserted-by":"crossref","unstructured":"Lazaridis, I., Mehrotra, S.: Progressive approximate aggregate queries with a multi-resolution tree structure. In: Proc. ACM SIGMOD Int. Conf. on Management of Data, pp. 401\u2013412 (2001)","key":"13_CR16","DOI":"10.1145\/375663.375718"},{"doi-asserted-by":"crossref","unstructured":"Pagel, B.-U., Korn, F., Faloutsos, C.: Deflating the dimensionality curse using multiple fractal dimensions. In: Proc. Int. Conf. on Data Engineering (ICDE), pp. 589\u2013598 (2000)","key":"13_CR17","DOI":"10.1109\/ICDE.2000.839457"},{"unstructured":"Poosala, V., Ioannidis, Y.E.: Selectivity estimation without the attribute value independence assumption. In: Proc. Int. Conf. on Very Large Databases (VLDB), pp. 486\u2013495 (1997)","key":"13_CR18"},{"doi-asserted-by":"crossref","unstructured":"Proietti, G., Faloutsos, C.: I\/O complexity for range queries on region data stored using an R-tree. In: Proc. Int. Conf. on Data Engineering (ICDE), pp. 628\u2013635 (1999)","key":"13_CR19","DOI":"10.1109\/ICDE.1999.754979"},{"doi-asserted-by":"crossref","unstructured":"Riedewald, M., Agrawal, D., El Abbadi, A.: pCube: Update-efficient online aggregation with progressive feedback and error bounds. In: Proc. Int. Conf. on Scientific and Statistical Database Management (SSDBM), pp. 95\u2013108 (2000)","key":"13_CR20","DOI":"10.1109\/SSDM.2000.869781"},{"doi-asserted-by":"crossref","unstructured":"Riedewald, M., Agrawal, D., El Abbadi, A.: Efficient integration and aggregation of historical information. In: Proc. ACM SIGMOD Int. Conf. on Management of Data, pp. 13\u201324 (2002)","key":"13_CR21","DOI":"10.1145\/564691.564694"},{"doi-asserted-by":"crossref","unstructured":"Roussopoulos, N., Kotidis, Y., Roussopoulos, M.: Cubetree: Organization of and bulk updates on the data cube. In: Proc. ACM SIGMOD Int. Conf. on Management of Data, pp. 89\u201399 (1997)","key":"13_CR22","DOI":"10.1145\/253260.253276"},{"issue":"3","key":"13_CR23","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1109\/2.268881","volume":"27","author":"C. Ruemmler","year":"1994","unstructured":"Ruemmler, C., Wilkes, J.: An introduction to disk drive modeling. IEEE Computer\u00a027(3), 17\u201328 (1994)","journal-title":"IEEE Computer"},{"issue":"5","key":"13_CR24","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"},{"unstructured":"Seeger, B., Larson, P.-A., McFayden, R.: Reading a set of disk pages. In: Proc. Int. Conf. on Very Large Databases (VLDB), pp. 592\u2013603 (1993)","key":"13_CR25"},{"unstructured":"Shukla, A., Deshpande, P., Naughton, J.F., Ramasamy, K.: Storage estimation for multidimensional aggregates in the presence of hierarchies. In: Proc. Int. Conf. on Very Large Databases (VLDB), pp. 522\u2013531 (1996)","key":"13_CR26"},{"doi-asserted-by":"crossref","unstructured":"Tao, Y., Papadias, D.: Adaptive index structures. In: Proc. Int. Conf. on Very Large Databases (VLDB), pp. 418\u2013429 (2002)","key":"13_CR27","DOI":"10.1016\/B978-155860869-6\/50044-5"},{"unstructured":"Tao, Y., Papadias, D., Zhang, J.: Cost models for overlapping and multi-version structures. In: Proc. Int. Conf. on Data Engineering (ICDE), pp. 191\u2013200 (2002)","key":"13_CR28"},{"doi-asserted-by":"crossref","unstructured":"Theodoridis, Y., Sellis, T.K.: A model for the prediction of R-tree performance. In: Proc. Symp. on Principles of Database Systems (PODS), pp. 161\u2013171 (1996)","key":"13_CR29","DOI":"10.1145\/237661.237705"},{"issue":"3","key":"13_CR30","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1147\/rd.443.0311","volume":"44","author":"D.A. Thompson","year":"2000","unstructured":"Thompson, D.A., Best, J.S.: The future of magnetic data storage technology. IBM Journal of Research and Development\u00a044(3), 311\u2013322 (2000)","journal-title":"IBM Journal of Research and Development"},{"unstructured":"Transaction Processing Performance Council. TPC benchmarks, http:\/\/www.tpc.org","key":"13_CR31"},{"unstructured":"Weber, R., Schek, H.-J., Blott, S.: A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In: Proc. Int. Conf. on Very Large Databases (VLDB), pp. 194\u2013205 (1998)","key":"13_CR32"}],"container-title":["Lecture Notes in Computer Science","Advances in Spatial and Temporal Databases"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45072-6_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T18:18:52Z","timestamp":1559931532000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45072-6_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405351","9783540450726"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45072-6_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}