{"id":"https://openalex.org/W2083039049","doi":"https://doi.org/10.1145/564691.564731","title":"Minimal probing: supporting expensive predicates for top-k queries","display_name":"Minimal probing: supporting expensive predicates for top-k queries","alternate_titles":[],"publication_year":2002,"publication_date":"2002-06-03","ids":{"openalex":"https://openalex.org/W2083039049","doi":"https://doi.org/10.1145/564691.564731","mag":"2083039049"},"language":"en","primary_location":{"id":"doi:10.1145/564691.564731","doi":"https://doi.org/10.1145/564691.564731","is_oa":false,"landing_page_url":"https://doi.org/10.1145/564691.564731","pdf_url":null,"source":{"id":"https://openalex.org/S4393915683","display_name":"ACM SIGMOD International Conference on Management of Data (SIGMOD)","issn_l":"0730-8078","issn":["0730-8078"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":["norway-1"],"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2002 ACM SIGMOD international conference on Management of data","raw_type":"proceedings-article"},"parent_works":[],"lineage":["https://openalex.org/W2083039049"],"child_works_count":0,"type":"conference-paper","is_traditional":true,"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/A5101880377","display_name":"Kevin Chen\u2013Chuan Chang","orcid":"https://orcid.org/0000-0003-0997-6803","observed_orcids":["https://orcid.org/0000-0003-0997-6803"]},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kevin Chen-Chuan Chang","raw_affiliation_strings":["University of Illinois, Urbana-Champaign"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Illinois, Urbana-Champaign","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101567750","display_name":"Seung-won Hwang","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Seung-won Hwang","raw_affiliation_strings":["University of Illinois, Urbana-Champaign"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Illinois, Urbana-Champaign","institution_ids":["https://openalex.org/I157725225"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I157725225"],"apc_list":null,"apc_paid":null,"fwci":7.6678,"has_fulltext":false,"cited_by_count":286,"citation_normalized_percentile":{"value":0.9793559,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"346","last_page":"357"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9429000020027161,"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"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9429000020027161,"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"}},{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.05260000005364418,"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"}},{"id":"https://openalex.org/T10286","display_name":"Information Retrieval and Search Behavior","score":0.000699999975040555,"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/parallel-query-processing","display_name":"parallel query processing","score":0.7580000162124634},{"id":"https://openalex.org/keywords/user-defined-functions","display_name":"user-defined functions","score":0.5479999780654907}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8660919666290283},{"id":"https://openalex.org/C2778692605","wikidata":"https://www.wikidata.org/wiki/Q4041866","display_name":"Joins","level":2,"score":0.5506399273872375},{"id":"https://openalex.org/C88548561","wikidata":"https://www.wikidata.org/wiki/Q347599","display_name":"sort","level":2,"score":0.47152456641197205},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4664195477962494},{"id":"https://openalex.org/C197129107","wikidata":"https://www.wikidata.org/wiki/Q1921621","display_name":"Merge (version control)","level":2,"score":0.44794559478759766},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.43901771306991577},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.3383557200431824},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.2600439786911011}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/564691.564731","doi":"https://doi.org/10.1145/564691.564731","is_oa":false,"landing_page_url":"https://doi.org/10.1145/564691.564731","pdf_url":null,"source":{"id":"https://openalex.org/S4393915683","display_name":"ACM SIGMOD International Conference on Management of Data (SIGMOD)","issn_l":"0730-8078","issn":["0730-8078"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":["norway-1"],"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2002 ACM SIGMOD international conference on Management of data","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W23281170","https://openalex.org/W1488719427","https://openalex.org/W1570542661","https://openalex.org/W1600580971","https://openalex.org/W1983362322","https://openalex.org/W2018177083","https://openalex.org/W2038281398","https://openalex.org/W2039407144","https://openalex.org/W2086174602","https://openalex.org/W2093979658","https://openalex.org/W2098025050","https://openalex.org/W2122410182","https://openalex.org/W2133900260","https://openalex.org/W2134206624","https://openalex.org/W2145609583","https://openalex.org/W2148322068","https://openalex.org/W2149328866","https://openalex.org/W2160967997","https://openalex.org/W2164520297","https://openalex.org/W2221389368","https://openalex.org/W2752885492","https://openalex.org/W2912565176","https://openalex.org/W2939083804","https://openalex.org/W3151742073","https://openalex.org/W4211007335","https://openalex.org/W4246219036","https://openalex.org/W4254335296","https://openalex.org/W6678087030","https://openalex.org/W7029321148"],"related_works":["https://openalex.org/W7097567803","https://openalex.org/W2149229615","https://openalex.org/W1965370151","https://openalex.org/W4408219898","https://openalex.org/W2118265701","https://openalex.org/W4246148897","https://openalex.org/W2150965582","https://openalex.org/W2084538728","https://openalex.org/W2116936708"],"abstract_inverted_index":{"This":[0],"paper":[1],"addresses":[2],"the":[3,153,175,223],"problem":[4],"of":[5,46,156,219],"evaluating":[6],"ranked":[7,30,38,123],"top-k":[8,144],"queries":[9,31,39,124],"with":[10,180],"expensive":[11,19,148],"predicates.":[12],"As":[13],"major":[14],"DBMSs":[15],"now":[16],"all":[17,135],"support":[18,28],"user-defined":[20,55,84],"predicates":[21,63,129],"for":[22,29,53,64,122],"Boolean":[23],"queries,":[24],"we":[25,150,185],"believe":[26],"such":[27,128],"will":[32],"be":[33,194,217],"even":[34],"more":[35],"important:":[36],"First":[37],"often":[40],"need":[41],"to":[42,104,115,142],"model":[43],"user-specific":[44],"concepts":[45],"preference,":[47],"relevance,":[48],"or":[49,96],"similarity,":[50],"which":[51,159,215],"call":[52],"dynamic":[54],"functions.":[56],"Second,":[57],"middleware":[58],"systems":[59],"must":[60,110,132],"incorporate":[61],"external":[62],"integrating":[65],"autonomous":[66],"sources":[67],"typically":[68],"accessible":[69],"only":[70],"by":[71,173],"per-object":[72,113],"queries.":[73],"Third,":[74],"fuzzy":[75],"joins":[76],"are":[77,82],"inherently":[78],"expensive,":[79],"as":[80],"they":[81],"essentially":[83],"operations":[85],"that":[86,187,209],"dynamically":[87,94],"associate":[88],"multiple":[89],"relations.":[90],"These":[91],"predicates,":[92],"being":[93],"defined":[95],"externally":[97],"accessed,":[98],"cannot":[99,125],"rely":[100],"on":[101],"index":[102],"mechanisms":[103],"provide":[105],"zero-time":[106],"sorted":[107],"output,":[108],"and":[109,139,192,205],"instead":[111],"require":[112],"probe":[114,134,163,182,213],"evaluate.":[116],"The":[117],"current":[118],"standard":[119,224],"sort-merge":[120],"framework":[121],"efficiently":[126],"handle":[127],"because":[130],"it":[131],"completely":[133],"objects,":[136],"before":[137],"sorting":[138],"merging":[140],"them":[141],"produce":[143],"answers.":[145],"To":[146],"minimize":[147],"probes,":[149],"thus":[151],"develop":[152],"formal":[154],"principle":[155],"\"necessary":[157],"probes,\"":[158],"determines":[160],"if":[161],"a":[162,201],"is":[164,177],"absolutely":[165],"required.":[166],"We":[167],"then":[168],"propose":[169],"Algorithm":[170],"MPro":[171,188,210],"which,":[172],"implementing":[174],"principle,":[176],"provably":[178],"optimal":[179],"minimal":[181],"cost.":[183],"Further,":[184],"show":[186,208],"can":[189,193,216],"scale":[190],"well":[191],"easily":[195],"parallelized.":[196],"Our":[197],"experiments":[198],"using":[199,226],"both":[200],"real-estate":[202],"benchmark":[203],"database":[204],"synthetic":[206],"datasets":[207],"enables":[211],"significant":[212],"reduction,":[214],"orders":[218],"magnitude":[220],"faster":[221],"than":[222],"scheme":[225],"complete":[227],"probing.":[228]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2083039049","counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":9},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":12},{"year":2013,"cited_by_count":18},{"year":2012,"cited_by_count":21}],"updated_date":"2026-11-17T12:49:18.490984","created_date":"2016-06-24T00:00:00"}
