File Download

There are no files associated with this item.

  • Find it @ UNIST can give you direct access to the published full text of this article. (UNISTARs only)
Related Researcher

남범석

Nam, Beomseok
Read More

Views & Downloads

Detailed Information

Cited time in webofscience Cited time in scopus
Metadata Downloads

Multiple Range Query Optimization with Distributed Cache Indexing

Author(s)
Nam, BeomseokSussman. AlanAndrade, Henrique
Issued Date
2006-11-15
DOI
10.1145/1188455.1188560
URI
https://scholarworks.unist.ac.kr/handle/201301/46873
Fulltext
https://dl.acm.org/citation.cfm?doid=1188455.1188560
Citation
IEEE SC 2006 : International Conference for High Performance Computing, Networking, Storage, and Analysis
Abstract
MQO is a distributed multiple query processing middleware that can use resources available on the Grid to optimize query processing for data analysis and visualization applications. It does so by introducing one or more proxies that act as front-ends to a collection of backend servers. The basic idea behind this architecture is active semantic caching, whereby queries can leverage available cached results in the proxy either directly or through transformations. While this approach has been shown to speed up query evaluation under multi-client workloads, the caching infrastructure in the backend servers is not used well for query processing. Because this collective caching infrastructure scales with the number of servers, it is an important asset. In this paper, we describe a distributed multidimensional indexing scheme that enables the proxy to directly consider the cache contents available at the backend servers for query planning and scheduling. This approach is shown to produce better query plans and faster query response times as we experimentally demonstrate.
Publisher
IEEE/ACM

qrcode

Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.