{"id":"https://openalex.org/W2253396376","doi":"https://doi.org/10.1631/fitee.1500190","title":"Efficient dynamic pruning on largest scores first (LSF) retrieval","display_name":"Efficient dynamic pruning on largest scores first (LSF) retrieval","publication_year":2016,"publication_date":"2016-01-01","ids":{"openalex":"https://openalex.org/W2253396376","doi":"https://doi.org/10.1631/fitee.1500190","mag":"2253396376"},"language":"en","primary_location":{"id":"doi:10.1631/fitee.1500190","is_oa":false,"landing_page_url":"https://doi.org/10.1631/fitee.1500190","pdf_url":null,"source":{"id":"https://openalex.org/S4210189857","display_name":"Frontiers of Information Technology & Electronic Engineering","issn_l":"2095-9184","issn":["2095-9184","2095-9230"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Frontiers of Information Technology & Electronic Engineering","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"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/A5023890542","display_name":"Kun Jiang","orcid":"https://orcid.org/0000-0003-1316-5237"},"institutions":[{"id":"https://openalex.org/I170215575","display_name":"National University of Defense Technology","ror":"https://ror.org/05d2yfz11","country_code":"CN","type":"education","lineage":["https://openalex.org/I170215575"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Kun Jiang","raw_affiliation_strings":["College of Computer, National University of Defense Technology, Changsha, 410073, China"],"affiliations":[{"raw_affiliation_string":"College of Computer, National University of Defense Technology, Changsha, 410073, China","institution_ids":["https://openalex.org/I170215575"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101033151","display_name":"Yuexiang Yang","orcid":null},"institutions":[{"id":"https://openalex.org/I170215575","display_name":"National University of Defense Technology","ror":"https://ror.org/05d2yfz11","country_code":"CN","type":"education","lineage":["https://openalex.org/I170215575"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yue-xiang Yang","raw_affiliation_strings":["College of Computer, National University of Defense Technology, Changsha, 410073, China"],"affiliations":[{"raw_affiliation_string":"College of Computer, National University of Defense Technology, Changsha, 410073, China","institution_ids":["https://openalex.org/I170215575"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5023890542"],"corresponding_institution_ids":["https://openalex.org/I170215575"],"apc_list":null,"apc_paid":null,"fwci":0.5044,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.61343337,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"17","issue":"1","first_page":"1","last_page":"14"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11106","display_name":"Data Management and Algorithms","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T12016","display_name":"Web Data Mining and Analysis","score":0.9959999918937683,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/tree-traversal","display_name":"Tree traversal","score":0.9222387671470642},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8503681421279907},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.7379740476608276},{"id":"https://openalex.org/keywords/information-retrieval","display_name":"Information retrieval","score":0.4695717990398407},{"id":"https://openalex.org/keywords/baseline","display_name":"Baseline (sea)","score":0.44986653327941895},{"id":"https://openalex.org/keywords/query-expansion","display_name":"Query expansion","score":0.4405122697353363},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.3942130208015442},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.15960386395454407}],"concepts":[{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.9222387671470642},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8503681421279907},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.7379740476608276},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.4695717990398407},{"id":"https://openalex.org/C12725497","wikidata":"https://www.wikidata.org/wiki/Q810247","display_name":"Baseline (sea)","level":2,"score":0.44986653327941895},{"id":"https://openalex.org/C99016210","wikidata":"https://www.wikidata.org/wiki/Q5488129","display_name":"Query expansion","level":2,"score":0.4405122697353363},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.3942130208015442},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.15960386395454407},{"id":"https://openalex.org/C127313418","wikidata":"https://www.wikidata.org/wiki/Q1069","display_name":"Geology","level":0,"score":0.0},{"id":"https://openalex.org/C6557445","wikidata":"https://www.wikidata.org/wiki/Q173113","display_name":"Agronomy","level":1,"score":0.0},{"id":"https://openalex.org/C111368507","wikidata":"https://www.wikidata.org/wiki/Q43518","display_name":"Oceanography","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1631/fitee.1500190","is_oa":false,"landing_page_url":"https://doi.org/10.1631/fitee.1500190","pdf_url":null,"source":{"id":"https://openalex.org/S4210189857","display_name":"Frontiers of Information Technology & Electronic Engineering","issn_l":"2095-9184","issn":["2095-9184","2095-9230"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Frontiers of Information Technology & Electronic Engineering","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W1496881388","https://openalex.org/W1532325895","https://openalex.org/W1858013062","https://openalex.org/W1885526678","https://openalex.org/W1965073288","https://openalex.org/W1973520416","https://openalex.org/W1980344365","https://openalex.org/W1997214779","https://openalex.org/W2000431947","https://openalex.org/W2031302834","https://openalex.org/W2032866865","https://openalex.org/W2058150901","https://openalex.org/W2059387258","https://openalex.org/W2063694594","https://openalex.org/W2065472179","https://openalex.org/W2065721358","https://openalex.org/W2066667100","https://openalex.org/W2108079923","https://openalex.org/W2123006679","https://openalex.org/W2125203709","https://openalex.org/W2135764309","https://openalex.org/W2137339254","https://openalex.org/W2138662031","https://openalex.org/W2140453381","https://openalex.org/W2148212498","https://openalex.org/W2150414292","https://openalex.org/W2154610494","https://openalex.org/W2154615738","https://openalex.org/W2164619507","https://openalex.org/W2164715417","https://openalex.org/W2263798363","https://openalex.org/W2295782468","https://openalex.org/W2295820528","https://openalex.org/W4213009331","https://openalex.org/W4234056896","https://openalex.org/W6681966102"],"related_works":["https://openalex.org/W2136735429","https://openalex.org/W170547082","https://openalex.org/W2587876411","https://openalex.org/W2358332176","https://openalex.org/W4229950834","https://openalex.org/W4301044568","https://openalex.org/W1587123803","https://openalex.org/W2128075414","https://openalex.org/W2571039174","https://openalex.org/W2148159239"],"abstract_inverted_index":{"Inverted":[0],"index":[1,33,59,205],"traversal":[2,34,60,206],"techniques":[3,169],"have":[4],"been":[5],"studied":[6],"in":[7,68,75],"addressing":[8],"the":[9,31,39,49,70,76,84,94,97,106,114,124,128,132,146,153,197,209,216,226,231],"query":[10,81,99,134,190,210],"processing":[11],"performance":[12,142],"challenges":[13],"of":[14,79,96,109,118,126,131,155,189],"web":[15],"search":[16],"engines,":[17],"but":[18],"still":[19],"leave":[20],"much":[21],"room":[22],"for":[23],"improvement.":[24],"In":[25],"this":[26],"paper,":[27],"we":[28,162],"focus":[29],"on":[30,35,171],"inverted":[32],"document-sorted":[36],"indexes":[37],"and":[38,89,113,138,145,181,219],"optimization":[40],"technique":[41],"called":[42,62,177],"dynamic":[43,167],"pruning,":[44],"which":[45,69],"can":[46,103],"efficiently":[47],"reduce":[48,105,152,208],"hardware":[50],"computational":[51],"resources":[52],"required.":[53],"We":[54],"propose":[55],"another":[56],"novel":[57],"exhaustive":[58,235],"scheme":[61,102],"largest":[63,85],"scores":[64,88],"first":[65,73],"(LSF)":[66],"retrieval,":[67],"candidates":[71],"are":[72],"selected":[74],"posting":[77,129],"list":[78,178],"important":[80,175],"terms":[82],"with":[83,93,196,225],"upper":[86],"bound":[87],"then":[90],"fully":[91],"scored":[92],"contribution":[95],"remaining":[98,133],"terms.":[100,135],"The":[101],"effectively":[104],"memory":[107],"consumption":[108],"existing":[110,119],"term-at-atime":[111],"(TAAT)":[112],"candidate":[115],"selection":[116],"cost":[117],"document-at-a-time":[120],"(DAAT)":[121],"retrieval":[122],"at":[123],"expense":[125],"revisiting":[127],"lists":[130],"Preliminary":[136],"analysis":[137],"implementation":[139],"show":[140,201],"comparable":[141],"between":[143],"LSF":[144],"two":[147,174],"well-known":[148],"baselines.":[149],"To":[150],"further":[151],"number":[154],"postings":[156],"that":[157,185,202],"need":[158],"to":[159],"be":[160],"revisited,":[161],"present":[163],"efficient":[164],"rank":[165],"safe":[166],"pruning":[168],"based":[170],"LSF,":[172],"including":[173],"optimizations":[176],"omitting":[179],"(LSF_LO)":[180],"partial":[182],"scoring":[183],"(LSF_PS)":[184],"make":[186],"full":[187],"use":[188],"term":[191],"importance.":[192],"Finally,":[193],"experimental":[194],"results":[195,223,233],"TREC":[198],"GOV2":[199],"collection":[200],"our":[203],"new":[204],"approaches":[207],"latency":[211],"by":[212],"almost":[213],"27%":[214],"over":[215],"WAND":[217],"baseline":[218],"produce":[220],"slightly":[221],"better":[222],"compared":[224],"MaxScore":[227],"baseline,":[228],"while":[229],"returning":[230],"same":[232],"as":[234],"evaluation.":[236]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2026-02-22T13:39:03.778224","created_date":"2025-10-10T00:00:00"}