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

被引:128
|
作者
Cudre-Mauroux, Philippe
Wu, Eugene
Madden, Samuel
机构
来源
26TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING ICDE 2010 | 2010年
关键词
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 条
  • [31] Empirical modeling of very large data sets using neural networks
    Owens, AJ
    IJCNN 2000: PROCEEDINGS OF THE IEEE-INNS-ENNS INTERNATIONAL JOINT CONFERENCE ON NEURAL NETWORKS, VOL VI, 2000, : 302 - 307
  • [32] A strategy for compression and analysis of very large remote sensing data sets
    Braverman, A
    NONLINEAR ESTIMATION AND CLASSIFICATION, 2003, 171 : 429 - 441
  • [33] DESCRY: A density based clustering algorithm for very large data sets
    Angiulli, F
    Pizzuti, C
    Ruffolo, M
    INTELLIGENT DAA ENGINEERING AND AUTOMATED LEARNING IDEAL 2004, PROCEEDINGS, 2004, 3177 : 203 - 210
  • [34] MUSI: an integrated system for identifying multiple specificity from very large peptide or nucleic acid data sets
    Kim, TaeHyung
    Tyndel, Marc S.
    Huang, Haiming
    Sidhu, Sachdev S.
    Bader, Gary D.
    Gfeller, David
    Kim, Philip M.
    NUCLEIC ACIDS RESEARCH, 2012, 40 (06)
  • [35] GCOTraj: A storage approach for historical trajectory data sets using grid cells ordering
    Yang, Shengxun
    He, Zhen
    Chen, Yi-Ping Phoebe
    INFORMATION SCIENCES, 2018, 459 : 1 - 19
  • [36] A memory-efficient adaptive Huffman coding algorithm for very large sets of symbols
    Pigeon, S
    Bengio, Y
    DCC '98 - DATA COMPRESSION CONFERENCE, 1998, : 568 - 568
  • [37] SharkDB:An In-Memory Storage System for Massive Trajectory Data
    Wang, Haozhou
    Zheng, Kai
    Zhou, Xiaofang
    Sadiq, Shazia
    SIGMOD'15: PROCEEDINGS OF THE 2015 ACM SIGMOD INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA, 2015, : 1099 - 1104
  • [38] Using low-memory representations to cluster very large data sets
    Littau, D
    Boley, D
    PROCEEDINGS OF THE THIRD SIAM INTERNATIONAL CONFERENCE ON DATA MINING, 2003, : 341 - 345
  • [39] Analyzing Electric Vehicle Energy Consumption Using Very Large Data Sets
    Krogh, Benjamin
    Andersen, Ove
    Torp, Kristian
    DATABASE SYSTEMS FOR ADVANCED APPLICATIONS, DASFAA 2015, PT II, 2015, 9050 : 471 - 487
  • [40] Very Fast Interactive Visualization of Large Sets of High-dimensional Data
    Dzwinel, Witold
    Wcislo, Rafal
    INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE, ICCS 2015 COMPUTATIONAL SCIENCE AT THE GATES OF NATURE, 2015, 51 : 572 - 581