{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T17:28:38Z","timestamp":1743096518468,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":13,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387355443"},{"type":"electronic","value":"9780387399409"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-0-387-39940-9_1513","type":"book-chapter","created":{"date-parts":[[2009,9,16]],"date-time":"2009-09-16T08:58:40Z","timestamp":1253091520000},"page":"3254-3258","source":"Crossref","is-referenced-by-count":0,"title":["Valid-Time Indexing"],"prefix":"10.1007","author":[{"given":"Mirella M.","family":"Moro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vassilis J.","family":"Tsotras","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"unstructured":"Arge L. and Vitter J.S. Optimal dynamic interval management in external memory. In Proc. 37th Annual Symp. on Foundations of Computer Science, 1996, pp. 560\u2013569.","key":"1513_CR1_1513"},{"issue":"6","key":"1513_CR2_1513","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1007\/BF01188717","volume":"12","author":"G. Blankenagel","year":"1994","unstructured":"Blankenagel G. and Gueting R.H. External segment trees. Algorithmica, 12(6):498\u2013532, 1994.","journal-title":"Algorithmica"},{"unstructured":"Bliujute R., Jensen C.S., Saltenis S., and Slivinskas G. R-tree based indexing of now-relative bi-temporal data. In Proc. ACM SIGMOD Int. Conf. on Management of Data, 1998, pp. 345\u2013356.","key":"1513_CR3_1513"},{"doi-asserted-by":"crossref","unstructured":"Chiang Y.-J. and Silva C.T. External memory techniques for isosurface extraction in scientific visualization, external memory algorithms and visualization. In DIMACS Series in Discrete Mathematics and Theoretical Computer Science, J. Abello, J.S. Vitter (eds.). AMS, vol. 50, 1999, pp. 247\u2013277.","key":"1513_CR4_1513","DOI":"10.1090\/dimacs\/050\/14"},{"doi-asserted-by":"crossref","unstructured":"Icking C., Klein R., and Ottmann T. Priority search trees in secondary memory. In Proc. Int. Workshop on Graph Theoretic Concepts in Computer Science, 1988, pp. 84\u201393.","key":"1513_CR5_1513","DOI":"10.1007\/3-540-19422-3_7"},{"doi-asserted-by":"crossref","unstructured":"Kanellakis P., Ramaswamy S., Vengroff D., and Vitter J.S. Indexing for data models with constraint and classes. In Proc. 12th ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems, 1993, pp. 233\u2013243.","key":"1513_CR6_1513","DOI":"10.1145\/153850.153884"},{"doi-asserted-by":"crossref","unstructured":"Kolovson C. and Stonebraker M. Segment indexes: dynamic indexing techniques for multi-dimensional interval data. In Proc. ACM SIGMOD Int. Conf. on Management of Data, 1991, pp. 138\u2013147.","key":"1513_CR7_1513","DOI":"10.1145\/119995.115807"},{"unstructured":"Kriegel H-P., Potke M., Seidl T. Managing intervals efficiently in object-relational databases. In Proc. 26th Int. Conf. on Very Large Data Bases, 2000.","key":"1513_CR8_1513"},{"key":"1513_CR9_1513","series-title":"Multi-dimensional Searching and Computational Geometry","volume-title":"Data Structures and Efficient Algorithms","author":"K. Mehlhorn","year":"1984","unstructured":"Mehlhorn K. Data Structures and Efficient Algorithms, Vol. 3: Multi-dimensional Searching and Computational Geometry. EATCS Monographs, Springer, 1984."},{"issue":"6","key":"1513_CR10_1513","doi-asserted-by":"publisher","first-page":"929","DOI":"10.1109\/69.824609","volume":"11","author":"M.A. Nascimento","year":"1999","unstructured":"Nascimento M.A. and Dunham M.H. Indexing valid time databases via B+-Trees. IEEE Trans. Knowl. Data Eng., 11(6):929\u2013947, 1999.","journal-title":"IEEE Trans. Knowl. Data Eng."},{"doi-asserted-by":"crossref","unstructured":"Ramaswamy S. and Subramanian S. Path caching: a technique for optimal external searching. In Proc. 13th ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems, 1994, pp. 25\u201335.","key":"1513_CR11_1513","DOI":"10.1145\/182591.182595"},{"issue":"2","key":"1513_CR12_1513","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1145\/319806.319816","volume":"31","author":"B. Salzberg","year":"1999","unstructured":"Salzberg B. and Tsotras V.J. A comparison of access methods for time-evolving data. ACM Comput. Surv., 31(2):158\u2013221, 1999.","journal-title":"ACM Comput. Surv."},{"issue":"9","key":"1513_CR13_1513","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1109\/MC.1986.1663327","volume":"19","author":"R.T. Snodgrass","year":"1986","unstructured":"Snodgrass R.T. and Ahn I. Temporal databases. IEEE Comput., 19(9):35\u201342, 1986.","journal-title":"IEEE Comput."}],"container-title":["Encyclopedia of Database Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-39940-9_1513","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T05:33:56Z","timestamp":1739338436000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-0-387-39940-9_1513"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9780387355443","9780387399409"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-39940-9_1513","relation":{},"subject":[],"published":{"date-parts":[[2009]]}}}