Skip to main content
SpringerLink
Log in

A new ant colony optimization-based algorithm for range query answering problem in relational schema-based P2P database systems

  • Regular Paper
  • Published:
Knowledge and Information Systems Aims and scope Submit manuscript

Abstract

Nowadays, peer-to-peer database systems (P2PDBSs) aiming at data sharing in the Web have become very popular. Due to the absence of global knowledge about data placement in unstructured P2P networks, query processing and answering is a challenging problem in such systems. This process is provided by query routing and is an optimization problem whose goal is to find the maximum results with spending a predetermined cost. With the aim of improving the efficiency of range query answering algorithm in relational schema-based P2PDBSs, the present study, for the first time, adapts the ant colony metaphor with range query answering problem in relational schema-based P2P systems and proposes a new algorithm using the ant colony optimization approach in which the researchers use histogram data structure and apply both positive and negative feedbacks, dynamic learning rate, and local heuristic mechanisms and show that the proposed algorithm gives better results than the comparative greedy-based method. The experimental tests indicate that in the best case, the average number of traveled links for finding one answer (i.e., cost-to-answers ratio) is decreased almost by half in contrast to that of greedy-based algorithm. Furthermore, the achieved results indicate that the proposed algorithm is completely flexible with the users’ requests, i.e., more query answers or less query response time, and the algorithm parameters can be properly set to meet the users’ requests.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18

Similar content being viewed by others

References

  1. Aboulnaga A, Chaudhuri S (1999) Self-tuning histograms: building histograms without looking at data. In: Proceedings of the 1999 ACM SIGMOD international conference on Management of data (SIGMOD’99). ACM, New York, USA, pp 181–192

  2. Androutsellis-Theotolis S, Spinellis D (2004) A survey of peer-to-peer content distribution technologies. ACM Comput Surv 36(4):335–371

    Article  Google Scholar 

  3. Bell D, Grimson J (1994) Distributed database systems. Addison-Wesley, UK

    Google Scholar 

  4. Bonabeau E, Dorigo M, Theraulaz G (1999) Swarm intelligence: from natural to artificial systems. Oxford University Press, USA

    MATH  Google Scholar 

  5. Bonifati A, Chang EQ, Ho T et al (2005) HePToX: heterogeneous peer to peer XML databases, In: CoRR cs.DB

  6. Bonifati A, Chang EQ, Ho T et al (2005) HePToX: marrying XML and heterogeneity in your P2P databases. In: Proceedings of the 31st international conference on very large databases (VLDB ’05). VLDB Endowment, Trondheim, Norway, pp 1267–1270

  7. Bonifati A, Chrysanthis P, Ouksel A et al (2008) Distributed databases and peer-to-peer databases: past and present. ACM SIGMOD Record 37(1):5–11

    Article  Google Scholar 

  8. Ciglaric M, Vidmar T (2006) Ant-inspired query routing performance in dynamic peer-to-peer networks. In: Proceedings of the 20th international conference on parallel and distributed processing symposium (IPDPS ’06). IEEE Computer Society, Rhodes Island, Greece

  9. Clarke I, Sandberg O, Wiley B et al (2001) Freenet: a distributed anonymous information storage and retrieval system, In: Proceeding of the international workshop on designing privacy enhancing technologies: design issues in anonymity and unobservability. Springer, New York, USA

  10. Connolly T (2006) Database systems, 3rd edn. Addison-Wesley, England

    Google Scholar 

  11. Crespo A, Garcia-Molina H (2002) Routing indices for peer-to-peer systems. In: Proceedings of the 22nd international conference on distributed computing systems (ICDCS ’02). IEEE Computer Society, pp 23–32

  12. Di Caro G, Dorigo M (1998) An adaptive multi-agent routing algorithm inspired by ants behavior. In: Proceedings of PART98-5th annual Australasian conference on parallel and real-time systems. Singapore, pp 261–272

  13. Dorigo M, Gambardella LM (1997) Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans Evolut Comput 1(1):53–66

    Article  Google Scholar 

  14. Dorigo M, Stutzle T (2004) Ant colony optimization. MIT Press, Cambridge

    Book  MATH  Google Scholar 

  15. Fang G, Zheng X (2009) Improving query mechanisms for unstructured peer-to-peer networks. In: Bound P (ed) Communications in computer and information science (CCIS 26): 1st international business conference (Chinacombiz 2008). Springer Link, Hangzhou, China, pp 60–67

    Google Scholar 

  16. Haase P, Siebes R, van Harmelen F (2007) Expertise-based peer selection in peer-to-peer networks. Kowl Inf Syst 15(1):75–107

    Article  Google Scholar 

  17. Halevy A Y, Ives Z G, Suciu D et al (2003) Schema mediation in peer data management systems. In: Proceedings of the 19th international conference on data engineering (ICDE ’03). IEEE, pp 505–516

  18. Halevy A, Ives Z, Mork P et al (2003) Piazza: data management infrastructure for semantic web applications. In: Proceedings of the 12th international conference on World Wide Web (WWW ’03). ACM, Budapest, Hungary, pp 556–567

  19. Heese R, Herschel S, Naumann F et al (2005) Self-extending peer data management. In: Proceedings of the conference datenbanksystem in business, technology and web (BTW). Karlsruhe, Germany, pp 165–174

  20. Hose K (2008) Processing rank-aware queries in schema-based P2P systems. A dissertation submitted in fulfillment of the requirements for the degree of Doktor-Ingenieur (DR.-ING.), Faculty of computer science and automation technische universität Ilmenau

  21. Hose K, Roth A, Zeitz A et al (2008) A research agenda for query processing in large-scale peer data management systems. Inf Syst 33(7–8):597–610

    Article  Google Scholar 

  22. Kalogeraki V, Gunopulos D, Zeinalipour-Yazti D (2002) A local search mechanism for peer-to-peer networks. In: Proceedings of the eleventh international conference on information and knowledge management (CIKM ’02). ACM Press, Virginia, USA, pp 300–307

  23. Kantere V, Tsoumakos D, Roussopoulos N (2004) Query structured data in an unstructured P2P system. In: Sixth ACM CIKM international workshop on web information and data management (WIDM ’04). Washington, DC, USA, pp 64–71

  24. Kapoor H, Mehta K, Puri D et al (2013) Survey of various search mechanisms in unstructured peer-to-peer networks. Int J Comput Appl 68(6):21–25

    Google Scholar 

  25. Adl RK, Rouhani Rankoohi SMT (2009) A new ant colony optimization based algorithm for data allocation problem in distributed databases. Knowl Inf Syst 20(3):349–373

    Article  Google Scholar 

  26. King R, Hameurlain A, Morvan F (2010) Query routing and processing in peer-to-peer data sharing systems. Int J Datab Manag Syst (IJDMS) 2(2):116–139

    Article  Google Scholar 

  27. Kleinberg JM (2000) Navigation in a small world. Nature 406:845

    Article  Google Scholar 

  28. Lerthirunwong S., Maruyama N, Matsuoka S (2008) Index distribution technique for efficient search on unstructured peer-to-peer networks. In: Proceedings of the 5th international conference on electrical engineering/electronics, computer, telecommunications and information technology (ECTI-CON 2008). IEEE, pp 97–100

  29. Li J, Pan QK, Xie SX (2008) Research on peer selection in peer-to-peer networks using ant colony optimization. In: Proceedings of the fourth international conference on natural computation (ICNC ’08). IEEE Computer Society, pp 516–520

  30. Li X, Wu J (2006) Improve searching by reinforcement learning in unstructured P2Ps. In: Proceedings of the 26th IEEE international conference on distributed computing systems workshops (ICDCSW ’06). IEEE Computer Society, Lisboa, Portugal

  31. Liu C-Y (2013) Adaptive search protocol based on optimized ant colony algorithm in peer-to-peer network. J Netw 8(4):843–850

    Google Scholar 

  32. Lv Q, Cao P, Cohen E et al (2002) Search and replication in unstructured peer-to-peer networks. In: Proceedings of the 16th international conference on supercomputing (ICS ’02). ACM, New York, USA

  33. Marzolla M, Mordacchini M, Orlando S (2006) Tree vector indexes: efficient range queries for dynamic content on peer-to-peer networks. In: 14th euromicro international conference on parallel, distributed and network-based processing (PDP ’06). Montbeliard-Sochaux, France, pp 457–464

  34. Michlmayr E (2006) Self-organization for search in peer-to-peer networks: the exploitation-exploration dilemma. In: Proceedings of the 1st international conference on bio inspired models of network, information and computing systems (BIONETICS ’06). IEEE, Cavalese, Italy, pp 1–8

  35. Michlmayr E (2006) Specification of the SemAnt algorithm. Vienna University of Technology, Austria, Technical report

  36. Michlmayr E (2007) Ant algorithms for self-organization in social networks. Ph.D. thesis submitted to the Vienna University of Technology, Faculty of Informatics

  37. Michlmayr E, Graf S, Siberski W, et al. (2005) Query routing with ants. In: Proceedings of workshop on ontologies in P2P communities, european semantic web conference (ESWC ’05). Heraklion, Crete

  38. Michlmayr E, Pany A, Graf S (2006) Applying ant-based multi-agent systems to query routing in distributed environments. In: Proceedings of the 3rd IEEE conference on intelligent systems (IEEE IS’06). London, UK, pp 36–41

  39. Michlmayr E, Pany A, Kappel A (2007) Using taxonomies for content-based routing with ants. J Comput Netw 51(16):4514–4528

    Article  MATH  Google Scholar 

  40. Michlmayr E, Pany A, Kappel G (2006) Using taxonomies for content-based routing with ants. In: Proceedings of the 2nd workshop on innovations in web infrastructure (IWI2), 15th international world-wide web conference (WWW2006). Edinburgh, UK

  41. Ng W, Ooi B, Tan KL et al (2003) PeerDB: A P2P-based system for distributed data sharing. In: Proceedings of the 19th international conference on data engineering (ICDE ’03). IEEE Computer Society, Bangalore, India, pp 633–644

  42. Ozsu MT, Valduriez P (1999) Principles of distributed database systems, 2nd edn. Prentice-Hall, USA

    Google Scholar 

  43. Petrakis Y, Koloniari G, Pitoura E (2004) On using histograms as routing indexes in peer-to-peer systems. In: Second international workshop on databases, information systems and peer-to-peer computing (DBISP2P ’04). Canada, Toronto, pp 16–30

  44. Pourebrahimi B, Bertels K, Vassiliadis S (2005) A survey of peer-to-peer networks. In: Proceedings of the 16th annual workshop on circuits, systems and signal processing

  45. Ratnasamy S, Francis P, Handley M et al (2001) A scalable content-addressable network. In: Proceedings of the 2001 conference on applications, technologies, architectures and protocols for computer communications (SIGCOMM ’01). ACM, pp 161–172

  46. Rodríguez-Gianolli P, Kementsietsidis A, Garzetti M et al (2005) Data sharing in the hyperion peer database system. In: Proceedings of the 31st international conference on very large data bases (VLDB ’05). VLDB Endowment, pp 1291–1294

  47. Roth A (2005) Benefit and cost query answering in PDMS. In: Proceedings of the international workshop on databases, information systems and peer-to-peer, computing (DBISP2P), pp 50–61

  48. Roth A (2007) Completeness-driven query answering in peer data management systems. In: VLDB ’07, Vienna, Austria

  49. Roth A, Naumann F (2007) System P: completeness-driven query answering in peer data management systems. In: Proceedings of datenbanksysteme in business, technologies and web (BTW‘07). Aachen, Germany, pp 625–628

  50. Roth A, Naumann F, Hubner T et al (2006) System P: query answering in PDMS under limited resources. In: Proceedings of the workshop on information integration on the web (IIWeb). Edinburgh, Scotland

  51. Ryeng N, Norvag K (2008) Robust aggregation in peer-to-Peer database systems. In: Proceedings of the 2008 international symposium on database engineering and applications (IDEAS ’08). ACM, Coimbra, Portugal, pp 29–37

  52. Sartinia S (2004) On the correctness of query results in XML P2P databases. In: Proceedings of the fourth international conference on peer-to-peer computing (P2P ’04). IEEE, Zurich, Switzerland, pp 18–25

  53. Stoica I, Morris R, Karger D et al (2001) Chord: a scalable peer-to-peer lookup service for internet applications. In: Proceedings of the 2001 conference on applications, technologies, architectures and protocols for computer communications (SIGCOMM ’01). ACM, San Diego, California, USA, pp 149–160

  54. Tatarinov I, Halevy A (2004) Efficient query reformulation in peer data management systems. In: Proceedings of the 2004 ACM SIGMOD international conference on management of data (SIGMOD ’04). ACM, Paris, France, pp 539–550

  55. Tatarinov I, Ives Z, Madhavan J et al (2003) The piazza peer data management project. ACM SIGMOD Record 32(3):47–52

    Article  Google Scholar 

  56. Tsoumakos D, Roussopoulos N (2003) A comparison of peer-to-peer search methods. In: Proceedings of the sixth international workshop on the web and database (WebDB). San-Diego, California, pp 61–66

  57. Tsoumakos D, Roussopoulos N (2003) Adaptive probabilistic search for peer-to-peer networks, In: Proceedings of the third international conference on peer-to-peer computing (P2P ’03). IEEE, pp 102–109

  58. Wang D, Tse QCK, Zhou Y (2009) A decentralized search engine for dynamic web communities. Knowl Inf Syst 26(1):105–125

    Article  Google Scholar 

  59. Yeferny T, Arour K, Bouzeghoub A (2013) An efficient learning query routing method for unstructured P2P systems. Int J Adv Sci Technol 53:61–72

    Google Scholar 

  60. Zhang J, Hu X, Tan X et al (2006) Implementation of an ant colony optimization technique for job shop scheduling problem. Trans Inst Meas Control 28(1):93–108

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Electrical and Computer Engineering Department, Shahid Beheshti University, G.C., Tehran, Iran

    Saeedeh Aghamahmoodi & Seyed Mohammad Taghi Rouhani Rankoohi

  2. Information Technology Engineering Department, Nooretouba Virtual University, G.C., Tehran, Iran

    Fatemeh Aghamahmoodi

Authors
  1. Saeedeh Aghamahmoodi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Seyed Mohammad Taghi Rouhani Rankoohi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Fatemeh Aghamahmoodi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Saeedeh Aghamahmoodi.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Aghamahmoodi, S., Rouhani Rankoohi, S.M.T. & Aghamahmoodi, F. A new ant colony optimization-based algorithm for range query answering problem in relational schema-based P2P database systems. Knowl Inf Syst 43, 719–749 (2015). https://doi.org/10.1007/s10115-014-0739-x

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10115-014-0739-x

Keywords

Search

Navigation