{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:10:17Z","timestamp":1735690217759,"version":"3.32.0"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2005,5,1]],"date-time":"2005-05-01T00:00:00Z","timestamp":1114905600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Distrib Parallel Databases"],"published-print":{"date-parts":[[2005,5]]},"DOI":"10.1007\/s10619-005-6830-2","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T12:02:04Z","timestamp":1114689724000},"page":"215-249","source":"Crossref","is-referenced-by-count":8,"title":["An Indexing Method for Answering Queries on Moving Objects"],"prefix":"10.1007","volume":"17","author":[{"given":"Khaled","family":"Elbassioni","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amr","family":"Elmasry","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ibrahim","family":"Kamel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6830_CR1","doi-asserted-by":"crossref","unstructured":"P.K. Agarwal, L. Arge, and J. Erickson, \u201cIndexing moving points,\u201d in 19th ACM-PODS Symposium on Principles of Database Systems, 2000, pp. 175\u2013186.","DOI":"10.1145\/335168.335220"},{"key":"6830_CR2","doi-asserted-by":"crossref","unstructured":"P.K. Agarwal, L. Arge, J. Erickson, P. Franciosa, and J.S. Vitter, \u201cEfficient searching with linear constraints,\u201d 17th ACM-PODS Symposium on Principles of Database Systems, 1998, pp. 169\u2013178.","DOI":"10.1145\/275487.275506"},{"key":"6830_CR3","doi-asserted-by":"crossref","unstructured":"R. Alonso and H.F. Korth, \u201cDatabase system issues in nomadic computing,\u201d in ACM-SIGMOD International Conference on Management of Data, 1993, pp. 388\u2013392.","DOI":"10.1145\/170035.170092"},{"issue":"9","key":"6830_CR4","doi-asserted-by":"crossref","first-page":"1116","DOI":"10.1145\/48529.48535","volume":"31","author":"A. Aggarwal","year":"1988","unstructured":"A. Aggarwal and J.S. Vitter, \u201cThe input\/output complexity of sorting and related problems,\u201d Communications of the ACM, vol. 31, no. 9, pp. 1116\u20131127, 1988.","journal-title":"Communications of the ACM"},{"key":"6830_CR5","unstructured":"ArcView GIS, ArcView Tracking Analyst, 1998."},{"key":"6830_CR6","doi-asserted-by":"crossref","unstructured":"N. Beckmann, H.P. Kriegel, R. Schneider, and B. Seeger, \u201cThe R*-tree: An efficient and robust access method for points and rectangles,\u201d in ACM-SIGMOD International Conference on Management of Data, 1990, pp. 322\u2013331.","DOI":"10.1145\/93597.98741"},{"key":"6830_CR7","doi-asserted-by":"crossref","unstructured":"B. Chazelle and B. Rosenberg, \u201cLower bounds on the complexity of simplex range reporting on a pointer machine,\u201d in 19th ICALP International Colloquium on Automata, Languages and Programming, LNCS, vol. 693, 1992, pp. 439\u2013449.","DOI":"10.1007\/3-540-55719-9_95"},{"key":"6830_CR8","unstructured":"K. Elbassioni, A. Elmasry, and I. Kamel, \u201cEfficient answering of polyhedral queries in \u211dd using BBS-trees,\u201d in 14th CCCG Canadian Conference on Computational Geometry, 2002, pp. 54\u201357."},{"key":"6830_CR9","first-page":"425","volume":"2572","author":"K. Elbassioni","year":"2003","unstructured":"K. Elbassioni, A. Elmasry, and I. Kamel, \u201cAn efficient indexing scheme for multi-dimensional moving objects,\u201d in 9th ICDT International Conference on Database Theory, LNCS 2572, 2003, pp. 425\u2013439.","journal-title":"9th ICDT International Conference on Database Theory, LNCS"},{"issue":"2","key":"6830_CR10","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1145\/280277.280279","volume":"30","author":"V. Gaede","year":"1998","unstructured":"V. Gaede and O. Gunther, \u201cMultidimensional access methods,\u201d ACM Computing Serveys, vol. 30, no. 2, pp. 170\u2013231, 1998.","journal-title":"ACM Computing Serveys"},{"key":"6830_CR11","doi-asserted-by":"crossref","unstructured":"J. Goldstein, R. Ramakrishnan, U. Shaft, and J.B. Yu, \u201cProcessing queries by linear constraints,\u201d in 16th ACM-PODS Symposium on Principles of Database Systems, 1997, pp. 257\u2013267.","DOI":"10.1145\/263661.263689"},{"key":"6830_CR12","doi-asserted-by":"crossref","unstructured":"A. Guttman, \u201cR-trees: A dynamic index structure for spatial searching,\u201d in ACM-SIGMOD International Conference on Management of Data, 1984, pp. 47\u201357.","DOI":"10.1145\/602259.602266"},{"key":"6830_CR13","doi-asserted-by":"crossref","unstructured":"G. Kollios, D. Gunopulos, and V. Tsotras, \u201cOn Indexing Mobile Objects.\u201d in 18th ACM-PODS Symposium on Principles of Databases Systems, 1999, pp. 261\u2013272.","DOI":"10.1145\/303976.304002"},{"key":"6830_CR14","unstructured":"H.V. Jagadish, \u201cOn Indexing Line Segments,\u201d in 16th VLDB International Conference on Very Large Data Bases, 1990, pp. 614\u2013625."},{"key":"6830_CR15","doi-asserted-by":"crossref","unstructured":"I. Kamel and C. Faloutsos, \u201cOn packing R-trees,\u201d in 2nd International Conference on Information and Knowledge Management, 1993, pp. 490\u2013499.","DOI":"10.1145\/170088.170403"},{"key":"6830_CR16","doi-asserted-by":"crossref","unstructured":"V. Kouramajian, I. Kamel, R. Elmasri, and S. Waheed, \u201cThe time index+: An incremental access structure for temporal databases,\u201d in 3rd International Conference on Information and Knowledge Management, 1994, pp. 296\u2013303.","DOI":"10.1145\/191246.191298"},{"key":"6830_CR17","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/BF02293051","volume":"8","author":"J. Matou\u0161ek","year":"1992","unstructured":"J. Matou\u0161ek, \u201cEfficient partition trees,\u201d Discrete and Computational Geometry, vol. 8, pp. 315\u2013334, 1992.","journal-title":"Discrete and Computational Geometry"},{"key":"6830_CR18","doi-asserted-by":"crossref","unstructured":"S. Saltenis, C.S. Jensen, S.T. Leutenegger, and M.A. Lopez, \u201cIndexing the positions of continuously moving objects,\u201d in Proc. ACM-SIGMOD International Conference on Management of Data, 2000, pp. 331\u2013342.","DOI":"10.1145\/342009.335427"},{"issue":"2","key":"6830_CR19","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1145\/319806.319816","volume":"31","author":"B. Salzberg","year":"1999","unstructured":"B. Salzberg and V.J. Tsotras, \u201cA comparison of access methods for time evolving data,\u201d ACM Computing Surveys, vol. 31, no. 2, pp. 158\u2013221, 1999.","journal-title":"ACM Computing Surveys"},{"key":"6830_CR20","unstructured":"A. Schrijver, Theory of Linear and Integer Programming, 1986."},{"issue":"3","key":"6830_CR21","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1093\/comjnl\/41.3.185","volume":"41","author":"J. Tayeb","year":"1998","unstructured":"J. Tayeb, O. Ulusoy, and O. Wolfson, \u201cA quadtree-based dynamic attribute indexing method,\u201d The Computer Journal, vol. 41, no. 3, pp. 185\u2013200, 1998.","journal-title":"The Computer Journal"}],"container-title":["Distributed and Parallel Databases"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10619-005-6830-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10619-005-6830-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10619-005-6830-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,31]],"date-time":"2024-12-31T23:34:42Z","timestamp":1735688082000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10619-005-6830-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,5]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2005,5]]}},"alternative-id":["6830"],"URL":"https:\/\/doi.org\/10.1007\/s10619-005-6830-2","relation":{},"ISSN":["0926-8782","1573-7578"],"issn-type":[{"type":"print","value":"0926-8782"},{"type":"electronic","value":"1573-7578"}],"subject":[],"published":{"date-parts":[[2005,5]]}}}