Academic
Publications
Indexing the Positions of Continuously Moving Objects

Indexing the Positions of Continuously Moving Objects,10.1145/342009.335427,Sigmod Record,Simonas Saltenis,Christian S. Jensen,Scott T. Leutenegger,Ma

Indexing the Positions of Continuously Moving Objects   (Citations: 534)
BibTex | RIS | RefWorks Download
The coming years will witness dramatic advances in wireless communications as well as positioning technologies. As a result, tracking the changing positions of objects capable of continuous movement is becoming increasingly feasible and necessary. The present paper proposes a novel, R -tree based indexing technique that supports the efficient querying of the current and projected future positions of such moving objects. The technique is capable of indexing objects moving in one-, two-, and three-dimensional space. Update algorithms enable the index to accommodate a dynamic data set, where objects may appear and disappear, and where changes occur in the anticipated positions of existing objects. A comprehensive performance study is reported.
Journal: Sigmod Record , vol. 29, no. 2, pp. 331-342, 2000
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
    • ...Motivated by this, in this work, we propose a new spatiotemporal index structure based on TPR-tree [5] that can contain privacy-preserving information on it. This index structure deals with not only spatial but also temporal obfuscation, so we term it OST-tree, where OST stands for Obfuscating Spatio-Temporal data...
    • ...For TPR-tree [5], it inherits the idea of parametric bounding rectangles in R-tree [15] to create time-parameterized bounding rectangle (tpbr)...
    • ...We traverse the OST-tree from the root node down to the leaf node to place the new object in the suitable leaf node (by applying the insertion algorithm as shown in [5,8]) and, at the same time, recursively compare the degree of accuracy of user’s position (∆s) with a spatial extent of each node (N ■ ) in the insertion path to find the appropriate node overlaying privacy information...

    Quoc Cuong Toet al. OST-Tree: An Access Method for Obfuscating Spatio-Temporal Data in Loc...

    • ...Data points are indexed by an extended TPS-tree that integrates non-spatial dynamic attributes and static attributes as well as dynamic distances indexed by traditional TPS-tree [35]...

    Xi Guoet al. Direction-based surrounder queries for mobile recommendations

    • ...To overcome this challenge, using the trajectory of moving POIs to presume the movement of objects has been used (e.g., the TPR-Tree and its variants [25], [21] and the B x tree [13])...

    Haojun Wanget al. Processing of Continuous Location-Based Range Queries on Moving Object...

    • ...Therefore, indexing moving objects databases was the aim of many works [16,17]...

    Joaquim P. Silvaet al. A brief survey on online analysis of movement data

    • ...At present, NNQ algorithms can be classified into two categories: (1) The NNQ algorithm of track forecast based on historical position of moving object [1-4]...

    Zhongjun Duet al. Nearest Neighbor Query of Moving Objects Based on Spherical Safe Area

Sort by: