Fast, Ad Hoc Query Evaluations over Multidimensional Geospatial Datasets

被引:13
|
作者
Malensek, Matthew [1 ]
Pallickara, Sangmi [1 ]
Pallickara, Shrideep [1 ]
机构
[1] Colorado State Univ, Dept Comp Sci, Ft Collins, CO 80523 USA
基金
美国国家科学基金会;
关键词
Approximate query processing; ad hoc exploration; multidimensional data; distributed hash tables; STORAGE; SEARCH;
D O I
10.1109/TCC.2015.2398437
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Networked observational devices and remote sensing equipment continue to proliferate and contribute to the accumulation of extreme-scale datasets. Both the rate and resolution of the readings produced by these devices have grown over time, exacerbating the issues surrounding their storage and management. In many cases, the sheer scale of the information being maintained makes timely analysis infeasible due to the computational workloads required to process the data. While distributed solutions provide a scalable way to cope with data volumes, the communication and latency involved when inspecting large portions of an overall dataset limit applications that require frequent or rapid responses to incoming queries. This study investigates the challenges associated with providing approximate or exploratory answers to distributed queries. In many situations, this requires striking a balance between response times and error rates to produce meaningful results. To enable these use cases, we outline several expressive query constructs and describe their implementation; rather than relying on summary tables or pre-computed samples, our solution involves a coarse-grained global index that maintains statistics and models the relationships across dimensions in the dataset. To illustrate the benefits of these techniques, we include performance benchmarks on a real-world dataset in a production environment.
引用
下载
收藏
页码:28 / 42
页数:15
相关论文
共 50 条
  • [41] Query modification based on relevance back-propagation in an ad hoc environment
    Boughanem, M.
    Chrisment, C.
    Soulé-Dupuy, C.
    Information Processing and Management, 1999, 35 (02): : 121 - 139
  • [42] Two-Phase Query Optimization in Mobile Ad Hoc Wireless Networks
    Han Ke
    2009 IEEE INTERNATIONAL CONFERENCE ON INTELLIGENT COMPUTING AND INTELLIGENT SYSTEMS, PROCEEDINGS, VOL 3, 2009, : 515 - 520
  • [43] A distributed location service for reducing query failures in geographic ad hoc routing
    Chou, CH
    Ssu, KF
    Jiau, HC
    11TH PACIFIC RIM INTERNATIONAL SYMPOSIUM ON DEPENDABLE COMPUTING, PROCEEDINGS, 2005, : 333 - 340
  • [44] Document Expansion, Query Translation and Language Modeling for Ad-Hoc IR
    Leveling, Johannes
    Zhou, Dong
    Jones, Gareth J. F.
    Wade, Vincent
    MULTILINGUAL INFORMATION ACCESS EVALUATION I: TEXT RETRIEVAL EXPERIMENTS, 2010, 6241 : 58 - +
  • [45] Query Stride technique for on-demand routing protocols in ad hoc networks
    Choi, Y
    Park, D
    PDPTA'2001: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, 2001, : 257 - 263
  • [46] Context-aware query processing in ad-hoc environments of peers
    Department of Computer Science, University of Ioannina, Ioannina, Greece
    J. Electr. Commer. Organ., 2008, 1 (38-62):
  • [47] Query localization techniques for on-demand routing protocols in ad hoc networks
    Castañeda, R
    Das, SR
    Marina, MK
    WIRELESS NETWORKS, 2002, 8 (2-3) : 137 - 151
  • [48] Balancing the tradeoffs between data accessibility and query delay in ad hoc networks
    Yin, LZ
    Cao, GH
    23RD IEEE INTERNATIONAL SYMPOSIUM ON RELIABLE DISTRIBUTED SYSTEMS, PROCEEDINGS, 2004, : 289 - 298
  • [49] Query modification based on relevance back-propagation in an ad hoc environment
    Boughanem, M
    Chrisment, C
    Soulé-Dupuy, C
    INFORMATION PROCESSING & MANAGEMENT, 1999, 35 (02) : 121 - 139
  • [50] Conditional variational autoencoder for query expansion in ad-hoc information retrieval
    Ou, Wei
    Huynh, Van-Nam
    INFORMATION SCIENCES, 2024, 652