{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T06:10:02Z","timestamp":1740204602503,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540405450"},{"type":"electronic","value":"9783540450788"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45078-8_9","type":"book-chapter","created":{"date-parts":[[2010,6,22]],"date-time":"2010-06-22T21:23:52Z","timestamp":1277241832000},"page":"91-102","source":"Crossref","is-referenced-by-count":2,"title":["Fast Algorithms for a Class of Temporal Range Queries"],"prefix":"10.1007","author":[{"given":"Qingmin","family":"Shi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joseph","family":"JaJa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Agarwal, P.K., Arge, L., Erickson, J.: Indexing moving points. In: 19th ACM Symp. Principles of Database Systems, pp. 175\u2013186 (2000)","key":"9_CR1","DOI":"10.1145\/335168.335220"},{"issue":"3","key":"9_CR2","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1137\/0215051","volume":"15","author":"B. Chazelle","year":"1986","unstructured":"Chazelle, B.: Filtering search: A new approach to query-answering. SIAM J. Computing\u00a015(3), 703\u2013724 (1986)","journal-title":"SIAM J. Computing"},{"issue":"3","key":"9_CR3","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1137\/0217026","volume":"17","author":"B. Chazelle","year":"1988","unstructured":"Chazelle, B.: A functional approach to data structures and its use in multidimensional searching. SIAM J. Computing\u00a017(3), 427\u2013463 (1988)","journal-title":"SIAM J. Computing"},{"issue":"3","key":"9_CR4","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1145\/79147.79149","volume":"37","author":"B. Chazelle","year":"1990","unstructured":"Chazelle, B.: Lower bounds for orthogonal range search I. The arithmetic model. J. ACM\u00a037(3), 439\u2013463 (1990)","journal-title":"J. ACM"},{"issue":"2","key":"9_CR5","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1145\/77600.77614","volume":"37","author":"B. Chazelle","year":"1990","unstructured":"Chazelle, B.: Lower bounds for orthogonal range search I. The reporting case. J. ACM\u00a037(2), 200\u2013212 (1990)","journal-title":"J. ACM"},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/0022-0000(89)90034-2","volume":"38","author":"J.R. Driscoll","year":"1989","unstructured":"Driscoll, J.R., Sarnak, N., Sleattor, D., Tarjan, R.E.: Make data structures persistent. J. of Comput. and Syst. Sci.\u00a038, 86\u2013124 (1989)","journal-title":"J. of Comput. and Syst. Sci."},{"key":"9_CR7","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1016\/S0022-0000(05)80064-9","volume":"48","author":"M.L. Fredman","year":"1994","unstructured":"Fredman, M.L., Willard, D.E.: Trans-dichotomous algorithms for minimum spanning trees and shortest paths. J. Comput. and Syst. Sci.\u00a048, 533\u2013551 (1994)","journal-title":"J. Comput. and Syst. Sci."},{"doi-asserted-by":"crossref","unstructured":"Gabow, H.N., Bentley, J.L., Tarjan, R.E.: Scaling and related techniques for geometry problems. In: Proc. 16th Annual ACM Symp. Theory of Computing, pp. 135\u2013143 (1984)","key":"9_CR8","DOI":"10.1145\/800057.808675"},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1006\/jagm.1995.1038","volume":"19","author":"P. Gupta","year":"1995","unstructured":"Gupta, P., Janardan, R., Smid, M.: Further results on generalized intersection searching problems: counting, reporting, and dynamization. J. Algorithms\u00a019, 282\u2013317 (1995)","journal-title":"J. Algorithms"},{"issue":"2","key":"9_CR10","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1137\/0213024","volume":"13","author":"D. Harel","year":"1984","unstructured":"Harel, D., Tarjan, R.E.: Fast algorithms for finding nearest common ancestors. SIAM J. Computing\u00a013(2), 338\u2013355 (1984)","journal-title":"SIAM J. Computing"},{"issue":"1","key":"9_CR11","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1142\/S021819599300004X","volume":"3","author":"R. Janardan","year":"1993","unstructured":"Janardan, R., Lopez, M.: Generalized intersection searching problems. International Journal of Computational Geometry & Applications\u00a03(1), 39\u201369 (1993)","journal-title":"International Journal of Computational Geometry & Applications"},{"doi-asserted-by":"crossref","unstructured":"Lanka, S., Mays, E.: Fully persistent B\u2009+\u2009-trees. In: Proc. ACM SIGMOD Int. Conf. on Management of Data, pp. 426\u2013435 (1991)","key":"9_CR12","DOI":"10.1145\/115790.115861"},{"issue":"6","key":"9_CR13","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/S0020-0190(98)00075-1","volume":"66","author":"C. Makris","year":"1998","unstructured":"Makris, C., Tsakalidis, A.K.: Algorithms for three-dimensional dominance searching in linear space. Information Processing Letters\u00a066(6), 277\u2013283 (1998)","journal-title":"Information Processing Letters"},{"doi-asserted-by":"crossref","unstructured":"Manolopoulos, Y., Kapetanakis, G.: Overlapping B\u2009+\u2009-trees for temporal data. In: Proc. 5th Jerusalem Conf. on Information Technology, pp. 491\u2013498 (1990)","key":"9_CR14","DOI":"10.1109\/JCIT.1990.128320"},{"issue":"2","key":"9_CR15","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1137\/0214021","volume":"14","author":"E.M. McCreight","year":"1985","unstructured":"McCreight, E.M.: Priority search trees. SIAM J. Computing\u00a014(2), 257\u2013276 (1985)","journal-title":"SIAM J. Computing"},{"doi-asserted-by":"crossref","unstructured":"Nascimento, M.A., Silva, J.R.O.: Towards historical R-trees. In: Proc. ACM Symp. Applied Computing, pp. 235\u2013240 (1998)","key":"9_CR16","DOI":"10.1145\/330560.330692"},{"doi-asserted-by":"crossref","unstructured":"Saltenis, S., Jensen, C.S., Leutenegger, S.T., Lopez, M.A.: Indexing the positions of continuously moving objects. In: Proc. 2000 ACM SIGMOD Int. Conf. on Management of Data, pp. 331\u2013342 (2000)","key":"9_CR17","DOI":"10.1145\/342009.335427"},{"unstructured":"Shi, Q., JaJa, J.: Fast algorithms for 3-d dominance reporting and counting. Technical Report CS-TR-4437, Institute of Advanced Computer Study (UMIACS), Unveristy of Maryland (2003)","key":"9_CR18"},{"unstructured":"Tao, Y., Papadias, D.: Efficient historical R-trees. In: Proc. 13th Int. Conf. on Scientific and Statistical Database Management, pp. 223\u2013232 (2001)","key":"9_CR19"},{"doi-asserted-by":"crossref","unstructured":"Tzouramanis, T., Manolopoulos, Y., Vassilakopoulos, M.: Overlapping Linear Quadtrees: A spatio-temporal access method. In: Proc. of the 6th ACM Symp. on Advances in Geographic Information Systems (ACM-GIS), pp. 1\u20137 (1998)","key":"9_CR20","DOI":"10.1145\/288692.288695"},{"key":"9_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/3-540-48252-0_7","volume-title":"Advances in Databases and Information Systems","author":"T. Tzouramanis","year":"1999","unstructured":"Tzouramanis, T., Vassilakopoulos, M., Manolopoulos, Y.: Processing of spatiotemporal queries in image databases. In: Eder, J., Rozman, I., Welzer, T. (eds.) ADBIS 1999. LNCS, vol.\u00a01691, pp. 85\u201397. Springer, Heidelberg (1999)"},{"issue":"3","key":"9_CR22","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1109\/69.599929","volume":"9","author":"P.J. Varman","year":"1997","unstructured":"Varman, P.J., Verma, R.M.: An efficient multiversion access structure. IEEE Trans. Knowledge and Data Engineering\u00a09(3), 391\u2013409 (1997)","journal-title":"IEEE Trans. Knowledge and Data Engineering"},{"issue":"4","key":"9_CR23","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1145\/358841.358852","volume":"23","author":"J. Vuillemin","year":"1980","unstructured":"Vuillemin, J.: A unifying look at data structures. Comm. ACM\u00a023(4), 229\u2013239 (1980)","journal-title":"Comm. ACM"},{"issue":"3","key":"9_CR24","doi-asserted-by":"publisher","first-page":"1030","DOI":"10.1137\/S0097539797322425","volume":"29","author":"D.E. Willard","year":"2000","unstructured":"Willard, D.E.: Examining computational geometry, van Emde Boas trees, and hashing from the perspective of the fusion three. SIAM J. Computing\u00a029(3), 1030\u20131049 (2000)","journal-title":"SIAM J. Computing"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45078-8_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T05:00:33Z","timestamp":1740200433000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45078-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405450","9783540450788"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45078-8_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}