PARALLEL QUERY PROCESSING USING WARP EDGED BUSHY TREES IN MULTIMEDIA DATABASES

Lt. S. Santhosh Baboo, P. Subashini, K. S. Easwarakumar

2006

Abstract

AbstractThe paper focuses on parallelization of queries execution on a shared memory parallel database system. In this paper, a new data structures, named Warp edged Bushy trees, is proposed for facilitating compile time optimization. The warp edged bushy tree is a modified version of bushy trees , which provides better response time than bushy trees, during query processing.

References

  1. Haiyun He and Curtis Dyreson, Warp-Edge Optimization in Xpath, Springer-Verlag 2002.
  2. Golshani, F. and Dimitrova N. , A Language for ContentBased Video Retrieval, Multimedia Tools and Applications 6, 1998, pp. 289-312.
  3. A. Silberschatz, M. Stonebraker, and J. Ulman. Database research: Achievements and opportunities. Into the 21st century. SIGMOD Record, 25(1):52-63, March 1996.
  4. M. T. Ozsu and P. Valduriez. Distributed and Parallel Database Systems, pp. 1093-1111. CRC Press, 1997.
  5. W. Hasan, D. Florescu, and P. Valduriez. Open issues in parallel query optimization. SIGMOD Record, 25(3): pp. 28-33, September 1996.
  6. D. Taniar and Y. Jiang. A high performance objectoriented distributed parallel database architecture. In HPCN Conference 98, pp. 498-517. Springer Verlag, April 1998.
  7. K.-L. Tan and H.Lu. A Note on the Strategy Space of Multiway Join Query Optimization Problem in Parallel Systems. SIGMOD Record, 20(4):pp. 81-82, December 1991.
  8. M. Spiliopoulou, M. Hatzopoulos, and Y. Contronis. Parallel Optimization of Large Join Queries with Set Operators and Aggregates in a Parallel Environment Supporting Pipeline. IEEE Transactions on Knowledge and Data Engineering, 8(3): pp.429-445, June 1996.
  9. Leonindes Fegaras. A new heuristic for optimizing large queries. In International Database and Expert Systems Applications Conference, pp. 726-735, Vienna, Austria, August 1998. Springer Verlag LNCS 1460.
  10. M. Zait, D. Florescu, and P. Valduriez. Benchmarking the DBS3 Parallel Query Optimizer. IEEE parallel and distributed technology: systems and applications, 4(2): pp. 26-40, 1996.
  11. D. Schneider and D. J. DeWitt. Tradeoffs in processing complex join queries via hashing in multi-processor database machines. In Proceedings of the International Conference on Very Large Databases, pp. 469-490, Melbourne, Australia, August 1990.
  12. Rosana Lanzelotte, Patrick Valduriez, and Mohamed Zait. On the effectiveness of optimization search strategies for parallel execution spaces. In Int. Conf. on very Large Databases, pp. 493-504, Dublin, Ireland, 1993.
Download


Paper Citation


in Harvard Style

S. Santhosh Baboo L., Subashini P. and S. Easwarakumar K. (2006). PARALLEL QUERY PROCESSING USING WARP EDGED BUSHY TREES IN MULTIMEDIA DATABASES . In Proceedings of the Eighth International Conference on Enterprise Information Systems - Volume 1: ICEIS, ISBN 978-972-8865-41-2, pages 273-276. DOI: 10.5220/0002487802730276


in Bibtex Style

@conference{iceis06,
author={Lt. S. Santhosh Baboo and P. Subashini and K. S. Easwarakumar},
title={PARALLEL QUERY PROCESSING USING WARP EDGED BUSHY TREES IN MULTIMEDIA DATABASES},
booktitle={Proceedings of the Eighth International Conference on Enterprise Information Systems - Volume 1: ICEIS,},
year={2006},
pages={273-276},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002487802730276},
isbn={978-972-8865-41-2},
}


in EndNote Style

TY - CONF
JO - Proceedings of the Eighth International Conference on Enterprise Information Systems - Volume 1: ICEIS,
TI - PARALLEL QUERY PROCESSING USING WARP EDGED BUSHY TREES IN MULTIMEDIA DATABASES
SN - 978-972-8865-41-2
AU - S. Santhosh Baboo L.
AU - Subashini P.
AU - S. Easwarakumar K.
PY - 2006
SP - 273
EP - 276
DO - 10.5220/0002487802730276