{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:04:31Z","timestamp":1725573871438},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540210474"},{"type":"electronic","value":"9783540245711"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24571-1_3","type":"book-chapter","created":{"date-parts":[[2011,1,7]],"date-time":"2011-01-07T10:32:42Z","timestamp":1294396362000},"page":"39-51","source":"Crossref","is-referenced-by-count":1,"title":["Index Clustering for High-Performance Sequential Index Access"],"prefix":"10.1007","author":[{"given":"Guang-Ho","family":"Cha","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Beckmann, N., et al.: The R*-tree: An efficient and robust access method for points and rectangles. In: Proc. of ACM SIGMOD Conference, pp. 322\u2013331 (1990)","DOI":"10.1145\/93597.98741"},{"key":"3_CR2","unstructured":"Berchtold, S., Keim, D.A., Kriegel, H.-P.: The X-tree: An Index Structure for High- Dimensional Data. In: Proc. of the VLDB Conference, pp. 28\u201339 (1996)"},{"key":"3_CR3","unstructured":"Bercken, J.V.D., Seeger, B., Widmayer, P.: A Generic Approach to Bulk Loading Multidimensional Index Structures. In: Proc. of the VLDB Conference, pp. 406\u2013415 (1997)"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Faloutsos, C., Kamel, I.: Beyond Uniformity and Independence: Analysis of R-trees Using the Concept of Fractal Dimension. In: Proc. of ACM PODS, pp. 4\u201313 (1994)","DOI":"10.1145\/182591.182593"},{"key":"3_CR5","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1109\/2.410146","volume":"28","author":"M. Flickner","year":"1995","unstructured":"Flickner, M., et al.: Query by image and video content: the QBIC system. IEEE Computer\u00a028, 23\u201332 (1995)","journal-title":"IEEE Computer"},{"issue":"2","key":"3_CR6","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1145\/280277.280279","volume":"30","author":"V. Gaede","year":"1998","unstructured":"Gaede, V., Gunther, O.: Multidimensional Access Methods. ACM Computing Surveys\u00a030(2), 170\u2013231 (1998)","journal-title":"ACM Computing Surveys"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-Trees: A Dynamic Index Structure for Spatial Searching. In: Proc. of the ACM SIGMOD International Conference on Management of Data, pp. 47\u201357 (1984)","DOI":"10.1145\/602259.602266"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Henrich, A.: The LSD h -tree: An Access Structure for Feature Vectors. In: Proc. of the International Conference on Data Engineering, pp. 362\u2013369 (1998)","DOI":"10.1109\/ICDE.1998.655799"},{"key":"3_CR9","unstructured":"Henrich, A., Six, H.-W., Widmayer, P.: The LSD-tree: spatial access to multidimensional point and non-point objects. In: Proc. of ICDE, pp. 44\u201353 (1989)"},{"key":"3_CR10","volume-title":"The Art of Computer Programming, vol. 3: Sorting and Searching","author":"D. Knuth","year":"1973","unstructured":"Knuth, D.: The Art of Computer Programming, vol. 3: Sorting and Searching. Addison Wesley, Reading (1973)"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Litwin, W., Lomet, D.B.: The Bounded Disorder Access Method. In: Proc. of the IEEE International Conference on Data Engineering, pp. 38\u201348 (1986)","DOI":"10.1109\/ICDE.1986.7266204"},{"issue":"4","key":"3_CR12","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1145\/49346.50067","volume":"13","author":"D.B. Lomet","year":"1988","unstructured":"Lomet, D.B.: A Simple Bounded Disorder File Organization with Good Performance. ACM Transactions on Database Systems\u00a013(4), 525\u2013551 (1988)","journal-title":"ACM Transactions on Database Systems"},{"key":"3_CR13","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/BF01185680","volume":"29","author":"P.E. O\u2019Neil","year":"1992","unstructured":"O\u2019Neil, P.E.: The SB-tree: An Index-Sequential Structure for High-Performance Sequential Access. Acta Informatica\u00a029, 241\u2013265 (1992)","journal-title":"Acta Informatica"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Pagel, B.-U., Six, H.-W., Toben, H., Widmayer, P.: Towards an Analysis of Range Query Performance. In: Proc. of the ACM Symposium on PODS (1993)","DOI":"10.1145\/153850.153878"},{"issue":"7","key":"3_CR15","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1145\/358105.893","volume":"27","author":"J.S. Vitter","year":"1984","unstructured":"Vitter, J.S.: Faster Methods for Random Sampling. Communications of the ACM\u00a027(7), 703\u2013718 (1984)","journal-title":"Communications of the ACM"},{"key":"3_CR16","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1145\/3147.3165","volume":"11","author":"J.S. Vitter","year":"1985","unstructured":"Vitter, J.S.: Random Sampling with Reservoir. ACM Trans. on Mathematical Software\u00a011, 37\u201357 (1985)","journal-title":"ACM Trans. on Mathematical Software"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24571-1_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T13:43:01Z","timestamp":1559914981000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24571-1_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540210474","9783540245711"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24571-1_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}