ACM Home Page
Please provide us with feedback. Feedback
Multiple range query optimization with distributed cache indexing
Full text HtmlHtml (2 KB),  PdfPdf (223 KB)
Source Conference on High Performance Networking and Computing archive
Proceedings of the 2006 ACM/IEEE conference on Supercomputing table of contents
Tampa, Florida
SESSION: Technical papers table of contents
Article No. 100  
Year of Publication: 2006
ISBN:0-7695-2700-0
Authors
Beomseok Nam  University of Maryland, College Park, MD
Henrique Andrade  IBM T. J. Watson Research Center, Hawthorne, NY
Alan Sussman  University of Maryland, College Park, MD
Sponsors
IEEE : Institute of Electrical and Electronics Engineers
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 7,   Downloads (12 Months): 49,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1188455.1188560
What is a DOI?

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
 
3
Bellman, R. E. 1961. Adaptive Control Processes: A GuidedTour. Princeton University Press, NJ.
 
4
 
5
6
 
7
 
8
9
10
 
11
 
12
13
 
14
 
15
 
16
Nam, B., and Sussman, A. 2006. DiST: Fully decentralized indexing for querying distributed multidimensional datasets. In Proceedings of 20th IEEE International Parallel and Distributed Processing Symposium (IPDPS).
17
 
18
 
19
 
20
Wessels, D., and Claffy, K. C. 1998. ICP and the Squid web cache. IEEE Journal on Selected Areas in Communications 16, 3 (Apr.), 345--357.
 
21


Collaborative Colleagues:
Beomseok Nam: colleagues
Henrique Andrade: colleagues
Alan Sussman: colleagues