{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,14]],"date-time":"2025-11-14T17:09:40Z","timestamp":1763140180354,"version":"3.32.0"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2006,7,26]],"date-time":"2006-07-26T00:00:00Z","timestamp":1153872000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2007,8,13]]},"DOI":"10.1007\/s00778-005-0171-7","type":"journal-article","created":{"date-parts":[[2006,8,17]],"date-time":"2006-08-17T10:14:01Z","timestamp":1155809641000},"page":"417-437","source":"Crossref","is-referenced-by-count":48,"title":["The partitioned exponential file for database storage management"],"prefix":"10.1007","volume":"16","author":[{"given":"Christopher","family":"Jermaine","sequence":"first","affiliation":[]},{"given":"Edward","family":"Omiecinski","sequence":"additional","affiliation":[]},{"given":"Wai Gen","family":"Yee","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,7,26]]},"reference":[{"key":"171_CR1","doi-asserted-by":"crossref","first-page":"1116","DOI":"10.1145\/48529.48535","volume":"31","author":"A. Aggarwal","year":"1988","unstructured":"Aggarwal, A., Vitter, J.S.: The input\/output complexity of sorting and related problems. Communications of the ACM 31, 1116\u20131127 (1988)","journal-title":"Communications of the ACM"},{"key":"171_CR2","doi-asserted-by":"crossref","unstructured":"Agarwal, P.K., Arge, L., Procopiuc, O., Vitter, J.S.: A framework for index bulk loading and dynamization. In: Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP 2001) pp. 115\u2013127. Crete, Greece (2001)","DOI":"10.1007\/3-540-48224-5_10"},{"key":"171_CR3","doi-asserted-by":"crossref","unstructured":"Arge, L.: The buffer tree: A new technique for optimal I\/O-algorithms (extended abstract). In: Algorithms and Data Structures, 4th International Workshop (WADS 1995) pp. 334\u2013345. Kingston, Ontario, Canada (1995)","DOI":"10.1007\/3-540-60220-8_74"},{"key":"171_CR4","unstructured":"Arge, L., Hinrichs, K., Vahrenhold, J., Vitter, J.S.: Efficient bulk operations on dynamic R-trees. Algorithm Engineering and Experimentation, International Workshop (ALE-NEX 1999), Baltimore, MD, USA. January 15\u201316, pp. 328\u2013348 (1999)"},{"issue":"5","key":"171_CR5","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1016\/0020-0190(79)90117-0","volume":"8","author":"J.L. Bentley","year":"1979","unstructured":"Bentley, J.L.: Decomposable searching problems. Information Processing Letters 8(5), 244\u2013251 (1979)","journal-title":"Information Processing Letters"},{"key":"171_CR6","unstructured":"Bercken, Jochen Van den, Seeger, B., Widmayer, P.: A generic approach to bulk loading multidimensional index structures. In: Proceedings of 23rd International Conference on Very Large Data Bases (VLDB 1997) pp. 406\u2013415. Athens, Greece, (1997)"},{"issue":"2","key":"171_CR7","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1145\/176979.176981","volume":"26","author":"P.M. Chen","year":"1994","unstructured":"Chen, P.M., Lee, E.L., Gibson, G.A., Katz, R.H., Patterson, D.A.: RAID: High-performance, reliable secondary storage. ACM Computing Surveys 26(2), 145\u2013185 (1994)","journal-title":"ACM Computing Surveys"},{"issue":"2","key":"171_CR8","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1145\/356770.356776","volume":"11","author":"D. Comer","year":"1979","unstructured":"Comer, D.: The ubiquitous B-Tree. ACM Computing Surveys 11(2), 121\u2013137 (1979)","journal-title":"ACM Computing Surveys"},{"key":"171_CR9","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"1992","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms, MIT Press, Massachusetts (1992)"},{"issue":"3","key":"171_CR10","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1145\/320083.320092","volume":"4","author":"R. Fagin","year":"1979","unstructured":"Fagin, R., Nievergelt, J., Pippenger, N., Strong, H.R.: Extendible hashing\u2014A fast access method for dynamic files. ACM Transactions on Database Systems 4(3), 315\u2013344 (1979)","journal-title":"ACM Transactions on Database Systems"},{"key":"171_CR11","unstructured":"Garcia, Y.J., Lopez, M.A., Leutenegger, S.T.: On optimal node splitting for R-trees. In: Proceedings of the 24th International Conference on Very Large Data Bases (VLDB 1998) pp. 334\u2013344. New York City, New York, USA (1998)"},{"key":"171_CR12","doi-asserted-by":"crossref","unstructured":"Gray, J., Shenoy, P.J.: Rules of thumb in data engineering. In: Proceedings of the 16th International Conference on Data Engineering (ICDE 2000) pp. 3\u201312. vol. 3 San Diego, CA, USA.","DOI":"10.1109\/ICDE.2000.839382"},{"key":"171_CR13","unstructured":"Growchowski, E.G.: Emerging Trends in Data Storage on Magnetic Hard Disk Drives. Datatech (1998)"},{"key":"171_CR14","doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-Trees: A dynamic index structure for spatial searching. In: Proceedings of 1984 SIGMOD Conference (SIGMOD 1984) pp. 47\u201357. Boston, Massachusetts (1984)","DOI":"10.1145\/602259.602266"},{"key":"171_CR15","unstructured":"Hellerstein, J.M., Naughton, J.F., Pfeffer, A.: Generalized search trees for database systems. In: Proceedings of 21th International Conference on Very Large Data Bases (VLDB'95) pp. 562\u2013573, Zurich, Switzerland (1995)"},{"key":"171_CR16","unstructured":"Jagadish, H.V., Narayan, P.P.S., Seshadri, S., Sudarshan, S., Kanneganti, R.: Incremental organization for data recording and warehousing. In: Proceedings of 23rd International Conference on Very Large Data Bases (VLDB 1997) pp. 16\u201325. Athens, Greece (1997)"},{"key":"171_CR17","unstructured":"Jermaine, C., Datta, A., Omiecinski, E.: A novel index supporting high volume data warehouse insertion. In: Proceedings of 25th International Conference on Very Large Data Bases (VLDB 1999) pp. 235\u2013246. Edinburgh, Scotland, UK (1999)"},{"key":"171_CR18","doi-asserted-by":"crossref","unstructured":"Jermaine, C., Omiecinski, E., Yee, W.G.: Maintaining a Large Spatial Index with T2SM. In: Proceedings of the Ninth ACM International Symposium on Advances in Geographic Information Systems (ACM-GIS 2001). Atlanta, GA, USA. (2001)","DOI":"10.1145\/512161.512179"},{"key":"171_CR19","unstructured":"Kamel, I., Faloutss, C.: Hilbert R-tree: An improved R-tree using fractals. In: Proceedings of the 20th International Conference on Very Large Data Bases pp. 500\u2013509. Santiago de Chile, Chile (VLDB 1994) (1994)"},{"key":"171_CR20","volume-title":"The art of computer programming, Vol. III: Sorting and Searching","author":"D.E. Knuth","year":"1973","unstructured":"Knuth, D.E.: The art of computer programming, Vol. III: Sorting and Searching. Addison-Wesley, Reading, MA (1973)"},{"key":"171_CR21","doi-asserted-by":"crossref","unstructured":"Leutenegger, S.T., Edgington, J.M., Lopez, M.A.: STR: A simple and efficient algorithm for R-tree packing. In: Proceedings of the Thirteenth International Conference on Data Engineering (ICDE 1997) pp. 497\u2013506. Birmingham, UK (1997)","DOI":"10.1109\/ICDE.1997.582015"},{"key":"171_CR22","unstructured":"Litwin, W., Hashing, L.: A new tool for file and table addressing. In: Proceedings of the Sixth International Conference on Very Large Data Bases pp. 212\u2013223. Montreal, Quebec, Canada (VLDB 1980) (1980)"},{"issue":"4","key":"171_CR23","doi-asserted-by":"crossref","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 13(4), 525\u2013551 (1988)","journal-title":"ACM Transactions on Database Systems"},{"key":"171_CR24","doi-asserted-by":"crossref","unstructured":"Lomet, D., Salzberg, B.: Access methods for multiversion data. In: Proceedings of the 1989 ACM SIGMOD Conference on the Management of Data (SIGMOD 1989) pp. 315\u2013323. Portland, Oregon, (1989)","DOI":"10.1145\/67544.66956"},{"key":"171_CR25","unstructured":"Muth, P., O'Neil, P.E., Pick, A., Weikum, G.: Design, implementation, and performance of the lham log-structured history data access method. In: Proceedings of 24rd International Conference on Very Large Data Bases (VLDB 1998) pp. 452\u2013463. New York City, New York, USA (1998)"},{"key":"171_CR26","doi-asserted-by":"crossref","unstructured":"Neefe, J.M., Roselli, D.S., Costello, A.M., Wang, R.Y., Anderson, T.E.: Improving the performance of log-structured file systems with adaptive methods. In: Proceedings of the Sixteenth ACM Symposium on Operating System Principles (SOSP 1997) pp. 238\u2013251. St Malo, France (1997)","DOI":"10.1145\/268998.266700"},{"key":"171_CR27","doi-asserted-by":"crossref","unstructured":"O'Neil, J.E., O'Neil, P.E., Weikum, G.: The LRU-K page replacement algorithm for database disk buffering. In: Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data (SIGMOD 1993) pp. 297\u2013306. Washington, DC (1993)","DOI":"10.1145\/170035.170081"},{"issue":"3","key":"171_CR28","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/BF01185680","volume":"29","author":"P.E. O'Neil","year":"1992","unstructured":"O'Neil, P.E.: The SB-tree: An index-sequential structure for high-performance sequential access. Acta Informatica 29(3), 241\u2013265 (1992)","journal-title":"Acta Informatica"},{"issue":"4","key":"171_CR29","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/s002360050048","volume":"33","author":"P.E. O'Neil","year":"1996","unstructured":"O'Neil, P.E., Cheng, E., Gawlick, D., O'Neil, E.J.: The Log-Structured Merge-Tree (LSM-Tree). Acta Informatica 33(4), 351\u2013385 (1996)","journal-title":"Acta Informatica"},{"key":"171_CR30","unstructured":"Overmars, M.H.: The design of dynamic data structures. Springer-Verlag, LNCS p. 156 (1983)"},{"issue":"5","key":"171_CR31","doi-asserted-by":"crossref","first-page":"826","DOI":"10.1109\/69.634758","volume":"9","author":"J.S. Park","year":"1997","unstructured":"Park, J.S., Sridhar, V.: Probabilistic model and optimal reorganization of B+-Tree with physical clustering. IEEE Transactions on Knowledge and Data Engineering 9(5), 826\u2013832 (1997)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"6","key":"171_CR32","doi-asserted-by":"crossref","first-page":"975","DOI":"10.1109\/69.553166","volume":"8","author":"K. Pollari-Malmi","year":"1996","unstructured":"Pollari-Malmi, K., Soisalon-Soininen, E., Yl\u00f6nen, T.: Concurrency control in B-Trees with batch updates. IEEE Transactions on Knowledge and Data Engineering 8(6), 975\u2013984 (1996)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"1","key":"171_CR33","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1145\/146941.146943","volume":"10","author":"M. Rosenblum","year":"1992","unstructured":"Rosenblum, M., Ousterhout, J.K.: The design and Implementation of a log-structured file system. ACM Transactions on Computer Systems 10(1), 26\u201352 (1992)","journal-title":"ACM Transactions on Computer Systems"},{"key":"171_CR34","unstructured":"Seeger, B., Kriegel, H.-P.: The Buddy-Tree: an efficient and robust access method for spatial data base systems. In: Proceedings of the 16th International Conference on Very Large Data Bases (VLDB 1990) pp. 590\u2013601. Brisbane, Queensland, Australia (1990)"},{"key":"171_CR35","doi-asserted-by":"crossref","unstructured":"Tao, Y., Papadias, D.: Adaptive Index Structures. In: Proceedings of 28th International Conference on Very Large Data Bases (VLDB 2002) pp. 418\u2013429. Hong Kong, China (2002)","DOI":"10.1016\/B978-155860869-6\/50044-5"},{"key":"171_CR36","doi-asserted-by":"crossref","unstructured":"Tyson, A., The LSST Collaboration: Large synoptic survey telescope: Overview. In: Proceeedings of SPIE; International Society of Optical Engineering 4836, pp. 10\u201320 (2002)","DOI":"10.1117\/12.456772"},{"key":"171_CR37","doi-asserted-by":"crossref","unstructured":"Zou, C., Salzberg, B.: On-line reorganization of sparsely-populated B+trees. In: Proceedings of the 1996 ACM S1GMOD International Conference on Management of Data (SIGMOD 1996) pp. 115\u2013124. Montreal, Quebec, Canada (1996)","DOI":"10.1145\/235968.233325"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-005-0171-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00778-005-0171-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-005-0171-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T13:31:03Z","timestamp":1736515863000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00778-005-0171-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,7,26]]},"references-count":37,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2007,8,13]]}},"alternative-id":["171"],"URL":"https:\/\/doi.org\/10.1007\/s00778-005-0171-7","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"type":"print","value":"1066-8888"},{"type":"electronic","value":"0949-877X"}],"subject":[],"published":{"date-parts":[[2006,7,26]]}}}