A HEURISTIC SEARCHING ALGORITHM FOR DATA PARTIONING IN DISTRIBUTED DATA BASE SYSTEMS

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

NEMATBAKHSH M.A.; BAHRANI S.; BRAANI A.

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: RESEARCH JOURNAL OF UNIVERSITY OF ISFAHAN "SCIENCE" Year:2002 | Volume:16 | Issue:1-2 Page(s): 187-205

Download Full-Text

Persian Verion

View:

1,926

Download:

Cites:

Information Journal Paper

Title

A HEURISTIC SEARCHING ALGORITHM FOR DATA PARTIONING IN DISTRIBUTED DATA BASE SYSTEMS

Author(s)

NEMATBAKHSH M.A. | BAHRANI S. | BRAANI A. | Issue Writer Certificate

Keywords

Not Registered.

Abstract

In the last few years, the computer network technology has been improved by a large scale and therefore has influenced the application of distributed data base systems for a better reliability, performance and inexpensive query processing. Hence, new application and data base architecture for distributed data base system need to be developed and several challenging issues have to resolved by research communities around the world. The major challenging issues for this new generation of data base system deal with allocation, replication and portioning data and influences of each other for a better design.In this paper, we present a heuristic and efficient algorithm to solve the problem of data portioning and allocation at the same time. The data portioning is vertically broken into two or more segments that are most efficiently allocated to data base sites. To provide an efficient and cost effective portioning and allocation, an object function is developed and used for each iteration to intelligently getting closer to the optimized result. To examine the correctness of the algorithm, a typical problem is solved and then the results are discussed in this paper. A software package is implemented to be used for designing a distributed data base system

Cites

No record.

References

No record.

Cite

APA: Copy

NEMATBAKHSH, M.A., BAHRANI, S., & BRAANI, A.. (2002). A HEURISTIC SEARCHING ALGORITHM FOR DATA PARTIONING IN DISTRIBUTED DATA BASE SYSTEMS. RESEARCH JOURNAL OF UNIVERSITY OF ISFAHAN "SCIENCE", 16(1-2), 187-205. SID. https://sid.ir/paper/55871/en

Vancouver: Copy

NEMATBAKHSH M.A., BAHRANI S., BRAANI A.. A HEURISTIC SEARCHING ALGORITHM FOR DATA PARTIONING IN DISTRIBUTED DATA BASE SYSTEMS. RESEARCH JOURNAL OF UNIVERSITY OF ISFAHAN "SCIENCE"[Internet]. 2002;16(1-2):187-205. Available from: https://sid.ir/paper/55871/en

IEEE: Copy

M.A. NEMATBAKHSH, S. BAHRANI, and A. BRAANI, “A HEURISTIC SEARCHING ALGORITHM FOR DATA PARTIONING IN DISTRIBUTED DATA BASE SYSTEMS,” RESEARCH JOURNAL OF UNIVERSITY OF ISFAHAN "SCIENCE", vol. 16, no. 1-2, pp. 187–205, 2002, [Online]. Available: https://sid.ir/paper/55871/en

Related Journal Papers