{"id":"https://openalex.org/W2156988844","doi":"https://doi.org/10.1109/iri-05.2005.1506446","title":"A lattice framework for reusing top-k query results","display_name":"A lattice framework for reusing top-k query results","publication_year":2005,"publication_date":"2005-09-12","ids":{"openalex":"https://openalex.org/W2156988844","doi":"https://doi.org/10.1109/iri-05.2005.1506446","mag":"2156988844"},"language":"en","primary_location":{"id":"doi:10.1109/iri-05.2005.1506446","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iri-05.2005.1506446","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IRI -2005 IEEE International Conference on Information Reuse and Integration, Conf, 2005.","raw_type":"proceedings-article"},"type":"conference-paper","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/A5112471854","display_name":"Brandeis Hill","orcid":null},"institutions":[{"id":"https://openalex.org/I165799507","display_name":"Rensselaer Polytechnic Institute","ror":"https://ror.org/01rtyzb94","country_code":"US","type":"education","lineage":["https://openalex.org/I165799507"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"B. Hill","raw_affiliation_strings":["Department of Computer Science, Rensselaer Polytechnic Institute, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Rensselaer Polytechnic Institute, USA","institution_ids":["https://openalex.org/I165799507"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5112471854"],"corresponding_institution_ids":["https://openalex.org/I165799507"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.29966547,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"2 3","issue":null,"first_page":"38","last_page":"43"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9998999834060669,"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.9998999834060669,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9983000159263611,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9939000010490417,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.8016396760940552},{"id":"https://openalex.org/keywords/ranking","display_name":"Ranking (information retrieval)","score":0.690207839012146},{"id":"https://openalex.org/keywords/query-expansion","display_name":"Query expansion","score":0.6331362724304199},{"id":"https://openalex.org/keywords/information-retrieval","display_name":"Information retrieval","score":0.6272372603416443},{"id":"https://openalex.org/keywords/reuse","display_name":"Reuse","score":0.6167672276496887},{"id":"https://openalex.org/keywords/search-engine","display_name":"Search engine","score":0.560478687286377},{"id":"https://openalex.org/keywords/cache","display_name":"Cache","score":0.5280471444129944},{"id":"https://openalex.org/keywords/web-search-query","display_name":"Web search query","score":0.5133296847343445},{"id":"https://openalex.org/keywords/sargable","display_name":"Sargable","score":0.4696331024169922},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.4198358654975891},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.3599017858505249},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.08890953660011292}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8016396760940552},{"id":"https://openalex.org/C189430467","wikidata":"https://www.wikidata.org/wiki/Q7293293","display_name":"Ranking (information retrieval)","level":2,"score":0.690207839012146},{"id":"https://openalex.org/C99016210","wikidata":"https://www.wikidata.org/wiki/Q5488129","display_name":"Query expansion","level":2,"score":0.6331362724304199},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.6272372603416443},{"id":"https://openalex.org/C206588197","wikidata":"https://www.wikidata.org/wiki/Q846574","display_name":"Reuse","level":2,"score":0.6167672276496887},{"id":"https://openalex.org/C97854310","wikidata":"https://www.wikidata.org/wiki/Q19541","display_name":"Search engine","level":2,"score":0.560478687286377},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.5280471444129944},{"id":"https://openalex.org/C164120249","wikidata":"https://www.wikidata.org/wiki/Q995982","display_name":"Web search query","level":3,"score":0.5133296847343445},{"id":"https://openalex.org/C192939062","wikidata":"https://www.wikidata.org/wiki/Q104840822","display_name":"Sargable","level":4,"score":0.4696331024169922},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.4198358654975891},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.3599017858505249},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.08890953660011292},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","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.1109/iri-05.2005.1506446","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iri-05.2005.1506446","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IRI -2005 IEEE International Conference on Information Reuse and Integration, Conf, 2005.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1565569578","https://openalex.org/W1978063867","https://openalex.org/W1979464183","https://openalex.org/W1994159485","https://openalex.org/W2027752285","https://openalex.org/W2032884539","https://openalex.org/W2044523992","https://openalex.org/W2051834357","https://openalex.org/W2073853190","https://openalex.org/W2083039049","https://openalex.org/W2086453025","https://openalex.org/W2134195632","https://openalex.org/W2142385580","https://openalex.org/W2666600683","https://openalex.org/W4256046779"],"related_works":["https://openalex.org/W2096359267","https://openalex.org/W2901901036","https://openalex.org/W2093300859","https://openalex.org/W2026738364","https://openalex.org/W2124814993","https://openalex.org/W2572349046","https://openalex.org/W3049728138","https://openalex.org/W3125756434","https://openalex.org/W1793997780","https://openalex.org/W4321649654"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,145],"address":[4],"the":[5,9,31,53,59,65,70,112,116,120,124,152],"issue":[6],"of":[7,20,23,52,139],"reusing":[8],"top-k":[10],"query":[11,18,60],"results":[12,41,51,96,102],"for":[13,47],"information":[14],"retrieval":[15],"applications.":[16],"A":[17],"comprises":[19],"a":[21,85,98,104],"number":[22],"search":[24,33,37,54,92],"terms":[25,38,55,93],"in":[26,81,97,106,143],"which":[27,144],"multiple":[28],"queries":[29,71],"use":[30],"same":[32],"terms.":[34],"The":[35,49,100],"re-occurring":[36],"and":[39,44,63,94,149],"associated":[40],"are":[42,56,72],"indexed":[43],"easily":[45],"accessible":[46],"retrieval.":[48],"individual":[50],"merged":[57],"during":[58],"processing":[61],"stage":[62],"return":[64],"best":[66],"combined":[67],"results.":[68],"Hence,":[69],"observed":[73],"as":[74],"independent":[75],"events":[76],"but":[77],"should":[78],"be":[79],"viewed":[80],"tandem.":[82],"We":[83,114,134],"present":[84],"lattice":[86],"framework":[87,142],"that":[88],"groups":[89],"frequently":[90],"requested":[91],"corresponding":[95],"cache.":[99],"stored":[101,132],"provide":[103],"reduction":[105],"database":[107],"accesses":[108],"while":[109],"minimally":[110],"affecting":[111],"performance.":[113],"compare":[115],"aggregate":[117,126],"ranking":[118,127],"(from":[119],"actual":[121],"rankings)":[122],"to":[123,151],"lattice-based":[125],"(using":[128],"at":[129],"least":[130],"one":[131],"result).":[133],"perform":[135],"an":[136],"empirical":[137],"study":[138],"our":[140],"proposed":[141],"analyze":[146],"its":[147],"benefits":[148],"drawbacks":[150],"conventional":[153],"method.":[154]},"counts_by_year":[{"year":2016,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}