{"id":"https://openalex.org/W2037390831","doi":"https://doi.org/10.1109/iscc.2013.6755015","title":"A two-pass exact algorithm for selection on Parallel Disk Systems","display_name":"A two-pass exact algorithm for selection on Parallel Disk Systems","publication_year":2013,"publication_date":"2013-07-01","ids":{"openalex":"https://openalex.org/W2037390831","doi":"https://doi.org/10.1109/iscc.2013.6755015","mag":"2037390831","pmid":"https://pubmed.ncbi.nlm.nih.gov/25374478"},"language":"en","primary_location":{"id":"doi:10.1109/iscc.2013.6755015","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iscc.2013.6755015","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE Symposium on Computers and Communications (ISCC)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref","pubmed"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5100689981","display_name":"Tian Mi","orcid":"https://orcid.org/0000-0003-3230-0633"},"institutions":[{"id":"https://openalex.org/I140172145","display_name":"University of Connecticut","ror":"https://ror.org/02der9h97","country_code":"US","type":"education","lineage":["https://openalex.org/I140172145"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Tian Mi","raw_affiliation_strings":["Department of Computer Science and Engineering, University of Connecticut, Storrs, USA","Dept. of Computer Science and Engineering, Univ. of Connecticut, Storrs, CT, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, University of Connecticut, Storrs, USA","institution_ids":["https://openalex.org/I140172145"]},{"raw_affiliation_string":"Dept. of Computer Science and Engineering, Univ. of Connecticut, Storrs, CT, USA","institution_ids":["https://openalex.org/I140172145"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5034177039","display_name":"Sanguthevar Rajasekaran","orcid":null},"institutions":[{"id":"https://openalex.org/I140172145","display_name":"University of Connecticut","ror":"https://ror.org/02der9h97","country_code":"US","type":"education","lineage":["https://openalex.org/I140172145"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sanguthevar Rajasekaran","raw_affiliation_strings":["Department of Computer Science and Engineering, University of Connecticut, Storrs, USA","Dept. of Computer Science and Engineering, Univ. of Connecticut, Storrs, CT, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, University of Connecticut, Storrs, USA","institution_ids":["https://openalex.org/I140172145"]},{"raw_affiliation_string":"Dept. of Computer Science and Engineering, Univ. of Connecticut, Storrs, CT, USA","institution_ids":["https://openalex.org/I140172145"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5100689981"],"corresponding_institution_ids":["https://openalex.org/I140172145"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.13144641,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"2013","issue":null,"first_page":"000612","last_page":"000617"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11181","display_name":"Advanced Data Storage Technologies","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11181","display_name":"Advanced Data Storage Technologies","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9919999837875366,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6592562794685364},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.632956862449646},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4708782136440277},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3418129086494446},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1623435914516449}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6592562794685364},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.632956862449646},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4708782136440277},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3418129086494446},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1623435914516449}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/iscc.2013.6755015","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iscc.2013.6755015","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE Symposium on Computers and Communications (ISCC)","raw_type":"proceedings-article"},{"id":"pmid:25374478","is_oa":false,"landing_page_url":"https://pubmed.ncbi.nlm.nih.gov/25374478","pdf_url":null,"source":{"id":"https://openalex.org/S4306525036","display_name":"PubMed","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. IEEE Symposium on Computers and Communications","raw_type":null},{"id":"pmh:oai:europepmc.org:3187056","is_oa":false,"landing_page_url":"https://www.ncbi.nlm.nih.gov/pmc/articles/4217089","pdf_url":null,"source":{"id":"https://openalex.org/S4306400806","display_name":"Europe PMC (PubMed Central)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1303153112","host_organization_name":"European Bioinformatics Institute","host_organization_lineage":["https://openalex.org/I1303153112"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W177465002","https://openalex.org/W1573284583","https://openalex.org/W1593624276","https://openalex.org/W1833281054","https://openalex.org/W1989640573","https://openalex.org/W1996641400","https://openalex.org/W2015326607","https://openalex.org/W2028660080","https://openalex.org/W2033191517","https://openalex.org/W2043843644","https://openalex.org/W2054458592","https://openalex.org/W2055647979","https://openalex.org/W2073788871","https://openalex.org/W2081497327","https://openalex.org/W2098342114","https://openalex.org/W2100117580","https://openalex.org/W2103201239","https://openalex.org/W2105343907","https://openalex.org/W2116843036","https://openalex.org/W2129066975","https://openalex.org/W2158743649","https://openalex.org/W2403942591","https://openalex.org/W2498631646","https://openalex.org/W4234318375","https://openalex.org/W6634275599","https://openalex.org/W6660948324"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2748952813","https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W4396701345","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W4396696052"],"abstract_inverted_index":{"Numerous":[0],"OLAP":[1],"queries":[2],"process":[3],"selection":[4,54,85],"operations":[5,46],"of":[6,28,44,144,222],"\"top":[7,10],"N\",":[8],"median,":[9],"5%\",":[11],"in":[12,25,114,151,170],"data":[13,29,36,206],"warehousing":[14],"applications.":[15],"Selection":[16,78],"is":[17,134,148,198,211],"a":[18,42,73,100,135,149],"well-studied":[19],"problem":[20],"that":[21,132,181],"has":[22,55],"numerous":[23],"applications":[24],"the":[26,82,115,118,125,141,152,189,194,208,215,220],"management":[27],"and":[30,50,122,184,201],"databases":[31,65],"since,":[32],"typically,":[33],"any":[34,176],"complex":[35],"query":[37],"can":[38],"be":[39],"reduced":[40],"to":[41,80,203],"series":[43],"basic":[45],"such":[47],"as":[48],"sorting":[49],"selection.":[51],"The":[52],"parallel":[53,64],"also":[56],"become":[57],"an":[58],"important":[59],"fundamental":[60],"operation,":[61],"especially":[62],"after":[63],"were":[66],"introduced.":[67],"In":[68],"this":[69],"paper,":[70],"we":[71,88],"present":[72],"deterministic":[74],"algorithm":[75,109,139,167,196],"<i>Recursive":[76],"Sampling":[77,120],"(RSS)</i>":[79],"solve":[81],"exact":[83],"out-of-core":[84],"problem,":[86],"which":[87],"show":[89],"needs":[90],"no":[91],"more":[92,199],"than":[93,214],"(2":[94,136,171],"+":[95,137,172],"<i>\u03b5</i>)":[96,173],"passes":[97,174],"(<i>\u03b5</i>":[98],"being":[99],"very":[101],"small":[102],"fraction).":[103],"We":[104],"have":[105],"compared":[106],"our":[107,165],"<i>RSS</i>":[108,168,183,197],"with":[110],"two":[111],"other":[112],"algorithms":[113],"literature,":[116],"namely,":[117],"<i>Deterministic":[119],"Selection</i>":[121],"<i>QuickSelect</i>":[123,187],"on":[124,188],"Parallel":[126,190],"Disks":[127,191],"Systems.":[128,192],"Our":[129],"analysis":[130],"shows":[131],"<i>DSS</i>":[133,185],"<i>\u03b5</i>)-pass":[138],"when":[140,207],"total":[142],"number":[143],"input":[145,209],"elements":[146],"<i>N</i>":[147,157,223],"polynomial":[150],"memory":[153,217],"size":[154,210],"<i>M</i>":[155],"(i.e.,":[156],"=":[158],"<i>M<sup>c</sup></i>":[159,225],"for":[160],"some":[161],"constant":[162],"<i>c</i>).":[163],"While,":[164],"proposed":[166,195],"runs":[169],"without":[175],"assumptions.":[177],"Experimental":[178],"results":[179],"indicate":[180],"both":[182],"outperform":[186],"Especially,":[193],"scalable":[200],"robust":[202],"handle":[204],"big":[205],"far":[212],"greater":[213],"core":[216],"size,":[218],"including":[219],"case":[221],"\u226b":[224],".":[226]},"counts_by_year":[{"year":2020,"cited_by_count":1}],"updated_date":"2026-01-13T01:12:25.745995","created_date":"2025-10-10T00:00:00"}