{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T05:58:10Z","timestamp":1775282290785,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540424239","type":"print"},{"value":"9783540446347","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44634-6_6","type":"book-chapter","created":{"date-parts":[[2007,8,10]],"date-time":"2007-08-10T10:20:48Z","timestamp":1186741248000},"page":"50-61","source":"Crossref","is-referenced-by-count":11,"title":["Time Responsive External Data Structures for Moving Points"],"prefix":"10.1007","author":[{"given":"Pankaj K.","family":"Agarwal","sequence":"first","affiliation":[]},{"given":"Lars","family":"Arge","sequence":"additional","affiliation":[]},{"given":"Jan","family":"Vahrenhold","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,8,2]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"P. K. Agarwal, L. Arge, and J. Erickson, Indexing moving points, Proc. Annu. ACM Sympos. Principles Database Syst., 2000, pp. 175\u2013186.","DOI":"10.1145\/335168.335220"},{"key":"6_CR2","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1006\/jcss.2000.1709","volume":"61","author":"P. K. Agarwal","year":"2000","unstructured":"P. K. Agarwal, L. Arge, J. Erickson, P. Franciosa, and J. Vitter, Efficient searching with linear constraints, Journal of Computer and System Sciences, 61 (2000), 194\u2013216.","journal-title":"Journal of Computer and System Sciences"},{"key":"6_CR3","series-title":"Contemporary Mathematics","first-page":"1","volume-title":"Advances in Discrete and Computational Geometry","author":"P. K. Agarwal","year":"1999","unstructured":"P. K. Agarwal and J. Erickson, Geometric range searching and its relatives, in: Advances in Discrete and Computational Geometry (B. Chazelle, J. E. Goodman, and R. Pollack, eds.), Contemporary Mathematics, Vol. 223, American Mathematical Society, Providence, RI, 1999, pp. 1\u201356."},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"1116","DOI":"10.1145\/48529.48535","volume":"31","author":"A. Aggarwal","year":"1988","unstructured":"A. Aggarwal and J. S. Vitter, The Input\/Output complexity of sorting and related problems, Communications of the ACM, 31 (1988), 1116\u20131127.","journal-title":"Communications of the ACM"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"L. Arge, External memory data structures, in: Handbook of Massive Data Sets (J. Abello, P. M. Pardalos, and M. G. C. Resende, eds.), Kluwer Academic Publishers, 2001. (To appear).","DOI":"10.1007\/978-1-4615-0005-6_9"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"L. Arge, V. Samoladas, and J. S. Vitter, On two-dimensional indexability and optimal range search indexing, Proc. ACM Symp. Principles of Database Systems, 1999, pp. 346\u2013357.","DOI":"10.1145\/303976.304010"},{"key":"6_CR7","unstructured":"J. Basch, L. J. Guibas, and J. Hershberger, Data structures for mobile data, Proc. 8th ACM-SIAM Sympos. Discrete Algorithms, 1997, pp. 747\u2013756."},{"key":"6_CR8","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1007\/s007780050028","volume":"5","author":"B. Becker","year":"1996","unstructured":"B. Becker, S. Gschwind, T. Ohler, B. Seeger, and P. Widmayer, An asymptotically optimal multiversion B-tree, VLDB Journal, 5 (1996), 264\u2013275.","journal-title":"VLDB Journal"},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1145\/356770.356776","volume":"11","author":"D. Comer","year":"1979","unstructured":"D. Comer, The ubiquitous B-tree, A CM Computing Surveys, 11 (1979), 121\u2013137.","journal-title":"A CM Computing Surveys"},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/PL00009354","volume":"19","author":"T. K. Dey","year":"1998","unstructured":"T. K. Dey, Improved bounds on planar k-sets and related problems, Discrete Comput. Geom., 19 (1998), 373\u2013382.","journal-title":"Discrete Comput. Geom."},{"key":"6_CR11","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1137\/0215019","volume":"15","author":"H. Edelsbrunner","year":"1986","unstructured":"H. Edelsbrunner and E. Welzl, Constructing belts in two-dimensional arrangements with applications, SIAM J. Comput., 15 (1986), 271\u2013284.","journal-title":"SIAM J. Comput."},{"key":"6_CR12","first-page":"191","volume-title":"Proc. Workshop Algorithmic Found. Robot","author":"L. J. Guibas","year":"1998","unstructured":"L. J. Guibas, Kinetic data structures-a state of the art report, in: Proc. Workshop Algorithmic Found. Robot. (P. K. Agarwal, L. E. Kavraki, and M. Mason, eds.), A. K. Peters, Wellesley, MA, 1998, pp. 191\u2013209."},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"G. Kollios, D. Gunopulos, and V. J. Tsotras, On indexing mobile objects, Proc. Annu. ACM Sympos. Principles Database Syst., 1999, pp. 261\u2013272.","DOI":"10.1145\/303976.304002"},{"key":"6_CR14","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0020-0190(91)90177-J","volume":"39","author":"J. Matousek","year":"1991","unstructured":"J. Matousek, Randomized optimal algorithm for slope selection, Inform. Process. Lett., 39 (1991), 183\u2013187.","journal-title":"Inform. Process. Lett."},{"key":"6_CR15","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/BF02293051","volume":"8","author":"J. Matousek","year":"1992","unstructured":"J. Matousek, Efficient partition trees, Discrete Comput. Geom., 8 (1992), 315\u2013334.","journal-title":"Discrete Comput. Geom."},{"key":"6_CR16","unstructured":"D. Pfoser, C. S. Jensen, and Y. Theodoridis, Novel approaches to the indexing of moving objects trajectories, Proc. International Conf. on Very Large Databases, 2000, pp. 395\u2013406."},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"G. Toth, Point sets with many k-sets, Proc. 16th Annu. Symposium on Computational Geometry, 2000, pp. 37\u201342.","DOI":"10.1145\/336154.336171"},{"key":"6_CR18","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1109\/69.599929","volume":"9","author":"P. J. Varman","year":"1997","unstructured":"P. J. Varman and R. M. Verma, An efficient multiversion access structure, IEEE Transactions on Knowledge and Data Engineering, 9 (1997), 391\u2013409.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"6_CR19","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/3-540-48523-6_10","volume-title":"Proc. Annual International Colloquium on Automata, Languages, and Programming","author":"J. S. Vitter","year":"1999","unstructured":"J. S. Vitter, Online data structures in external memory, Proc. Annual International Colloquium on Automata, Languages, and Programming, LNCS 1644, 1999, pp. 119\u2013133."},{"key":"6_CR20","doi-asserted-by":"crossref","unstructured":"S. Saltenis, C. S. Jensen, S. T. Leutenegger, and M. A. Lopez, Indexing the positions of continuously moving objects, Proc. ACM SIGMOD International Conference on Management of Data, 2000, pp. 331\u2013342.","DOI":"10.1145\/342009.335427"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44634-6_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T07:25:28Z","timestamp":1737357928000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44634-6_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424239","9783540446347"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-44634-6_6","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}