{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T22:10:01Z","timestamp":1740262201507,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540241317"},{"type":"electronic","value":"9783540305514"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30551-4_70","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T18:15:37Z","timestamp":1279044937000},"page":"822-834","source":"Crossref","is-referenced-by-count":1,"title":["Techniques for Indexing and Querying Temporal Observations for a Collection of Objects"],"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":[{"key":"70_CR1","unstructured":"http:\/\/www.alertsystems.org\/"},{"key":"70_CR2","doi-asserted-by":"crossref","unstructured":"Agarwal, P.K., Arge, L., Erickson, J.: Indexing moving points. In: 19th ACM Symposium on Principles of Database Systems, pp. 175\u2013186 (2000)","DOI":"10.1145\/335168.335220"},{"key":"70_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/3-540-45749-6_6","volume-title":"Algorithms - ESA 2002","author":"P.K. Agarwal","year":"2002","unstructured":"Agarwal, P.K., Govindarajan, S., Muthukrishnan, S.M.: Range searching in categorical data: Colored range searching on grid. In: M\u00f6hring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol.\u00a02461, pp. 17\u201328. Springer, Heidelberg (2002)"},{"key":"70_CR4","unstructured":"Arge, L., Vitter, J.S.: Optimal dynamic interval management in external memory. In: FOCS 1996, October 1996, pp. 560\u2013569 (1996)"},{"key":"70_CR5","unstructured":"Chakka, V.P., Everspaugh, A., Patel, J.M.: Indexing large trajectory data sets with SETI. In: 1st Biennial Conf. on Innovative Data Systems Research (2003)"},{"key":"70_CR6","volume-title":"Introduction to Algorithms","author":"Cormen","year":"1990","unstructured":"Cormen, Leiserson, Rivest: Introduction to Algorithms. MIT Press, Cambridge (1990)"},{"key":"70_CR7","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1080\/00207168308803364","volume":"13","author":"H. Edelsbrunner","year":"1983","unstructured":"Edelsbrunner, H.: A new approach to rectangle intersections, part I. Int. J. Computer Mathematics\u00a013, 209\u2013219 (1983)","journal-title":"Int. J. Computer Mathematics"},{"key":"70_CR8","unstructured":"Gupta, P., Janardan, R., Smid, M.: Computational geometry: generalized intersection searching. In: Handbook of Data Structures and Applications, CRC Press, Boca Raton"},{"key":"70_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. Journal of Algorithms\u00a019, 282\u2013317 (1995)","journal-title":"Journal of Algorithms"},{"issue":"1","key":"70_CR10","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"},{"key":"70_CR11","doi-asserted-by":"crossref","unstructured":"Kollios, G., Gunopulos, D., Tsotras, V.J.: On indexing mobile objects. In: PODS 1999, pp. 261\u2013272 (1999)","DOI":"10.1145\/303976.304002"},{"key":"70_CR12","doi-asserted-by":"crossref","unstructured":"Lanka, S., Mays, E.: Fully persistent B\u2009+\u2009-trees. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 426\u2013435 (1991)","DOI":"10.1145\/119995.115861"},{"key":"70_CR13","doi-asserted-by":"crossref","unstructured":"Mainwaring, A., Polastre, J., Szewczyk, R., Culler, D., Anderson, J.: Wireless sensor networks for habitat monitoring. In: ACM International Workshop on Wireless Sensor Networks and Applications (September 2002)","DOI":"10.1145\/570738.570751"},{"issue":"6","key":"70_CR14","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"},{"key":"70_CR15","doi-asserted-by":"crossref","unstructured":"Manolopoulos, Y., Kapetanakis, G.: Overlapping B\u2009+\u2009-trees for temporal data. In: Proc. of the 5th Jerusalem Conf. on Info. Tech., pp. 491\u2013498 (1990)","DOI":"10.1109\/JCIT.1990.128320"},{"issue":"2","key":"70_CR16","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"},{"key":"70_CR17","unstructured":"Mortensen, C.W.: Generalized static orthogonal range searching in less space. Technical Report TR-2003-22, The IT University of Copenhagen (2003)"},{"key":"70_CR18","doi-asserted-by":"crossref","unstructured":"Nascimento, M.A., Silva, J.R.O.: Towards historical R-trees. In: Proceedings of the ACM Symposium on Applied Computing, February, pp. 235\u2013240 (1998)","DOI":"10.1145\/330560.330692"},{"key":"70_CR19","series-title":"Lecture Notes in Computer Science","volume-title":"The Design of Dynamic Data Structures","author":"M.H. Overmars","year":"1983","unstructured":"Overmars, M.H.: The Design of Dynamic Data Structures. LNCS, vol.\u00a0156. Springer, Heidelberg (1983)"},{"key":"70_CR20","unstructured":"Pfoser, D., Jensen, C.S., Theodoridis, Y.: Novel approaches in query processing for moving object trajectories. In: VLDB 2000, September, pp. 395\u2013406 (2000)"},{"key":"70_CR21","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. of the ACM SIGMOD Int. Conf. on Management of Data, pp. 331\u2013342 (2000)","DOI":"10.1145\/335191.335427"},{"issue":"2","key":"70_CR22","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1145\/319806.319816","volume":"31","author":"B. Salzberg","year":"1999","unstructured":"Salzberg, B., Tsotras, V.J.: Comparison of access methods for time-evolving data. ACM Computing Surveys\u00a031(2), 158\u2013221 (1999)","journal-title":"ACM Computing Surveys"},{"key":"70_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/978-3-540-45078-8_9","volume-title":"Algorithms and Data Structures","author":"Q. Shi","year":"2003","unstructured":"Shi, Q., J\u00e1J\u00e1, J.: Fast algorithms for a class of temporal range queries. In: Dehne, F., Sack, J.-R., Smid, M. (eds.) WADS 2003. LNCS, vol.\u00a02748, pp. 91\u2013102. Springer, Heidelberg (2003)"},{"key":"70_CR24","unstructured":"Shi, Q., JaJa, J.: Optimal and near-optimal algorithms for generalized intersection reporting on pointer machines. Technical Report CS-TR-4542, Institute of Advanced Computer Studies (UMIACS), University of Maryland (2003)"},{"key":"70_CR25","doi-asserted-by":"crossref","unstructured":"Shi, Q., JaJa, J.: Techniques for indexing and querying temporal observations for a collection of objects. Technical Report CS-TR-4503, Institute of Advanced Computer Studies (UMIACS), University of Maryland (2003)","DOI":"10.1007\/978-3-540-30551-4_70"},{"key":"70_CR26","unstructured":"Tao, Y., Papadias, D.: Efficient historical R-trees. In: Proceedings of the 13th Int. Conf. on Scientific and Statistical Database Management, pp. 223\u2013232 (2001)"},{"key":"70_CR27","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 Geo. Info. Systems (ACM-GIS), Bethesda, MD, pp. 1\u20137 (1998)","DOI":"10.1145\/288692.288695"},{"issue":"4","key":"70_CR28","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1145\/358841.358852","volume":"23","author":"J. Vuillemin","year":"1980","unstructured":"Vuillemin, J.: A unifying look at data structures. CACM\u00a023(4), 229\u2013239 (1980)","journal-title":"CACM"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30551-4_70","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T21:52:44Z","timestamp":1740261164000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30551-4_70"}},"subtitle":["(Extended Abstract)"],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540241317","9783540305514"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30551-4_70","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}