{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,5,19]],"date-time":"2023-05-19T11:40:14Z","timestamp":1684496414878},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2008,7,30]],"date-time":"2008-07-30T00:00:00Z","timestamp":1217376000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2009,6]]},"DOI":"10.1007\/s11227-008-0225-x","type":"journal-article","created":{"date-parts":[[2008,7,29]],"date-time":"2008-07-29T19:43:16Z","timestamp":1217360596000},"page":"286-318","source":"Crossref","is-referenced-by-count":3,"title":["Efficient parallel Text Retrieval techniques on Bulk Synchronous Parallel (BSP)\/Coarse Grained Multicomputers (CGM)"],"prefix":"10.1007","volume":"48","author":[{"given":"Charalampos","family":"Konstantopoulos","sequence":"first","affiliation":[]},{"given":"Basilis","family":"Mamalis","sequence":"additional","affiliation":[]},{"given":"Grammati","family":"Pantziou","sequence":"additional","affiliation":[]},{"given":"Damianos","family":"Gavalas","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,7,30]]},"reference":[{"key":"225_CR1","doi-asserted-by":"crossref","first-page":"95","DOI":"10.7155\/jgaa.00084","volume":"8","author":"J Aslam","year":"2004","unstructured":"Aslam J, Pelekhov E, Rus D (2004) The star clustering algorithm for static and dynamic information organization. J Graph Algorithms Appl 8:95\u2013129","journal-title":"J Graph Algorithms Appl"},{"key":"225_CR2","volume-title":"Modern information retrieval","author":"R Baeza-Yates","year":"1999","unstructured":"Baeza-Yates R, Ribeiro-Neto B (1999) Modern information retrieval. Addison-Wesley, New York"},{"key":"225_CR3","doi-asserted-by":"crossref","unstructured":"Bilardi G, Fantozzi C, Pietracaprina A, Pucci G (2001) On the effectiveness of D-BSP as a bridging model of parallel computation. In: Proc of the int conf on comput sci (ICCS 2001), pp\u00a0579\u2013588","DOI":"10.1007\/3-540-45718-6_63"},{"key":"225_CR4","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1145\/130226.134466","volume":"11","author":"F Can","year":"1993","unstructured":"Can F (1993) Incremental clustering for dynamic information processing. ACM Trans Inf Process Syst 11:143\u2013164","journal-title":"ACM Trans Inf Process Syst"},{"key":"225_CR5","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1016\/S0306-4379(03)00062-0","volume":"29","author":"F Can","year":"2004","unstructured":"Can F, Altingovde I, Demir E (2004) Efficiency and effectiveness of query processing in cluster-based retrieval. Inf Syst 29:697\u2013717","journal-title":"Inf Syst"},{"issue":"4","key":"225_CR6","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1142\/S0129626499000499","volume":"9","author":"A Chan","year":"1999","unstructured":"Chan A, Dehne F (1999) A note on coarse grained parallel integer sorting. Parallel Process Lett 9(4):533\u2013538","journal-title":"Parallel Process Lett"},{"key":"225_CR7","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0167-8655(94)90097-3","volume":"13","author":"B Chaudhri","year":"1994","unstructured":"Chaudhri B (1994) Dynamic clustering for time incremental data. Pattern Recognit Lett 13:27\u201334","journal-title":"Pattern Recognit Lett"},{"key":"225_CR8","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1023\/A:1011178530932","volume":"19","author":"S Chung","year":"2001","unstructured":"Chung S, Kwon H, Ryu K, Chung Y, Jang H, Choi C (2001) Information retrieval on an SCI-based PC cluster. J Supercomput 19:251\u2013265","journal-title":"J Supercomput"},{"key":"225_CR9","doi-asserted-by":"crossref","unstructured":"Cringean J, England R, Manson G, Willett P (1990) Parallel text searching in serial files using a processor farm. In: Proc of ACM SIGIR, pp 429\u2013452","DOI":"10.1145\/96749.98249"},{"key":"225_CR10","doi-asserted-by":"crossref","unstructured":"Dehne F, Fabri A, Rau-Chaplin A (1993) Scalable parallel geometric algorithms for coarse grained multicomputer. In: Proc of the ACM 9th symp on comput geom, pp 298\u2013307","DOI":"10.1145\/160985.161154"},{"key":"225_CR11","doi-asserted-by":"crossref","unstructured":"Dehne F, Fabri A, Kenyon C (1994) Scalable and architecture independent parallel geometric algorithms with high probability optimal time. In: Proc of the IEEE symp on parallel and distrib process, pp 586\u2013593","DOI":"10.1109\/SPDP.1994.346119"},{"key":"225_CR12","doi-asserted-by":"crossref","unstructured":"Dehne F, Dittrich W, Hutchinson D (1997) Efficient external memory algorithms by simulating coarse-grained parallel algorithms. In: Proc of the 9th annual ACM symp on parallel algorithms and archit (SPAA), pp 106\u2013115","DOI":"10.1145\/258492.258503"},{"key":"225_CR13","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/s00453-002-1009-y","volume":"36","author":"F Dehne","year":"2003","unstructured":"Dehne F, Dittrich W, Hutchinson D (2003) Efficient external memory algorithms by simulating coarse-grained parallel algorithms. Algorithmica 36:97\u2013122","journal-title":"Algorithmica"},{"key":"225_CR14","doi-asserted-by":"crossref","unstructured":"Dehne F, Deng X, Dymond P, Fabri A, Kokhar A (1995) A randomized parallel 3D convex hull algorithm for coarse grained multicomputers. In: Proc of the ACM symp on parallel algorithms and archit, pp 27\u201333","DOI":"10.1145\/215399.215410"},{"key":"225_CR15","doi-asserted-by":"crossref","unstructured":"Dehne F, Hutchinson D, Maheshwari A, Dittrich W (1999) Reducing I\/O complexity by simulating coarse grained parallel algorithms. In: Proc of the 13th Int and 10th symp on parallel and distrib process (IPPS\/SPDP), pp 14\u201320","DOI":"10.1109\/IPPS.1999.760428"},{"key":"225_CR16","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1007\/s00224-002-1066-2","volume":"35","author":"F Dehne","year":"2002","unstructured":"Dehne F, Dittrich W, Hutchinson D, Maheshwari A (2002) Bulk synchronous parallel algorithms for the external memory model. Theory of Comput Syst 35:567\u2013597","journal-title":"Theory of Comput Syst"},{"key":"225_CR17","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/s00453-001-0109-4","volume":"33","author":"F Dehne","year":"2002","unstructured":"Dehne F, Ferreira A, Caceres E, Wong S, Roncato A (2002) Efficient parallel graph algorithms for coarse-grained multicomputers and BSP. Algorithmica 33:183\u2013200","journal-title":"Algorithmica"},{"issue":"2","key":"225_CR18","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1109\/TITB.2005.847184","volume":"9","author":"V Dobrynin","year":"2005","unstructured":"Dobrynin V, Patterson D, Galushka M, Rooney N (2005) SOPHIA: an interactive cluster-based retrieval system for the OHSUMED collection. IEEE Trans Inf Technol Biomed 9(2):256\u2013265","journal-title":"IEEE Trans Inf Technol Biomed"},{"key":"225_CR19","doi-asserted-by":"crossref","unstructured":"Efraimidis P, Glymidakis C, Mamalis B, Spirakis P, Tampakas B (1995) Parallel text retrieval on a high performance supercomputer using the vector space model. In: Proc of ACM SIGIR, pp 58\u201366","DOI":"10.1145\/215206.215332"},{"key":"225_CR20","unstructured":"Gavalas D, Konstantopoulos C, Mamalis B, Pantziou G (2005) Efficient BSP\/CGM algorithms for text retrieval. In: Proc of the int conf on parallel and distrib comput syst (IASTED PDCS), pp 301\u2013306"},{"key":"225_CR21","unstructured":"Gerbessiotis A, Siniolakis C (1996) Primitive operations on the BSP model. Technical Report PRG-TR-23-96, Computing Laboratory, Oxford University"},{"key":"225_CR22","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1006\/jpdc.1994.1085","volume":"22","author":"A Gerbessiotis","year":"1994","unstructured":"Gerbessiotis A, Valiant L (1994) Direct bulk synchronous parallel algorithms. J Parallel Distrib Comput 22:251\u2013267","journal-title":"J Parallel Distrib Comput"},{"issue":"2","key":"225_CR23","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1137\/S0097539795294141","volume":"29","author":"M Goodrich","year":"1999","unstructured":"Goodrich M (1999) Communication-efficient parallel sorting. SIAM J Comput 29(2):416\u2013432","journal-title":"SIAM J Comput"},{"key":"225_CR24","unstructured":"Hawking D (1996) Document retrieval performance on parallel systems. In: Proc of the int conf on parallel and distrib process tech and appl (PDPTA \u201996), pp 1354\u20131365"},{"key":"225_CR25","doi-asserted-by":"crossref","unstructured":"Ishikawa Y, Chen Y, Kitagawa H (2001) An on-line document clustering method based on forgetting factors. In: Proc of the 5th Eur conf on res and adv technol for digit libr, pp 325\u2013339","DOI":"10.1007\/3-540-44796-2_28"},{"issue":"3","key":"225_CR26","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1145\/331499.331504","volume":"31","author":"A Jain","year":"1999","unstructured":"Jain A, Murty M, Flynn P (1999) Data clustering: a review. ACM Comput Surv 31(3):264\u2013323","journal-title":"ACM Comput Surv"},{"key":"225_CR27","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/0020-0190(96)00073-7","volume":"58","author":"B Juurlink","year":"1996","unstructured":"Juurlink B, Wijshoff H (1996) Communication primitives for BSP computers. Inf Process Lett 58:303\u2013310","journal-title":"Inf Process Lett"},{"key":"225_CR28","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-5210-6","volume-title":"Fault-tolerant parallel computation","author":"P Kanellakis","year":"1997","unstructured":"Kanellakis P, Shvartsman A (1997) Fault-tolerant parallel computation. Kluwer Academic, Norwell"},{"key":"225_CR29","doi-asserted-by":"crossref","unstructured":"Kang J, Ahn H, Jung S, Ryu K, Kwon H, Chung S (2004) Improving load balance and fault tolerance for PC cluster-based parallel information retrieval. In: Proc of the 5th int conf on parallel process and appl math (PPAM 2003), pp 682\u2013687","DOI":"10.1007\/978-3-540-24669-5_89"},{"key":"225_CR30","first-page":"35-1","volume-title":"Algorithms and theory of computation handbook","author":"D Karger","year":"1997","unstructured":"Karger D, Stein C, Wein J (1997) Scheduling algorithms. In: Atallah M (ed) Algorithms and theory of computation handbook. CRC Press, New York, pp\u00a035-1\u201335-33"},{"key":"225_CR31","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1007\/3-540-36574-5_4","volume-title":"Algorithms for memory hierarchies","author":"I Katriel","year":"2003","unstructured":"Katriel I, Meyer U (2003) Elementary graph algorithms in external memory. In: Meyer U, Sanders P, Sibeyn J (eds) Algorithms for memory hierarchies. LNCS, vol 2625. Springer, Berlin, pp 62\u201384"},{"key":"225_CR32","volume-title":"Algorithm design","author":"J Kleinberg","year":"2006","unstructured":"Kleinberg J, Tardos E (2006) Algorithm design. Addison-Wesley, Boston"},{"key":"225_CR33","unstructured":"Kunder M (2008) The size of the World Wide Web: estimated size of Google\u2019s index. In: The size of the World Wide Web. Available via http:\/\/www.worldwidewebsize.com . Accessed 2 June 2008"},{"key":"225_CR34","doi-asserted-by":"crossref","unstructured":"Kurland O, Lee L (2004) Corpus structure, language models, and ad hoc information retrieval. In: Proc of SIGIR\u201904, pp 194\u2013201","DOI":"10.1145\/1008992.1009027"},{"key":"225_CR35","doi-asserted-by":"crossref","unstructured":"Levering R, Cutler M (2006) The portrait of a common HTML Web page. In: Proc of the 2006 ACM symp on doc eng, pp 198\u2013204","DOI":"10.1145\/1166160.1166213"},{"key":"225_CR36","doi-asserted-by":"crossref","unstructured":"Liu X, Croft W (2004) Cluster-based retrieval using language models. In: Proc of SIGIR\u201904, pp 186\u2013193","DOI":"10.1145\/1008992.1009026"},{"key":"225_CR37","unstructured":"Lu Z, McKinley K (2000) Partial replica selection based on relevance for information retrieval. In: Proc of the 22nd Int ACM SIGIR conf on res and develop in inf retr, pp 97\u2013104"},{"key":"225_CR38","unstructured":"MacFarlane A, Robertson S, McCann J (2000) Pliers at TRECS. In: Proc of eighth text retr conf (TREC-8), pp 241\u2013252"},{"issue":"1","key":"225_CR39","first-page":"115","volume":"10","author":"B Mamalis","year":"2003","unstructured":"Mamalis B, Spirakis P, Tampakas B (2003) Parallel processing of multiple text queries on hypercube interconnection networks. Int J Comput Appl 10(1):115\u2013132","journal-title":"Int J Comput Appl"},{"key":"225_CR40","unstructured":"Manning C, Raghavan P, Schutze H (2008) An introduction to information retrieval, preliminary draft. Cambridge University Press. Available via http:\/\/www.informationretrieval.org . Accessed 1 June 2008"},{"key":"225_CR41","first-page":"219","volume-title":"Communicating process architectures","author":"J Martin","year":"2004","unstructured":"Martin J, Tiskin A (2004) Dynamic BSP: towards a flexible approach to parallel computing over the grid. In: East I, Martin J, Welch P, Duce D, Green M (eds) Communicating process architectures. IOS Press, Amsterdam, pp 219\u2013226"},{"key":"225_CR42","unstructured":"McColl W (1994) Scalable parallel computing: a grand unified theory and its practical development. In: Proc of IFIP world congr, pp 539\u2013546"},{"key":"225_CR43","first-page":"419","volume-title":"Information retrieval: data structures and algorithms","author":"E Rasmussen","year":"1992","unstructured":"Rasmussen E (1992) Clustering algorithms. In: Frakes W, Baeza-Yates R (eds) Information retrieval: data structures and algorithms. Prentice-Hall, Englewood Cliffs, pp 419\u2013442"},{"key":"225_CR44","doi-asserted-by":"crossref","unstructured":"Rungsawang A, Laohakanniyom A, Lertprasertkune M (2001) Low-cost parallel text retrieval using PC-cluster. In: Proc of Eur PVM\/MPI, pp 419\u2013426","DOI":"10.1007\/3-540-45417-9_56"},{"key":"225_CR45","volume-title":"An introduction to modern information retrieval","author":"G Salton","year":"1983","unstructured":"Salton G, McGill M (1983) An introduction to modern information retrieval. McGraw-Hill, New York"},{"issue":"11","key":"225_CR46","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1145\/361219.361220","volume":"18","author":"G Salton","year":"1975","unstructured":"Salton G, Wong A, Yang C (1975) A vector space model for automatic indexing. Commun ACM 18(11):613\u2013620","journal-title":"Commun ACM"},{"key":"225_CR47","doi-asserted-by":"crossref","unstructured":"Stanfill C (1989) Partitioned posting files: a parallel inverted file structure for information retrieval. In: Proc of ACM SIGIR, pp 413\u2013428","DOI":"10.1145\/96749.98247"},{"issue":"8","key":"225_CR48","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1145\/79173.79181","volume":"33","author":"L Valiant","year":"1990","unstructured":"Valiant L (1990) A bridging model for parallel computation. Commun ACM 33(8):103\u2013111","journal-title":"Commun ACM"},{"key":"225_CR49","first-page":"943","volume-title":"Handbook of theoretical computer science, vol A","author":"L Valiant","year":"1991","unstructured":"Valiant L (1991) General purpose parallel architectures. In: Leeuwen J (ed) Handbook of theoretical computer science, vol A. MIT Press, Cambridge, pp 943\u2013971"},{"key":"225_CR50","volume-title":"Information retrieval","author":"C Rijsbergen van","year":"1971","unstructured":"van Rijsbergen C (1971) Information retrieval, 2nd edn. Butterworth-Heinemann, Newton","edition":"2"},{"issue":"2","key":"225_CR51","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1145\/384192.384193","volume":"33","author":"J Vitter","year":"2001","unstructured":"Vitter J (2001) External memory algorithms and data structures: dealing with massive data. ACM Comput Surv 33(2):209\u2013271","journal-title":"ACM Comput Surv"},{"key":"225_CR52","unstructured":"Williams T (2000) A general-purpose model for heterogeneous computation. PhD Thesis, University of Central Florida, Orlando"},{"key":"225_CR53","doi-asserted-by":"crossref","unstructured":"Williams T, Parsons R (2000) The heterogeneous bulk synchronous parallel model. In: Proc of the IPDPS 2000 workshops on parallel and distrib process, pp 102\u2013108","DOI":"10.1007\/3-540-45591-4_12"},{"key":"225_CR54","volume-title":"Managing gigabytes: compressing and indexing documents and images","author":"I Witten","year":"1999","unstructured":"Witten I, Moffat A, Bell T (1999) Managing gigabytes: compressing and indexing documents and images, 2d edn. Morgan Kaufmann, San Francisco","edition":"2"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-008-0225-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-008-0225-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-008-0225-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,19]],"date-time":"2023-05-19T11:01:06Z","timestamp":1684494066000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-008-0225-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,7,30]]},"references-count":54,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2009,6]]}},"alternative-id":["225"],"URL":"https:\/\/doi.org\/10.1007\/s11227-008-0225-x","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,7,30]]}}}