Referenced Items are not available for this document.
The contribution of this work has two folds. First, we extend the current query planners' cost metric space by introducing network bandwidth cost, query deployment cost and query re-using cost; second, we develop a suite of algorithms for re-using existing query fragments under different scenarios. One of the most important reusable queries is called structure-sharable query.
Published in:
High Performance Distributed Computing, 2005. HPDC-14. Proceedings. 14th IEEE International Symposium on
Date of Conference: 24-27 July 2005
- Page(s):
- 316 - 317
- ISSN :
- 1082-8907
- Print ISBN:
- 0-7803-9037-7
- INSPEC Accession Number:
- 8680398
- Digital Object Identifier :
- 10.1109/HPDC.2005.1520992
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
