Seyed Mohammad Taghi Rouhani Rankoohi

Learn More
The Performance and the efficiency of a distributed database system depend highly on the way data are allocated to the sites. The NP-completeness of the data allocation problem and the large size of its real occurrence, call for employing a fast and scalable heu-ristic algorithm. In this paper, we address the data allocation problem in terms of minimizing(More)
Distributed database systems provide a new data processing and storage technology for decentralized organizations of today. Query optimization, the process to generate an optimal execution plan for the posed query, is more challenging in such systems due to the huge search space of alternative plans incurred by distribution. As finding an optimal execution(More)
Considering the existing massive volumes of data processed nowadays and the distributed nature of many organizations, there is no doubt how vital the need is for distributed database systems. In such systems, the response time to a transaction or a query is highly affected by the distribution design of the database system, particularly its methods for(More)
Peer-to-Peer (P2P) systems with distinct advantages such as scalability, robustness and low cost have developed quickly in recent years. The resource search problem, that is to find out a peer having a desired resource, is a fundamental problem to be initially solved in most P2P applications. P2P systems can also be categorized under database systems. One(More)
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(More)
  • 1