{"id":"https://openalex.org/W1988755505","doi":"https://doi.org/10.1145/1247480.1247568","title":"Optimization of multi-version expensive predicates","display_name":"Optimization of multi-version expensive predicates","publication_year":2007,"publication_date":"2007-06-11","ids":{"openalex":"https://openalex.org/W1988755505","doi":"https://doi.org/10.1145/1247480.1247568","mag":"1988755505"},"language":"en","primary_location":{"id":"doi:10.1145/1247480.1247568","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1247480.1247568","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2007 ACM SIGMOD international conference on Management of data","raw_type":"proceedings-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/A5072579932","display_name":"Iosif Lazaridis","orcid":"https://orcid.org/0000-0002-4094-9347"},"institutions":[{"id":"https://openalex.org/I204250578","display_name":"University of California, Irvine","ror":"https://ror.org/04gyf1771","country_code":"US","type":"education","lineage":["https://openalex.org/I204250578"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Iosif Lazaridis","raw_affiliation_strings":["University of California: Irvine, Irvine, CA"],"affiliations":[{"raw_affiliation_string":"University of California: Irvine, Irvine, CA","institution_ids":["https://openalex.org/I204250578"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5010114060","display_name":"Sharad Mehrotra","orcid":"https://orcid.org/0000-0003-1667-5435"},"institutions":[{"id":"https://openalex.org/I204250578","display_name":"University of California, Irvine","ror":"https://ror.org/04gyf1771","country_code":"US","type":"education","lineage":["https://openalex.org/I204250578"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sharad Mehrotra","raw_affiliation_strings":["University of California: Irvine, Irvine, CA"],"affiliations":[{"raw_affiliation_string":"University of California: Irvine, Irvine, CA","institution_ids":["https://openalex.org/I204250578"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5072579932"],"corresponding_institution_ids":["https://openalex.org/I204250578"],"apc_list":null,"apc_paid":null,"fwci":1.6044,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.8426528,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"797","last_page":"808"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.9998000264167786,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9998000264167786,"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/T11106","display_name":"Data Management and Algorithms","score":0.9997000098228455,"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/T10215","display_name":"Semantic Web and Ontologies","score":0.9919000267982483,"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/tuple","display_name":"Tuple","score":0.9271043539047241},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7837936282157898},{"id":"https://openalex.org/keywords/predicate","display_name":"Predicate (mathematical logic)","score":0.6381050944328308},{"id":"https://openalex.org/keywords/filter","display_name":"Filter (signal processing)","score":0.456013023853302},{"id":"https://openalex.org/keywords/query-optimization","display_name":"Query optimization","score":0.4499158561229706},{"id":"https://openalex.org/keywords/query-plan","display_name":"Query plan","score":0.4371863007545471},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4176935851573944},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.4175453782081604},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3287815451622009},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.297882080078125},{"id":"https://openalex.org/keywords/information-retrieval","display_name":"Information retrieval","score":0.18739408254623413},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.1659981906414032},{"id":"https://openalex.org/keywords/search-engine","display_name":"Search engine","score":0.15809893608093262},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1466386914253235},{"id":"https://openalex.org/keywords/web-search-query","display_name":"Web search query","score":0.10135707259178162},{"id":"https://openalex.org/keywords/sargable","display_name":"Sargable","score":0.09219193458557129}],"concepts":[{"id":"https://openalex.org/C118930307","wikidata":"https://www.wikidata.org/wiki/Q600590","display_name":"Tuple","level":2,"score":0.9271043539047241},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7837936282157898},{"id":"https://openalex.org/C140146324","wikidata":"https://www.wikidata.org/wiki/Q1144319","display_name":"Predicate (mathematical logic)","level":2,"score":0.6381050944328308},{"id":"https://openalex.org/C106131492","wikidata":"https://www.wikidata.org/wiki/Q3072260","display_name":"Filter (signal processing)","level":2,"score":0.456013023853302},{"id":"https://openalex.org/C157692150","wikidata":"https://www.wikidata.org/wiki/Q2919848","display_name":"Query optimization","level":2,"score":0.4499158561229706},{"id":"https://openalex.org/C2779729312","wikidata":"https://www.wikidata.org/wiki/Q784232","display_name":"Query plan","level":5,"score":0.4371863007545471},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4176935851573944},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.4175453782081604},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3287815451622009},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.297882080078125},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.18739408254623413},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1659981906414032},{"id":"https://openalex.org/C97854310","wikidata":"https://www.wikidata.org/wiki/Q19541","display_name":"Search engine","level":2,"score":0.15809893608093262},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1466386914253235},{"id":"https://openalex.org/C164120249","wikidata":"https://www.wikidata.org/wiki/Q995982","display_name":"Web search query","level":3,"score":0.10135707259178162},{"id":"https://openalex.org/C192939062","wikidata":"https://www.wikidata.org/wiki/Q104840822","display_name":"Sargable","level":4,"score":0.09219193458557129},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","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},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.0},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1247480.1247568","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1247480.1247568","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2007 ACM SIGMOD international conference on Management of data","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1563265404","https://openalex.org/W2060883486","https://openalex.org/W2063296107","https://openalex.org/W2079806729","https://openalex.org/W2101207848","https://openalex.org/W2105394657","https://openalex.org/W2145609583","https://openalex.org/W2150397765","https://openalex.org/W2153329411","https://openalex.org/W2160967997","https://openalex.org/W2203361072","https://openalex.org/W2582743722","https://openalex.org/W3151742073","https://openalex.org/W4233762723"],"related_works":["https://openalex.org/W2347305876","https://openalex.org/W1977331029","https://openalex.org/W2941854747","https://openalex.org/W2154423717","https://openalex.org/W50436801","https://openalex.org/W1943557536","https://openalex.org/W2137603913","https://openalex.org/W4361194359","https://openalex.org/W4379799305","https://openalex.org/W2168708570"],"abstract_inverted_index":{"Modern":[0],"query":[1,27],"optimizers":[2],"need":[3],"to":[4,19,59,104],"take":[5],"into":[6,88],"account":[7],"the":[8,35,38,57,64,95,101,105,149,161],"performance":[9],"of":[10,37,56,76,107,160],"expensive":[11,39],"user-defined":[12],"predicates.":[13],"Existing":[14],"research":[15],"has":[16],"shown":[17],"how":[18,43,129],"incorporate":[20],"such":[21],"predicates":[22,40,58,167],"in":[23],"a":[24,73,109],"traditional":[25],"cost-based":[26],"optimizer.":[28],"In":[29],"this":[30],"paper":[31],"we":[32],"deal":[33],"with":[34],"optimization":[36],"themselves,":[41],"showing":[42],"their":[44],"cost":[45,139],"can":[46,135],"be":[47],"reduced":[48],"by":[49,113],"utilizing":[50],"cheaper,":[51],"but":[52],"less":[53],"accurate,":[54],"versions":[55],"pre-filter":[60],"tuples.":[61],"We":[62,99,126],"discuss":[63],"generalized":[65,123],"tuple":[66,86,97],"handling":[67],"mechanism,":[68],"which":[69],"processes":[70],"tuples":[71,145],"along":[72],"fixed":[74],"sequence":[75],"versions,":[77],"as":[78,80],"well":[79],"adaptive":[81],"approaches":[82],"that":[83,163],"either":[84],"split":[85],"streams":[87],"groups,":[89],"or":[90,132],"make":[91],"routing":[92],"decisions":[93],"at":[94],"individual":[96],"level.":[98],"identify":[100],"lower":[102],"bound":[103],"problem":[106],"evaluating":[108],"multi-version":[110,166],"selection":[111],"predicate":[112],"an":[114,121,137],"ideal":[115],"individualized":[116,131],"plan":[117,124],"(IIP),":[118],"and":[119,142],"develop":[120],"optimal":[122],"(OGP).":[125],"then":[127],"show":[128],"realistic":[130],"grouped":[133],"schemes":[134],"produce":[136],"intermediate":[138],"between":[140],"OGP":[141],"IIP,":[143],"if":[144],"substantially":[146],"deviate":[147],"from":[148],"average":[150],"stream":[151],"behavior.":[152],"Our":[153],"algorithms":[154],"are":[155,168],"tested":[156],"experimentally,":[157],"identifying":[158],"many":[159],"issues":[162],"arise":[164],"whenever":[165],"used.":[169]},"counts_by_year":[{"year":2022,"cited_by_count":3},{"year":2018,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}