TrajS']jStore: An Adaptive Storage System for Very Large Trajectory Data Sets

被引:128
|
作者
Cudre-Mauroux, Philippe
Wu, Eugene
Madden, Samuel
机构
关键词
D O I
10.1109/ICDE.2010.5447829
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
The rise of GPS and broadband-speed wireless devices has led to tremendous excitement about a range of applications broadly characterized as "location based services". Current database storage systems, however, are inadequate for manipulating the very large and dynamic spatio-temporal data sets required to support such services. Proposals in the literature either present new indices without discussing how to cluster data, potentially resulting in many disk seeks for lookups of densely packed objects, or use static quadtrees or other partitioning structures, which become rapidly suboptimal as the data or queries evolve. As a result of these performance limitations, we built TrajStore, a dynamic storage system optimized for efficiently retrieving all data in a particular spatiotemporal region. TrajStore maintains an optimal index on the data and dynamically co-locates and compresses spatially and temporally adjacent segments on disk. By letting the storage layer evolve with the index, the system adapts to incoming queries and data and is able to answer most queries via a very limited number of I/Os, even when the queries target regions containing hundreds or thousands of different trajectories.
引用
收藏
页码:109 / 120
页数:12
相关论文
共 50 条
  • [1] A HYBRID STRUCTURE FOR THE STORAGE AND MANIPULATION OF VERY LARGE SPATIAL DATA SETS
    PEUQUET, DJ
    COMPUTER VISION GRAPHICS AND IMAGE PROCESSING, 1983, 24 (01): : 14 - 27
  • [2] Data mining from extreme data sets: Very large and/or very skewed data sets
    Hall, LO
    2001 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS, VOLS 1-5: E-SYSTEMS AND E-MAN FOR CYBERNETICS IN CYBERSPACE, 2002, : 2555 - 2555
  • [3] Joining very large data sets
    Johnson, T
    Chatziantoniou, D
    DATABASES IN TELECOMMUNICATIONS, 2000, 1819 : 118 - 132
  • [4] TrajS']jSpark: A Scalable and Efficient In-Memory Management System for Big Trajectory Data
    Zhang, Zhigang
    Jin, Cheqing
    Mao, Jiali
    Yang, Xiaolin
    Zhou, Aoying
    WEB AND BIG DATA, APWEB-WAIM 2017, PT I, 2017, 10366 : 11 - 26
  • [5] PCA and PLS with very large data sets
    Kettaneh, N
    Berglund, A
    Wold, S
    COMPUTATIONAL STATISTICS & DATA ANALYSIS, 2005, 48 (01) : 69 - 85
  • [6] Clustering Very Large Dissimilarity Data Sets
    Hammer, Barbara
    Hasenfuss, Alexander
    ARTIFICIAL NEURAL NETWORKS IN PATTERN RECOGNITION, PROCEEDINGS, 2010, 5998 : 259 - +
  • [7] Managing very large distributed data sets on a data grid
    Branco, Miguel
    Zaluska, Ed
    de Roure, David
    Lassnig, Mario
    Garonne, Vincent
    CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2010, 22 (11): : 1338 - 1364
  • [8] A clustering method for very large mixed data sets
    Sánchez-Díaz, G
    Ruiz-Shulcloper, J
    2001 IEEE INTERNATIONAL CONFERENCE ON DATA MINING, PROCEEDINGS, 2001, : 643 - 644
  • [9] Accelerating the SVM learning for very large data sets
    Sung, Eric
    Yan, Zhu
    Li Xuchun
    18TH INTERNATIONAL CONFERENCE ON PATTERN RECOGNITION, VOL 2, PROCEEDINGS, 2006, : 484 - +
  • [10] Phase Unwrapping for Very Large Interferometric Data Sets
    Zhang, Kui
    Ge, Linlin
    Hu, Zhe
    Alex Hay-Man Ng
    Li, Xiaojing
    Rizos, Chris
    IEEE TRANSACTIONS ON GEOSCIENCE AND REMOTE SENSING, 2011, 49 (10): : 4048 - 4061