{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T17:53:58Z","timestamp":1754157238087,"version":"3.41.2"},"reference-count":27,"publisher":"Emerald","issue":"1","license":[{"start":{"date-parts":[[2002,3,1]],"date-time":"2002-03-01T00:00:00Z","timestamp":1014940800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.emerald.com\/insight\/site-policies"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002,3,1]]},"abstract":"<jats:p>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\u2010to\u2010peer 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\u2010to\u2010peer 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 <jats:italic>j<\/jats:italic>th 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.<\/jats:p>","DOI":"10.1108\/10662240210415790","type":"journal-article","created":{"date-parts":[[2002,7,28]],"date-time":"2002-07-28T18:59:58Z","timestamp":1027882798000},"page":"16-30","source":"Crossref","is-referenced-by-count":5,"title":["A peer\u2010to\u2010peer distributed selection algorithm for the Internet"],"prefix":"10.1108","volume":"12","author":[{"given":"Alfred","family":"Loo","sequence":"first","affiliation":[]},{"given":"Y.K.","family":"Choi","sequence":"additional","affiliation":[]}],"member":"140","reference":[{"key":"key2022021919444698900_B1","doi-asserted-by":"crossref","unstructured":"Aggarwal, C., Jain, N. and Gupta, P. (1995), \u201cAn efficient selection algorithm on the pyramid\u201d, Information Processing Letters, Vol. 53, pp. 37\u201047.","DOI":"10.1016\/0020-0190(94)00160-Z"},{"key":"key2022021919444698900_B2","unstructured":"Campione, M. and Walrath, K. (1998), The Java Tutorial, Object\u2010Oriented Programming for the Internet, Addison Wesley, Reading, MA."},{"key":"key2022021919444698900_B3","unstructured":"Curtois, T. (1997), Java Networking and Communications, Prentice\u2010Hall, Englewood Cliffs, NJ."},{"key":"key2022021919444698900_B4","doi-asserted-by":"crossref","unstructured":"Dechter, R. and Kleinrock, L. (1986), \u201cBroad communications and distributed algorithms\u201d, IEEE Transactions on Computers, Vol. c\u201035 No. 3.","DOI":"10.1109\/TC.1986.1676745"},{"key":"key2022021919444698900_B5","unstructured":"Deitel, P. (1998), Java: How to Program, Prentice\u2010Hall, Englewood Cliffs, NJ."},{"key":"key2022021919444698900_B6","unstructured":"Grimm, C., Neitzner, M., Pralle, H. and V\u00f6ckler1, J. (1998), \u201cRequest routing in cache meshes\u201d, Proceedings of 3rd International WWW Caching Workshop  TF\u2010Cache Meeting, University of Manchester, Manchester."},{"key":"key2022021919444698900_B7","unstructured":"Hao, M., MacKenzie, P. and Stout, Q. (1992), \u201cSelection on the reconfigurable mesh\u201d, Proceedings of the 4th Symposium on the Frountiers of Massive Parallel Computation, pp. 38\u201045."},{"key":"key2022021919444698900_B8","doi-asserted-by":"crossref","unstructured":"Huang, J.H. and Kleinrock, L. (1990), \u201cDistributed selectsort sorting algorithms on broadcast communication networks\u201d, Parallel Computing, Vol. 16 No. 2\/3,  pp. 183\u201090.","DOI":"10.1016\/0167-8191(90)90057-G"},{"key":"key2022021919444698900_B9","doi-asserted-by":"crossref","unstructured":"Jacobs, A. (2000), Network World, 9 October.","DOI":"10.1145\/353165.353166"},{"key":"key2022021919444698900_B10","doi-asserted-by":"crossref","unstructured":"Janus, P. and Lamagna, E. (1985), \u201cAn adaptive method for unknown distributions in distributive partitioned sorting\u201d, IEEE Transactions on Computer, Vol. c\u201034  No. 4, pp. 367\u201071.","DOI":"10.1109\/TC.1985.5009388"},{"key":"key2022021919444698900_B11","unstructured":"Kamath, C. (2001), \u201cThe role of parallel and distributed processing in data mining\u201d, Newsletter of the Technical Committee on Distributed Processing, IEEE Computer Society, Spring."},{"key":"key2022021919444698900_B12","unstructured":"Keller, G. and Warrack, B. (1998), Statistics for Management and Economics, Duxbury Press, Pacific Grove, CA."},{"key":"key2022021919444698900_B13","unstructured":"Loo, A. and Ng, J. (1991), \u201cDistributed statistical sorting algorithm\u201d, Proceeding of SICON, Singapore, pp. 222\u20105."},{"key":"key2022021919444698900_B14","doi-asserted-by":"crossref","unstructured":"Loo, A., Bloor, C. and Choi, C. (2000), \u201cParallel computing using Web servers and servlets\u201d, Internet Research: Electronic Networking Applications and Policy,  Vol. 10, No. 2.","DOI":"10.1108\/10662240010322948"},{"key":"key2022021919444698900_B15","unstructured":"Loo, A., Bloor, C. and Grey, D. (1997), \u201cComplexity analysis of distributed database algorithm\u201d, Proceedings of High Performance Computing in Engineering 97,  Gran Canaria."},{"key":"key2022021919444698900_B16","unstructured":"Loo, A., Chung, C., Fu, R. and Lo, J. (1995), \u201cEfficiency measurement of distributed statistical sorting algorithms\u201d, Proceeding of Applications of  High Performance Computing in Engineering,  Milan."},{"key":"key2022021919444698900_B17","unstructured":"Maufer, T. (1998), Deploying IP Multicast in the Enterprise, Prentice\u2010Hall, Englewood Cliffs, NJ."},{"key":"key2022021919444698900_B18","unstructured":"Miller, C. (1998), Multicast Networking and Applications, Addison Wesley, Reading, MA."},{"key":"key2022021919444698900_B19","unstructured":"Miller, M. and Wantz, L.J. (1998), \u201cComputed Web links: the COOL link model\u201d, Proceedings of the 2nd Workshop on Adaptive Hypertext and Hypermedia, HYPERTEXT\u201998, Pittsburgh, PA."},{"key":"key2022021919444698900_B20","doi-asserted-by":"crossref","unstructured":"Negro, A. and Santoro, N. (1997), \u201cEfficient distributed selection with bounded messages\u201d, IEEE Transactions on Parallel and Distributed Systems, Vol. 8 No. 4,  pp. 397\u2010401.","DOI":"10.1109\/71.588617"},{"key":"key2022021919444698900_B21","doi-asserted-by":"crossref","unstructured":"Rodeh, M. (1982), \u201cFinding the median distributively\u201d, Journal of Computer and System Science, Vol. 24,  pp. 162\u20106.","DOI":"10.1016\/0022-0000(82)90045-9"},{"key":"key2022021919444698900_B22","doi-asserted-by":"crossref","unstructured":"Santoro, N., Sidney, J. and Sidney, S. (1992), \u201cA distributed selection algorithm and its expected communication complexity\u201d, Theoretical Computer Science, Vol. 100, pp. 185\u2010204.","DOI":"10.1016\/0304-3975(92)90368-P"},{"key":"key2022021919444698900_B23","unstructured":"Saukas, E. and Song, S. (1988), \u201cEfficient selection algorithms on distributed memory computers\u201d, paper presented at the High Performance Networking and Computing, Orlando, FL."},{"key":"key2022021919444698900_B24","doi-asserted-by":"crossref","unstructured":"Sayal, M., Breitbart, Y., Scheuermann, P. and Vingralek, R. (1998), \u201cSelection algorithms for replicated Web servers\u201d, SIGMETRICS\/Performance Workshop on Internet Server Performance.","DOI":"10.1145\/306225.306238"},{"key":"key2022021919444698900_B25","doi-asserted-by":"crossref","unstructured":"Schwartz, D.G., Divitini, M. and Brasethvik, T. (1999),  \u201cOn knowledge management of the Internet age\u201d, Internet\u2010Based Organizational Memory and Knowledge Management, Ideal Group Publishing, Hershey, PA.","DOI":"10.4018\/978-1-878289-82-7"},{"key":"key2022021919444698900_B26","doi-asserted-by":"crossref","unstructured":"Shen, H. (1991), \u201cA universal algorithm for parallel  k\u2010selection in hypercubes\u201d, Parallel Computing,  Vol. 18, pp. 139\u201045.","DOI":"10.1016\/0167-8191(92)90076-J"},{"key":"key2022021919444698900_B27","unstructured":"Wegner, L.M. (1982), \u201cSorting a distributed file in a network\u201d, Proceedings of Conference Information Science System, NJ."}],"container-title":["Internet Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.emeraldinsight.com\/doi\/full-xml\/10.1108\/10662240210415790","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/10662240210415790\/full\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/10662240210415790\/full\/html","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T23:39:48Z","timestamp":1753400388000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.emerald.com\/intr\/article\/12\/1\/16-30\/177596"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,3,1]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2002,3,1]]}},"alternative-id":["10.1108\/10662240210415790"],"URL":"https:\/\/doi.org\/10.1108\/10662240210415790","relation":{},"ISSN":["1066-2243"],"issn-type":[{"type":"print","value":"1066-2243"}],"subject":[],"published":{"date-parts":[[2002,3,1]]}}}