Processing math: 100%
We use cookies to improve your experience with our site.

Indexed in:

SCIE, EI, Scopus, INSPEC, DBLP, CSCD, etc.

Submission System
(Author / Reviewer / Editor)
Hua-Ming Liao, Guo-Shun Pei. Cache-Based Aggregate Query Shipping: An Efficient Scheme of Distributed OLAP Query Processing[J]. Journal of Computer Science and Technology, 2008, 23(6): 905-915.
Citation: Hua-Ming Liao, Guo-Shun Pei. Cache-Based Aggregate Query Shipping: An Efficient Scheme of Distributed OLAP Query Processing[J]. Journal of Computer Science and Technology, 2008, 23(6): 905-915.

Cache-Based Aggregate Query Shipping: An Efficient Scheme of Distributed OLAP Query Processing

More Information
  • Received Date: January 23, 2008
  • Revised Date: July 16, 2008
  • Published Date: November 09, 2008
  • Our study introduces a novel distributed query planrefinement phase in an enhanced architecture of distributed queryprocessing engine (DQPE). Query plan refinement generates potentiallyefficient distributed query plan by reusable aggregate query shipping(RAQS) approach. The approach improves response time at the cost ofpre-processing time. If the overheads could not be compensated byquery results reusage, RAQS is no more favorable. Therefore a globalcost estimation model is employed to get proper operators: RR\_Agg,R\_Agg, or R\_Scan.For the purpose of reusing results of queries with aggregate function in distributedquery processing, a multi-level hybrid view caching (HVC) scheme isintroduced. The scheme retains the advantages of partial match andaggregate query results caching. By our solution, evaluations withdistributed TPC-H queries show significant improvement on averageresponse time.
  • [1] Chaudhuri S, Shim K. Including group-by in query optimization. In {\it Proc. VLDB}, Santiago, Chile, 1994, pp.354--366.
    [2]
    } Dar S, Franklin M J, Jonsson B T, Srivastava D, Tan M. Semantic data caching and replacement. In {\it Proc. VLDB}, Bombay, India, 1996, pp.330--341.
    [3]
    } Amiri K, Park S, Tewari R, Padmanabhan S. DBProxy: A dynamic data cache for web applications. In {\it Proc. ICDE}, Bangalore, India, March 2003, pp.821--831.
    [4]
    } Li R, Zhou M, Liao H. Request window: An approach to improve throughput of RDBMS-based data integration system by utilizing data sharing across concurrent distributed queries. In {\it Proc. VLDB}, Vienna, Austria, September 2007, pp.1219--1230.
    [5]
    } Kotidis Y, Roussopoulos N. DynaMat: A dynamic view management system for data warehouses., In {\it Proc. ACM-SIGMOD}, Philadelphia, Pennsylvania, USA, June 1999, pp.371--382.
    [6]
    } Deshpande P, Ramasamy K, Shukla A, Naughton J F. Caching multidimensional queries using chunks. In {\it Proc. ACM-SIGMOD}, Seattle, Washington, United States, 1998, pp.259--270.
    [7]
    } Scheuermann P, Shim J, Vingralek R. WATCHMAN: A data warehouse intelligent cache manager. In {\it Proc. VLDB}, Bombay, India, 1996, pp.51--62.
    [8]
    } TPC Homepage. TPC-H benchmark. www.tpc.org.
    [9]
    } Josifovski V, Schwarz P, Haas L, Lin E. Garlic: A new flavor of federated query processing for DB2. In {\it Proc. SIGMOD}, Madison, Wisconsin, USA, June 2002, pp.524--532.
    [10]
    } Kossmann D. The state of the art in distributed query processing. \it ACM Computing Surveys, \rm 2000, 32(4): 422--469.
    [11]
    } Jonsson B, Arinbjarnar M, Borsson B, Franklin M J, Srivastava D. Performance and overhead of semantic cache management. \it ACM Transactions on Internet Technology (TOIT), \rm 2006, 6(3): 302--331.
    [12]
    } Amiri K, Park S, Tewari R, Padmanabhan S. Scalable template-based query containment checking for web semantic caches. In {\it Proc. ICDE}, Bangalore, India, March 2003, pp.493--504.
    [13]
    } Hao X W, Zhang T, Li L. Optimization technology of query processing based on logic rules in semantic caching. \it Chinese Journal of Computers, \rm 2005, 28(7): 1096--1103. (In Chinese)
    [14]
    } Franklin M J, Jonsson B T, Kossmann D. Performance tradeoffs for client-server query processing. In {\it Proc. SIGMOD}, Montreal, Quebec, Canada, June 1996, pp.149--160.
    [15]
    } Zhou J, Larson P A, Freytag J C, Lehner W. Efficient exploitation of similar subexpressions for query processing. In \it Proc. ACM-SIGMOD, \rm Beijing, China, June 2007, pp.533--544.
  • Related Articles

    [1]Jun-Ki Min, Mi-Young Lee. DICE: An Effective Query Result Cache for Distributed Storage Systems[J]. Journal of Computer Science and Technology, 2010, 25(5): 933-944.
    [2]Guo-Liang Li, Jian-Hua Feng. An Effective Semantic Cache for Exploiting XPath Query/View Answerability[J]. Journal of Computer Science and Technology, 2010, 25(2): 347-361.
    [3]SHEN Yidong. A Theory of Hybrid Diagnosis[J]. Journal of Computer Science and Technology, 1999, 14(4): 363-371.
    [4]Rajesh Narang, K.D. Sharma. View Creation for Queriesin Object Oriented Databases[J]. Journal of Computer Science and Technology, 1999, 14(4): 349-362.
    [5]Zhang Yongyue, Peng Zhenyun, You Suya, Xu Guangyou. A Multi-View Face Recognition System[J]. Journal of Computer Science and Technology, 1997, 12(5): 400-407.
    [6]Xia Yunjun. Theory and Practice of the Stereo-View on the CRT Screen[J]. Journal of Computer Science and Technology, 1996, 11(5): 519-528.
    [7]Peng Chenglian. Combining Gprof and Event-Driven Monitoring for Analyzing Distributed Programs:A Rough View of NCSA Mosaic[J]. Journal of Computer Science and Technology, 1996, 11(4): 427-432.
    [8]Yang Changgui, Chen Yuian, Sun Jiaghang. Advanced Geometric Modeler with Hybrid Representation[J]. Journal of Computer Science and Technology, 1996, 11(1): 1-8.
    [9]Zhou Aoying, Shi Baile. Query Optimization for Deductive Databases[J]. Journal of Computer Science and Technology, 1995, 10(2): 134-148.
    [10]Chen Shicheng, Zhou Zhongyi. On Interrupt Strategy from the Point of View of System Efficiency[J]. Journal of Computer Science and Technology, 1987, 2(3): 217-225.

Catalog

    Article views (25) PDF downloads (2068) Cited by()
    Related

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return