TY - GEN
T1 - Indexing the trajectories of moving objects in symbolic indoor space
AU - Jensen, Christian S.
AU - Lu, Hua
AU - Yang, Bin
PY - 2009
Y1 - 2009
N2 - Indoor spaces accommodate large populations of individuals. With appropriate indoor positioning, e.g., Bluetooth and RFID, in place, large amounts of trajectory data result that may serve as a foundation for a wide variety of applications, e.g., space planning, way finding, and security. This scenario calls for the indexing of indoor trajectories. Based on an appropriate notion of indoor trajectory and definitions of pertinent types of queries, the paper proposes two R-tree based structures for indexing object trajectories in symbolic indoor space. The RTR-tree represents a trajectory as a set of line segments in a space spanned by positioning readers and time. The TP 2R-tree applies a data transformation that yields a representation of trajectories as points with extension along the time dimension. The paper details the structure, node organization strategies, and query processing algorithms for each index. An empirical performance study suggests that the two indexes are effective, efficient, and robust. The study also elicits the circumstances under which our proposals perform the best.
AB - Indoor spaces accommodate large populations of individuals. With appropriate indoor positioning, e.g., Bluetooth and RFID, in place, large amounts of trajectory data result that may serve as a foundation for a wide variety of applications, e.g., space planning, way finding, and security. This scenario calls for the indexing of indoor trajectories. Based on an appropriate notion of indoor trajectory and definitions of pertinent types of queries, the paper proposes two R-tree based structures for indexing object trajectories in symbolic indoor space. The RTR-tree represents a trajectory as a set of line segments in a space spanned by positioning readers and time. The TP 2R-tree applies a data transformation that yields a representation of trajectories as points with extension along the time dimension. The paper details the structure, node organization strategies, and query processing algorithms for each index. An empirical performance study suggests that the two indexes are effective, efficient, and robust. The study also elicits the circumstances under which our proposals perform the best.
UR - https://www.scopus.com/pages/publications/70350400230
U2 - 10.1007/978-3-642-02982-0_15
DO - 10.1007/978-3-642-02982-0_15
M3 - 会议稿件
AN - SCOPUS:70350400230
SN - 3642029817
SN - 9783642029813
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 208
EP - 227
BT - Advances in Spatial and Temporal Databases - 11th International Symposium, SSTD 2009, Proceedings
T2 - 11th International Symposium on Spatial and Temporal Databases, SSTD 2009
Y2 - 8 July 2009 through 10 July 2009
ER -