{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T15:10:29Z","timestamp":1740841829188,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":6,"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_30","type":"book-chapter","created":{"date-parts":[[2011,1,7]],"date-time":"2011-01-07T15:32:42Z","timestamp":1294414362000},"page":"331-338","source":"Crossref","is-referenced-by-count":1,"title":["A Cost Model for Spatial Intersection Queries on RI-Trees"],"prefix":"10.1007","author":[{"given":"Hans-Peter","family":"Kriegel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Pfeifle","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marco","family":"P\u00f6tke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Seidl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"30_CR1","doi-asserted-by":"crossref","unstructured":"Kriegel, H.-P., Pfeifle, M., P\u00f6tke, M., Seidl, T.: A Cost Model for Interval Sequence Intersection Queries on RI-Trees. Technical Report, University of Munich (2003)","DOI":"10.1007\/978-3-540-24571-1_30"},{"key":"30_CR2","doi-asserted-by":"crossref","unstructured":"Kriegel, H.-P., Pfeifle, M., P\u00f6tke, M., Seidl, T.: A Cost Model for Interval Intersection Queries on RI-Trees. In: Proc. 14th Int. Conf. on Scientific and Statistical Database Management (SSDBM), pp. 131\u2013141 (2002)","DOI":"10.1109\/SSDM.2002.1029713"},{"key":"30_CR3","unstructured":"Kriegel, H.-P., P\u00f6tke, M., Seidl, T.: Managing Intervals Efficiently in Object-Relational Databases. In: Proc. 26th Int. Conf. on Very Large Databases (VLDB), pp. 407\u2013418 (2000)"},{"key":"30_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/3-540-47724-1_25","volume-title":"Advances in Spatial and Temporal Databases","author":"H.-P. Kriegel","year":"2001","unstructured":"Kriegel, H.-P., P\u00f6tke, M., Seidl, T.: Interval Sequences: An Object-Relational Approach to Manage Spatial Data. In: Jensen, C.S., Schneider, M., Seeger, B., Tsotras, V.J. (eds.) SSTD 2001. LNCS, vol.\u00a02121, pp. 481\u2013501. Springer, Heidelberg (2001)"},{"issue":"3","key":"30_CR5","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1145\/290593.290598","volume":"27","author":"D. Lomet","year":"1998","unstructured":"Lomet, D.: B-tree Page Size When Caching is Considered. ACM SIGMOD Record\u00a027(3), 28\u201332 (1998)","journal-title":"ACM SIGMOD Record"},{"issue":"1","key":"30_CR6","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1109\/69.842247","volume":"12","author":"Y. Theodoridis","year":"2000","unstructured":"Theodoridis, Y., Stefanakis, E., Sellis, T.: Efficient Cost Models for Spatial Queries Using R-Trees. IEEE Transactions on Knowledge and Data Engineering\u00a012(1), 19\u201332 (2000)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"}],"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_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T14:24:35Z","timestamp":1740839075000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24571-1_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540210474","9783540245711"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24571-1_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}