A peer-to-peer distributed selection algorithm for the internet

Alfred LOO, Y. K. CHOI

Research output: Journal PublicationsJournal Article (refereed)Researchpeer-review

5 Citations (Scopus)

Abstract

Heretofore, it has been extremely expensive to install and use distributed databases. With the advent of Java, JDBC and other Internet technologies, it has become easy and inexpensive to connect multiple databases and form distributed databases, even where the various host computers run on different platforms. These types of databases can be used in many Peer-to-peer applications which are now receiving much attention from researchers. Although it is easy to form a distributed database via Internet/intranet, effective sharing of information continues to be problematic. We need to pay more attention to the enabling algorithms, as dedicated links between computers are usually not available in peer-to-peer systems. The lack of dedicated links can cause poor performance, especially if the databases are connected via Internet. Discusses the problems of distributed database operation with reference to an example. Presents two statistical selection algorithms which are designed to select the jth smallest key from a very large file distributed over many computers. The objective of these algorithms is to minimise the number of communication messages necessary to the selection operation. One algorithm is for the intranet with broadcast/multicast facilities while the other is for Internet without broadcast/multicast facilities.
Original languageEnglish
Pages (from-to)16-30
Number of pages15
JournalInternet Research
Volume12
Issue number1
DOIs
Publication statusPublished - 1 Jan 2002

Fingerprint

Internet
Intranet
broadcast
Intranets
cause
Distributed databases
Peer to peer
World Wide Web
communication
lack
performance
Data base
Communication
Java
Peer-to-peer systems
Internet technology

Keywords

  • Algorithms
  • Communications
  • Internet

Cite this

LOO, Alfred ; CHOI, Y. K. / A peer-to-peer distributed selection algorithm for the internet. In: Internet Research. 2002 ; Vol. 12, No. 1. pp. 16-30.
@article{eba80a7b0afa43448f925343890740f7,
title = "A peer-to-peer distributed selection algorithm for the internet",
abstract = "Heretofore, it has been extremely expensive to install and use distributed databases. With the advent of Java, JDBC and other Internet technologies, it has become easy and inexpensive to connect multiple databases and form distributed databases, even where the various host computers run on different platforms. These types of databases can be used in many Peer-to-peer applications which are now receiving much attention from researchers. Although it is easy to form a distributed database via Internet/intranet, effective sharing of information continues to be problematic. We need to pay more attention to the enabling algorithms, as dedicated links between computers are usually not available in peer-to-peer systems. The lack of dedicated links can cause poor performance, especially if the databases are connected via Internet. Discusses the problems of distributed database operation with reference to an example. Presents two statistical selection algorithms which are designed to select the jth smallest key from a very large file distributed over many computers. The objective of these algorithms is to minimise the number of communication messages necessary to the selection operation. One algorithm is for the intranet with broadcast/multicast facilities while the other is for Internet without broadcast/multicast facilities.",
keywords = "Algorithms, Communications, Internet",
author = "Alfred LOO and CHOI, {Y. K.}",
year = "2002",
month = "1",
day = "1",
doi = "10.1108/10662240210415790",
language = "English",
volume = "12",
pages = "16--30",
journal = "Internet Research",
issn = "1066-2243",
publisher = "Emerald Group Publishing Ltd.",
number = "1",

}

A peer-to-peer distributed selection algorithm for the internet. / LOO, Alfred; CHOI, Y. K.

In: Internet Research, Vol. 12, No. 1, 01.01.2002, p. 16-30.

Research output: Journal PublicationsJournal Article (refereed)Researchpeer-review

TY - JOUR

T1 - A peer-to-peer distributed selection algorithm for the internet

AU - LOO, Alfred

AU - CHOI, Y. K.

PY - 2002/1/1

Y1 - 2002/1/1

N2 - Heretofore, it has been extremely expensive to install and use distributed databases. With the advent of Java, JDBC and other Internet technologies, it has become easy and inexpensive to connect multiple databases and form distributed databases, even where the various host computers run on different platforms. These types of databases can be used in many Peer-to-peer applications which are now receiving much attention from researchers. Although it is easy to form a distributed database via Internet/intranet, effective sharing of information continues to be problematic. We need to pay more attention to the enabling algorithms, as dedicated links between computers are usually not available in peer-to-peer systems. The lack of dedicated links can cause poor performance, especially if the databases are connected via Internet. Discusses the problems of distributed database operation with reference to an example. Presents two statistical selection algorithms which are designed to select the jth smallest key from a very large file distributed over many computers. The objective of these algorithms is to minimise the number of communication messages necessary to the selection operation. One algorithm is for the intranet with broadcast/multicast facilities while the other is for Internet without broadcast/multicast facilities.

AB - Heretofore, it has been extremely expensive to install and use distributed databases. With the advent of Java, JDBC and other Internet technologies, it has become easy and inexpensive to connect multiple databases and form distributed databases, even where the various host computers run on different platforms. These types of databases can be used in many Peer-to-peer applications which are now receiving much attention from researchers. Although it is easy to form a distributed database via Internet/intranet, effective sharing of information continues to be problematic. We need to pay more attention to the enabling algorithms, as dedicated links between computers are usually not available in peer-to-peer systems. The lack of dedicated links can cause poor performance, especially if the databases are connected via Internet. Discusses the problems of distributed database operation with reference to an example. Presents two statistical selection algorithms which are designed to select the jth smallest key from a very large file distributed over many computers. The objective of these algorithms is to minimise the number of communication messages necessary to the selection operation. One algorithm is for the intranet with broadcast/multicast facilities while the other is for Internet without broadcast/multicast facilities.

KW - Algorithms

KW - Communications

KW - Internet

UR - http://commons.ln.edu.hk/sw_master/6849

U2 - 10.1108/10662240210415790

DO - 10.1108/10662240210415790

M3 - Journal Article (refereed)

VL - 12

SP - 16

EP - 30

JO - Internet Research

JF - Internet Research

SN - 1066-2243

IS - 1

ER -