Nothing Special   »   [go: up one dir, main page]

skip to main content
research-article

SCOUT: prefetching for latent structure following queries

Published: 01 July 2012 Publication History

Abstract

Today's scientists are quickly moving from in vitro to in silico experimentation: they no longer analyze natural phenomena in a petri dish, but instead they build models and simulate them. Managing and analyzing the massive amounts of data involved in simulations is a major task. Yet, they lack the tools to efficiently work with data of this size.
One problem many scientists share is the analysis of the massive spatial models they build. For several types of analysis they need to interactively follow the structures in the spatial model, e.g., the arterial tree, neuron fibers, etc., and issue range queries along the way. Each query takes long to execute, and the total time for executing a sequence of queries significantly delays data analysis. Prefetching the spatial data reduces the response time considerably, but known approaches do not prefetch with high accuracy.
We develop SCOUT, a structure-aware method for prefetching data along interactive spatial query sequences. SCOUT uses an approximate graph model of the structures involved in past queries and attempts to identify what particular structure the user follows. Our experiments with neuro-science data show that SCOUT prefetches with an accuracy from 71% to 92%, which translates to a speedup of 4x-15x. SCOUT also improves the prefetching accuracy on datasets from other scientific domains, such as medicine and biology.

References

[1]
T. Achenbach et al. Accuracy of automatic airway morphometry in computed tomography-correlation of pathological findings. European Journal of Radiology, 81(1):183--188, 2010.
[2]
R. Agrawal and R. Srikant. Mining sequential patterns. In ICDE, pages 3--14, 1995.
[3]
D. Arthur et al. K-means has polynomial smoothed complexity. In FOCS, pages 405--414, 2009.
[4]
R. Azuma and G. Bishop. A frequency-domain analysis of head-motion prediction. In SIGGRAPH, pages 401--408, 1995.
[5]
A. Chan, R. Lau, and A. Si. A motion prediction method for mouse-based navigation. In CGI, pages 139--146, 2001.
[6]
S. Chen, A. Ailamaki, P. Gibbons, and T. Mowry. Improving hash join performance through prefetching. In ICDE, pages 116--127, 2004.
[7]
J. Chim et al. On caching and prefetching of virtual objects in distributed virtual environments. In MULTIMEDIA, pages 171--180, 1998.
[8]
J. Choi, S. H. Noh, S. L. Min, and Y. Cho. Towards application file-level characterization of block references: A case for fine-grained buffer management. In SIGMETRICS, pages 286--295, 2000.
[9]
T. T. Fu, S.-S. Hung, H.-L. Lin, D. Tsaih, and J. T. Chen. Intelligent-based latency reduction in 3d walkthrough. In ISTASC, pages 218--226, 2010.
[10]
V. Gaede et al. Multidimensional access methods. ACM Computing Surveys, 30(2):170--231, 1998.
[11]
L. Grinberg et al. Large-scale simulation of the human arterial tree. Clinical and Experimental Pharmacology and Physiology, 36(2):194--205, 2009.
[12]
N. Knafla. A prefetching technique for object-oriented databases. In BNCOD, pages 154--168, 1997.
[13]
D. Lee et al. Adaptation of a neighbor selection markov chain for prefetching tiled web gis data. In ADVIS, pages 213--222, 2002.
[14]
S. T. Leutenegger, M. A. Lopez, and J. Edgington. STR: a Simple and Efficient Algorithm for R-tree Packing. In ICDE, pages 497--506, 1997.
[15]
F. Li et al. On trip planning queries in spatial databases. In SSTD, pages 273--290, 2005.
[16]
C.-K. Luk and T. C. Mowry. Compiler-based prefetching for recursive data structures. In ASPLOS, pages 222--233, 1996.
[17]
H. Markram. The blue brain project. Nature Reviews Neuroscience, 7(2):153--160, 2006.
[18]
M. McAllister and J. Snoeyink. Medial axis generalization of river networks. Cartography and Geographic Information Science, 27(2):129--138, 2000.
[19]
S. Minglong et al. Multimap: Preserving disk locality for multidimensional datasets. In ICDE, pages 926--935, 2007.
[20]
A. Nanopoulos, D. Katsaros, and Y. Manolopoulos. A data mining algorithm for generalized web prefetching. IEEE Transaction on Knowledge and Data Engineering, 15(5):1155--1169, 2003.
[21]
S. Papadomanolakis et al. Efficient query processing on unstructured tetrahedral meshes. In SIGMOD, pages 551--562, 2006.
[22]
D.-J. Park and H.-J. Kim. Prefetch policies for large objects in a web-enabled gis application. Data and Knowledge Engineering, 37(1):65--84, 2001.
[23]
E. Perlman, R. Burns, M. Kazhdan, R. R. Murphy, W. P. Ball, and N. Amenta. Organization of data in non-convex spatial domains. In SSDBM, pages 342--359, 2010.
[24]
M. Rabinovich and O. Spatschek. Web caching and replication. SIGMOD Record, 32(4):107--108, 2002.
[25]
A. Roth, A. Moshovos, and G. S. Sohi. Dependence based prefetching for linked data structures. In ASPLOS, pages 115--126, 1998.
[26]
E. G. Said, E. B. Omar, and L. Robert. Data prefetching algorithm in mobile environments. European Journal of Scientific Research, 28(3):478--491, 2009.
[27]
F. Tauheed et al. Accelerating range queries for brain simulations. In ICDE, pages 218--230, 2012.
[28]
E. Thereska, M. Abd-El-Malek, J. J. Wylie, D. Narayanan, and G. R. Ganger. Informed data distribution selection in a self-predicting storage system. In ICAC '06, pages 187--198, 2006.
[29]
A. Walker et al. A bayesian framework for automated dataset retrieval in geographic information systems. In MMM, pages 138--150, 2004.
[30]
Z. Xiaohong, F. Shengzhong, and F. Jianping. A history-based motion prediction method for mouse-based navigation in 3d digital city. In GCC, pages 686--690, 2008.
[31]
J. Zhang and S. You. Dynamic tiled map services: Supporting query visualization of large-scale raster geospatial data. In COM.Geo, pages 191--198, 2010.

Cited By

View all
  • (2024)SeLeP: Learning Based Semantic Prefetching for Exploratory Database WorkloadsProceedings of the VLDB Endowment10.14778/3659437.365945817:8(2064-2076)Online publication date: 1-Apr-2024
  • (2019)Towards Democratizing Relational Data VisualizationProceedings of the 2019 International Conference on Management of Data10.1145/3299869.3314029(2025-2030)Online publication date: 25-Jun-2019
  • (2019)Evaluating interactive data systemsThe VLDB Journal — The International Journal on Very Large Data Bases10.1007/s00778-019-00589-229:1(119-146)Online publication date: 13-Nov-2019
  • Show More Cited By

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image Proceedings of the VLDB Endowment
Proceedings of the VLDB Endowment  Volume 5, Issue 11
July 2012
608 pages

Publisher

VLDB Endowment

Publication History

Published: 01 July 2012
Published in PVLDB Volume 5, Issue 11

Qualifiers

  • Research-article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)4
  • Downloads (Last 6 weeks)0
Reflects downloads up to 24 Nov 2024

Other Metrics

Citations

Cited By

View all
  • (2024)SeLeP: Learning Based Semantic Prefetching for Exploratory Database WorkloadsProceedings of the VLDB Endowment10.14778/3659437.365945817:8(2064-2076)Online publication date: 1-Apr-2024
  • (2019)Towards Democratizing Relational Data VisualizationProceedings of the 2019 International Conference on Management of Data10.1145/3299869.3314029(2025-2030)Online publication date: 25-Jun-2019
  • (2019)Evaluating interactive data systemsThe VLDB Journal — The International Journal on Very Large Data Bases10.1007/s00778-019-00589-229:1(119-146)Online publication date: 13-Nov-2019
  • (2019)Making data visualization more efficient and effective: a surveyThe VLDB Journal — The International Journal on Very Large Data Bases10.1007/s00778-019-00588-329:1(93-117)Online publication date: 19-Nov-2019
  • (2018)Evaluating Interactive Data SystemsProceedings of the 2018 International Conference on Management of Data10.1145/3183713.3197386(1637-1644)Online publication date: 27-May-2018
  • (2018)A Session-Based Approach to Fast-But-Approximate Interactive Data Cube ExplorationACM Transactions on Knowledge Discovery from Data10.1145/307064812:1(1-26)Online publication date: 13-Feb-2018
  • (2018)iExplore: Accelerating Exploratory Data Analysis by Predicting User IntentionDatabase Systems for Advanced Applications10.1007/978-3-319-91458-9_9(149-165)Online publication date: 21-May-2018
  • (2017)A hierarchical aggregation framework for efficient multilevel visual exploration and analysisSemantic Web10.3233/SW-1602268:1(139-179)Online publication date: 1-Jan-2017
  • (2016)T-PartProceedings of the 2016 International Conference on Management of Data10.1145/2882903.2915227(1553-1565)Online publication date: 26-Jun-2016
  • (2015)Overview of Data Exploration TechniquesProceedings of the 2015 ACM SIGMOD International Conference on Management of Data10.1145/2723372.2731084(277-281)Online publication date: 27-May-2015
  • Show More Cited By

View Options

Login options

Full Access

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media