{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T11:54:15Z","timestamp":1772106855012,"version":"3.50.1"},"reference-count":25,"publisher":"Elsevier","isbn-type":[{"value":"9780120884698","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1016\/b978-012088469-8.50068-1","type":"book-chapter","created":{"date-parts":[[2009,11,6]],"date-time":"2009-11-06T09:12:29Z","timestamp":1257498749000},"page":"768-779","source":"Crossref","is-referenced-by-count":186,"title":["+Query and Update Efficient B-Tree Based Indexing of Moving Objects"],"prefix":"10.1016","author":[{"given":"Christian S.","family":"Jensen","sequence":"first","affiliation":[]},{"given":"Dan","family":"Lin","sequence":"additional","affiliation":[]},{"given":"Beng Chin","family":"Ooi","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/B978-012088469-8.50068-1_bib1","series-title":"Proc. ACM SIGMOD","first-page":"322","article-title":"The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles","author":"Beckmann","year":"1990"},{"key":"10.1016\/B978-012088469-8.50068-1_bib2","series-title":"Proc. IDEAS","first-page":"44","article-title":"Nearest Neighbor and Reverse Nearest Neighbor Queries for Moving Objects","author":"Benetis","year":"2002"},{"key":"10.1016\/B978-012088469-8.50068-1_bib3","series-title":"Proc. MobiQuitous","article-title":"Efficient Tracking of Moving Objects with Precision Guarantees","author":"Civilis","year":"2004"},{"key":"10.1016\/B978-012088469-8.50068-1_bib4","series-title":"Proc. PODS","first-page":"247","article-title":"Fractals for Secondary Key Retrieval","author":"Faloutsos","year":"1989"},{"key":"10.1016\/B978-012088469-8.50068-1_bib5","series-title":"Proc. ACM SIGMOD","first-page":"47","article-title":"R-trees: A Dynamic Index Structure for Spatial Searching","author":"Guttman","year":"1984"},{"issue":"2","key":"10.1016\/B978-012088469-8.50068-1_bib6","first-page":"35","article-title":"Towards Increasingly Update Efficient Moving-Object Indexing","volume":"25","author":"Jensen","year":"2002","journal-title":"IEEE Data Eng. Bull."},{"key":"10.1016\/B978-012088469-8.50068-1_bib7","series-title":"Proc. PODS","first-page":"261","article-title":"On Indexing Mobile Objects","author":"Kollios","year":"1999"},{"key":"10.1016\/B978-012088469-8.50068-1_bib8","series-title":"Proc. VLDB","first-page":"134","article-title":"High-Concurrency Locking in R-Trees","author":"Kornacker","year":"1995"},{"key":"10.1016\/B978-012088469-8.50068-1_bib9","series-title":"Proc. MDM","first-page":"113","article-title":"Indexing the Current Positions of Moving Objects Using the Lazy Update R-Tree","author":"Kwon","year":"2002"},{"key":"10.1016\/B978-012088469-8.50068-1_bib10","series-title":"Proc. VLDB","first-page":"608","article-title":"Supporting Frequent Updates in R-Trees: A Bottom-Up Approach","author":"Lee","year":"2003"},{"issue":"2","key":"10.1016\/B978-012088469-8.50068-1_bib11","first-page":"40","article-title":"Spatio-Temporal Access Methods","volume":"26","author":"Mokbel","year":"2003","journal-title":"IEEE Data Eng. Bull."},{"issue":"1","key":"10.1016\/B978-012088469-8.50068-1_bib12","first-page":"124","article-title":"Analysis of the Clustering Properties of the Hilbert Space-Filling Curve","volume":"13","author":"Moon","year":"2001","journal-title":"IEEE TKDE"},{"key":"10.1016\/B978-012088469-8.50068-1_bib13","series-title":"Proc. of Int. Web GIS Workshop","article-title":"Fast Update and Efficient Retrieval: an Oxymoron on Moving Object Indexes","author":"Ooi","year":"2002"},{"key":"10.1016\/B978-012088469-8.50068-1_bib14","series-title":"Proc. ACM SIGMOD","article-title":"STRIPES: An Efficient Index for Predicted Trajectories","author":"Patel","year":"2004"},{"key":"10.1016\/B978-012088469-8.50068-1_bib15","series-title":"Proc. VLDB","first-page":"395","article-title":"Novel Approaches in Query Processing for Moving Objects","author":"Pfoser","year":"2000"},{"key":"10.1016\/B978-012088469-8.50068-1_bib16","first-page":"178","article-title":"Star-Tree: An Efficient Self-Adjusting Index for Moving Objects","author":"Procopiuc","year":"2002"},{"key":"10.1016\/B978-012088469-8.50068-1_bib17","series-title":"Proc. VLDB","first-page":"263","article-title":"Integrating the UB-Tree Into a Database System Kernel","author":"Ramsak","year":"2000"},{"key":"10.1016\/B978-012088469-8.50068-1_bib18","series-title":"Proc. ACM SIGMOD","first-page":"17","article-title":"Direct Spatial Search on Pictorial Databases Using Packed R-Trees","author":"Roussopoulos","year":"1985"},{"key":"10.1016\/B978-012088469-8.50068-1_bib19","series-title":"Proc. ACM SIGMOD","first-page":"331","article-title":"Indexing the Positions of Continuously Moving Objects","author":"Saltenis","year":"2000"},{"issue":"2","key":"10.1016\/B978-012088469-8.50068-1_bib20","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1145\/356924.356930","article-title":"The Quadtree and Related Hierarchical Data Structures","volume":"16","author":"Samet","year":"1984","journal-title":"ACM Comp. Surv."},{"key":"10.1016\/B978-012088469-8.50068-1_bib21","series-title":"The Proc. ACM SIGMOD","first-page":"416","article-title":"Performance of B-Tree Concurrency Control Algorithms","author":"Srinivasan","year":"1991"},{"key":"10.1016\/B978-012088469-8.50068-1_bib22","series-title":"Proc. VLDB","first-page":"790","article-title":"The TPR*-Tree: An Optimized Spatio-Temporal Access Method for Predictive Queries","author":"Tao","year":"2003"},{"key":"10.1016\/B978-012088469-8.50068-1_bib23","unstructured":"Y. Tao, J. Zhang, D. Papadias, and N. Mamoulis. An Efficient Cost Model for Optimization of Nearest Neighbor Search in Low and Medium Dimensional Spaces. IEEE TKDE, to appear."},{"issue":"3","key":"10.1016\/B978-012088469-8.50068-1_bib24","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1093\/comjnl\/41.3.185","article-title":"A Quadtree Based Dynamic Attribute Indexing Method","volume":"41","author":"Tayeb","year":"1998","journal-title":"The Computer Journal"},{"key":"10.1016\/B978-012088469-8.50068-1_bib25","series-title":"Proc. VLDB","first-page":"421","article-title":"Indexing the Distance: An Efficient Method to KNN Processing","author":"Yu","year":"2001"}],"container-title":["Proceedings 2004 VLDB Conference"],"original-title":[],"language":"en","deposited":{"date-parts":[[2018,12,15]],"date-time":"2018-12-15T14:27:10Z","timestamp":1544884030000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/B9780120884698500681"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9780120884698"],"references-count":25,"aliases":["10.1016\/b978-012088469-8\/50068-1"],"URL":"https:\/\/doi.org\/10.1016\/b978-012088469-8.50068-1","relation":{},"subject":[],"published":{"date-parts":[[2004]]}}}