Skip to main content
Log in

Dynamic Query Optimization Approach for Semantic Database Grid

  • Semantic & Contents Computing
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

Fundamentally, semantic grid database is about bringing globally distributed databases together in order to coordinate resource sharing and problem solving in which information is given well-defined meaning, and DartGrid II is the implemented database gird system whose goal is to provide a semantic solution for integrating database resources on the Web. Although many algorithms have been proposed for optimizing query-processing in order to minimize costs and/or response time, associated with obtaining the answer to query in a distributed database system, database grid query optimization problem is fundamentally different from traditional distributed query optimization. These differences are shown to be the consequences of autonomy and heterogeneity of database nodes in database grid. Therefore, more challenges have arisen for query optimization in database grid than traditional distributed database. Following this observation, the design of a query optimizer in DartGrid II is presented, and a heuristic, dynamic and parallel query optimization approach to processing query in database grid is proposed. A set of semantic tools supporting relational database integration and semantic-based information browsing has also been implemented to realize the above vision.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Antoniou G, Harmelen F V. A Semantic Web Primer. Massachusetts Institute of Technology Press, 2004, pp.1–19.

  2. Zhuge H. Resource space grid: Model, method and platform. Concurrency and Computation: Practice and Experience, Wiley InterScience, 2004, 16(14): 1385–1413.

    Article  Google Scholar 

  3. Roure D D, Jennings N R, Shadbolt N R. The semantic grid: Past, present, and future. In Proc. the IEEE, 2005, 93(3): 669–681.

    Article  Google Scholar 

  4. Veijalainen J, Popescu-Zeletin R. Multidatabase systems in ISO/OSI environment. Standards in Information Technology and Industrial Control, N E Malagardis, T J Williams (eds.), Netherlands, 1988, pp.83–97.

  5. Kossmann D, Storcker K. Iterative dynamic programming: A new class of query optimization algorithms. ACM Trans. Database Systems, 2000, 25(1): 43–82.

    Article  Google Scholar 

  6. Selinger P G, Astrahan M M, Lorie R A, Price T G. Access path selection in a relational database management system. In Proc. ACM SIGMOD Int. Management of Data, Boston, Massachusetts, USA, May—June 1979, pp.23–34.

  7. Ono K, Lohman G. Measuring the complexity of join enumeration in query optimization. In Proc. 16th Int. Very Large Data Bases, Brisbane, Queensland, Australia, August 1990, pp.314–325.

  8. Graefe G, David J D. The EXODUS optimizer generator. In Proc. ACM SIGMOD Int. Management of Data, San Francisco, California, USA, May 1987, pp.160–172.

  9. Graefe G, Mckenna W J. The volcano optimizer generator: Extensibility and efficient search. In Proc. 9th Int. Data Engineering, Vienna, Austria, April 1993, pp.209–218.

  10. Palermo F P. A data base search problem. In Proc. Int. 4th Symposium on Computer and Information Science, Restion, Virginia, USA, 1972, pp.67–101.

  11. Swami A. Optimization of large join queries: Combining heuristics and combinational techniques. In Proc. ACM Int. Management of Data, Portland, Oregon, May 1989, pp.367–376.

  12. Shekita E, Young H, Tan K L. Multi-join optimization for symmetric multiprocessors. In Proc. Int. Very Large Data Bases, Dublin, Ireland, August 1993, pp.479–492.

  13. Steinbrunn M, Moerkotte G, Kemper A. Heuristic and randomized optimization for the join ordering problem. The International Journal on Very Large Data Bases, 1997, 6(3): 191–208.

    Article  Google Scholar 

  14. Ioannidis Y E, Wong E. Query optimization by simulated annealing. In Proc. ACM SIGMOD Int. Management of Data, San Francisco, California, USA, June 1987, pp.9–22.

  15. Wang J C, Horng J T, Hsu Y M. A genetic algorithm for set query optimization in distributed database systems. In Proc. IEEE Int. Systems, Man, and Cybernetics, Beijing, China, 1996, pp.14–17.

  16. Ioannidis Y E, Kang Y C. Randomized algorithms for optimizing large join queries. In Proc. ACM SIGMOD Int. Management of Data, Atlantic City, New Jersey, USA, May 1990, pp.312–321.

  17. Lanzelotte R, Valduries P, Zait M. On the effectiveness of optimization search strategies for parallel execution spaces. In Proc. Int. Very Large Data Bases, Dublin, Ireland, August 1993, pp.493–504.

  18. Galindo L C, Pellenkoft A, Kersten M. Fast, randomized join-order selection-why use transformations. In Proc. 20th Int. Very Large Data Bases, Santiago de Chile, Chile, September 1994, pp.85–95.

  19. Bernstein P A, Goodman N et al. Query processing in a system for distributed database (SDD-1). ACM trans. Database System, 1981, 6(4): 602–625.

    Article  MATH  Google Scholar 

  20. Selinger P G, Adiba M. Access path selection in distributed database management systems. In Proc. 1st Int. Data Bases, Aberdeen, Scotland, 1980, pp.204–215.

  21. Bitton D, Boral H, DeWitt D J, Wilkinson W K. Parallel algorithms for the execution of relational database operations. ACM Trans. Database System, 1983, 8(3): 324–353.

    Article  Google Scholar 

  22. Valduriez P, Gardarin G. Join and semi-join algorithms for a multi processor database machine. ACM Trans. Databases System, March 1984, 9(1): 133–161.

    Article  Google Scholar 

  23. Zhuge H, Liu J, Feng L, Sun X, He C. Query routing in a peer-to-peer semantic link network. Computational Intelligence, 2005, 21(2): 197–216.

    Article  MathSciNet  Google Scholar 

  24. Wu Z H, Chen H J, Huang C et al DartGrid: Semantic-based database grid. In Proc. International Conference on Computational Science, Kraków, Poland, 2004, pp.59–66.

  25. Tamer M, Patrick V. Principles of Distributed Database Systems. Prentice Hall, Inc., 1999.

  26. Yin H H, Zhang R E. The Basic Theory of Traditional Chinese Medicine. Shanghai Scientific and Technical Publisher, Shanghai, May 1984.

    Google Scholar 

  27. Zhou X Z, Wu Z H, Yin A N et al. Ontology development for unified traditional Chinese medical language system. Journal of Artificial Intelligence in Medicine, 2004, 32(1): 15–27.

    Article  Google Scholar 

  28. Cheng H, Wu Z H, Mao Y X. Q3: A semantic query language for dart database grid. In Proc. Int. Grid and Cooperative Computing, Wuhan, China, 2004, pp.372–380.

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Xiao-Qing Zheng.

Additional information

Supported by the Subprogram of the National Basic Research 973 Program of China under Grant No. 2003CB317006, the National Science Fund for Distinguished Young Scholars of NSFC under Grant No. NSFC60533040, the Program for New Century Excellent Talents of China under Grant No. NCET-04-0545, and the NSFC under Grant No. NSFC60503018. This paper is a substantially revised and extended version of the paper, Query optimization in database Grid, Proc. 4th Int. Grid and Cooperative Computing, Beijing, China, November 30–December 3, 2005

Xiao-Qing Zheng is a Ph.D. candidate in the College of Computer Science, Zhejiang University. He received his M.S. degree in management science and engineering in 2003. His research interests include knowledge representation and reasoning, grid computing, semantic web and multi-agent systems.

Hua-Jun Chen received his Ph.D. degree in computer science from Zhejiang University in 2005. He got his bachelor’s degree in biochemical engineering in 2000. Since 2004, he works as an assistant professor in the College of Computer Science, Zhejiang University. His research interests include grid computing, semantic web and biometric computing.

Zhao-Hui Wu received his Ph.D. degree in computer science from Zhejiang University, China, and Kaiserslautern University, Germany, in 1993. Now he is a professor, doctoral postgraduate supervisor and vice head of the College of Computer Science, Zhejiang University. He invented the first KB-system developing tool, ZIPE in China, in 1990. He proposed the first coupling knowledge representing model, Couplingua, which embodies rule, frame, semantic network and nerve cell network and supports symbol computing and traditional data processing computing. His research interests include distributed artificial intelligence, semantic grid, ubiquitous embedded system and real-time system.

Yu-Xin Mao is a Ph.D. candidate in the College of Computer Science, Zhejiang University. He received his bachelor’s degree in computer science from Zhejiang University in 2003. His research interests include grid computing, semantic web, web information sharing, visualization and search engine.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zheng, XQ., Chen, HJ., Wu, ZH. et al. Dynamic Query Optimization Approach for Semantic Database Grid. J Comput Sci Technol 21, 597–608 (2006). https://doi.org/10.1007/s11390-006-0597-4

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11390-006-0597-4

Keywords

Navigation