IEEE Transactions on Visualization and Computer Graphics · 2019 · 19 citations · 33 references
ComputingComputer ScienceVisualizationData ManagementData VisualizationInteractive VisualizationDatabase ManagementDynamic Data StructuresQuery OptimizationQuery ProcessingReal-time VisualizationSpatial DatabasesAdaptive ArchitectureAdaptive Data ManagementData CubesData Management ArchitectureDynamic QueryingSpatiotemporal Data StructuresSpatiotemporal Data VisualizationSpatiotemporal Databases
Interactive visualization and exploration of large spatiotemporal data sets is difficult without carefully-designed data pre-processing and management tools. We propose a novel architecture for spatiotemporal data management. The architecture can dynamically update itself based on user queries. Datasets is stored in a tree-like structure to support memory sharing among cuboids in a logical structure of data cubes. An update mechanism is designed to create or remove cuboids on it, according to the analysis of the user queries, with the consideration of memory size limitation. Data structure is dynamically optimized according to different user queries. During a query process, user queries are recorded to predict the performance increment of the new cuboid. The creation or deletion of a cuboid is determined by performance increment. Experiment results show that our prototype system deliveries good performance towards user queries on different spatiotemporal datasets, which costing small memory size with comparable performance compared with other state-of-the-art algorithms.
33
Sanjay Ghemawat · Communications of the ACM · 2008 · 18.5K citations · Full text
Multidimensional binary search trees used for associative searching
Jon Bentley · Communications of the ACM · 1975 · 7.5K citations · Full text
Eunjoon Cho, Seth A. Myers, Jure Leskovec · 2011 · 2.9K citations
Joseph M. Hellerstein, Peter J. Haas, Helen J. Wang · 1997 · 928 citations · Full text