{"id":"https://openalex.org/W2444414580","doi":"https://doi.org/10.1109/icdew.2016.7495635","title":"Exploiting SIMD for complex numerical predicates","display_name":"Exploiting SIMD for complex numerical predicates","publication_year":2016,"publication_date":"2016-05-01","ids":{"openalex":"https://openalex.org/W2444414580","doi":"https://doi.org/10.1109/icdew.2016.7495635","mag":"2444414580"},"language":"en","primary_location":{"id":"doi:10.1109/icdew.2016.7495635","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icdew.2016.7495635","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE 32nd International Conference on Data Engineering Workshops (ICDEW)","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/A5057961856","display_name":"Dongxiao Song","orcid":"https://orcid.org/0000-0003-2870-4299"},"institutions":[{"id":"https://openalex.org/I19820366","display_name":"Chinese Academy of Sciences","ror":"https://ror.org/034t30j35","country_code":"CN","type":"funder","lineage":["https://openalex.org/I19820366"]},{"id":"https://openalex.org/I4210090176","display_name":"Institute of Computing Technology","ror":"https://ror.org/0090r4d87","country_code":"CN","type":"facility","lineage":["https://openalex.org/I19820366","https://openalex.org/I4210090176"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Dongxiao Song","raw_affiliation_strings":["State Key Laboratory of Computer Architecture, Institute of Computing Technology, Chinese Academy of Sciences, China"],"affiliations":[{"raw_affiliation_string":"State Key Laboratory of Computer Architecture, Institute of Computing Technology, Chinese Academy of Sciences, China","institution_ids":["https://openalex.org/I4210090176","https://openalex.org/I19820366"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101499113","display_name":"Shimin Chen","orcid":"https://orcid.org/0009-0000-1043-6236"},"institutions":[{"id":"https://openalex.org/I4210090176","display_name":"Institute of Computing Technology","ror":"https://ror.org/0090r4d87","country_code":"CN","type":"facility","lineage":["https://openalex.org/I19820366","https://openalex.org/I4210090176"]},{"id":"https://openalex.org/I19820366","display_name":"Chinese Academy of Sciences","ror":"https://ror.org/034t30j35","country_code":"CN","type":"funder","lineage":["https://openalex.org/I19820366"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Shimin Chen","raw_affiliation_strings":["State Key Laboratory of Computer Architecture, Institute of Computing Technology, Chinese Academy of Sciences, China"],"affiliations":[{"raw_affiliation_string":"State Key Laboratory of Computer Architecture, Institute of Computing Technology, Chinese Academy of Sciences, China","institution_ids":["https://openalex.org/I4210090176","https://openalex.org/I19820366"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5057961856"],"corresponding_institution_ids":["https://openalex.org/I19820366","https://openalex.org/I4210090176"],"apc_list":null,"apc_paid":null,"fwci":2.0376,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.87543192,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"143","last_page":"149"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9988999962806702,"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.9988999962806702,"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.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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9954000115394592,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/simd","display_name":"SIMD","score":0.9461230039596558},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8629977703094482},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.85096675157547},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.7457587718963623},{"id":"https://openalex.org/keywords/predicate","display_name":"Predicate (mathematical logic)","score":0.5708346366882324},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4355852007865906},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3764823079109192},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.33813583850860596}],"concepts":[{"id":"https://openalex.org/C150552126","wikidata":"https://www.wikidata.org/wiki/Q339387","display_name":"SIMD","level":2,"score":0.9461230039596558},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8629977703094482},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.85096675157547},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.7457587718963623},{"id":"https://openalex.org/C140146324","wikidata":"https://www.wikidata.org/wiki/Q1144319","display_name":"Predicate (mathematical logic)","level":2,"score":0.5708346366882324},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4355852007865906},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3764823079109192},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.33813583850860596}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icdew.2016.7495635","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icdew.2016.7495635","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE 32nd International Conference on Data Engineering Workshops (ICDEW)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1487010321","https://openalex.org/W1509841269","https://openalex.org/W1570477871","https://openalex.org/W1584770030","https://openalex.org/W2025826925","https://openalex.org/W2048622250","https://openalex.org/W2055774867","https://openalex.org/W2086977914","https://openalex.org/W2096496252","https://openalex.org/W2163422235","https://openalex.org/W2764491622"],"related_works":["https://openalex.org/W2317245370","https://openalex.org/W2099629705","https://openalex.org/W4249323025","https://openalex.org/W198851386","https://openalex.org/W1980160788","https://openalex.org/W2030310580","https://openalex.org/W947442053","https://openalex.org/W2148915962","https://openalex.org/W4313433561","https://openalex.org/W2283866686"],"abstract_inverted_index":{"We":[0,65,88],"study":[1],"the":[2,45,48,68,71,74,135],"use":[3,23],"of":[4,47,53,58,70,76,113],"SIMD":[5,97,126,138,147],"instructions":[6],"to":[7,14,19,131,142],"support":[8],"complex":[9,86],"conjunctive":[10,100],"numerical":[11],"predicates.":[12,87,101,115],"Compared":[13],"previous":[15],"studies,":[16],"we":[17,103],"aim":[18],"model":[20],"more":[21],"realistic":[22],"scenarios,":[24],"where":[25],"different":[26,29,33],"data":[27,121],"types,":[28],"comparison":[30],"operations,":[31],"and":[32,73,84,110,140],"predicate":[34],"types":[35],"can":[36,55,128],"be":[37],"mixed":[38],"in":[39,82],"a":[40,51,90],"single":[41],"filtering":[42,114],"clause.":[43],"Moreover,":[44],"evaluation":[46,112],"predicates":[49,72],"on":[50,94,119],"set":[52],"columns":[54],"take":[56],"advantage":[57],"multiple":[59,77],"processor":[60],"cores":[61],"for":[62,99,107],"maximum":[63],"speed.":[64],"find":[66],"that":[67,123],"diversity":[69],"introduction":[75],"threads":[78],"pose":[79],"significant":[80],"challenges":[81],"modeling":[83],"optimizing":[85],"propose":[89],"code":[91],"framework":[92],"based":[93],"three":[95],"alternative":[96],"algorithms":[98],"Then,":[102],"investigate":[104],"cost":[105],"models":[106],"both":[108],"single-threaded":[109],"multi-threaded":[111],"Our":[116],"experimental":[117],"results":[118],"synthetic":[120],"show":[122],"an":[124],"optimal":[125],"plan":[127],"achieve":[129],"up":[130,141],"10.4\u00d7":[132],"speedup":[133,144],"over":[134,145],"best":[136],"no":[137],"plan,":[139],"6.8\u00d7":[143],"sub-optimal":[146],"plans.":[148]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}