{"id":"https://openalex.org/W2444247778","doi":"https://doi.org/10.1109/icde.2016.7498316","title":"An interval join optimized for modern hardware","display_name":"An interval join optimized for modern hardware","publication_year":2016,"publication_date":"2016-05-01","ids":{"openalex":"https://openalex.org/W2444247778","doi":"https://doi.org/10.1109/icde.2016.7498316","mag":"2444247778"},"language":"en","primary_location":{"id":"doi:10.1109/icde.2016.7498316","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icde.2016.7498316","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 (ICDE)","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/A5002314532","display_name":"Danila Piatov","orcid":null},"institutions":[{"id":"https://openalex.org/I171543936","display_name":"Free University of Bozen-Bolzano","ror":"https://ror.org/012ajp527","country_code":"IT","type":"education","lineage":["https://openalex.org/I171543936"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Danila Piatov","raw_affiliation_strings":["Faculty of Computer Science, Free University of Bozen-Bolzano, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Computer Science, Free University of Bozen-Bolzano, Italy","institution_ids":["https://openalex.org/I171543936"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5080721885","display_name":"Sven Helmer","orcid":"https://orcid.org/0000-0002-9666-1932"},"institutions":[{"id":"https://openalex.org/I171543936","display_name":"Free University of Bozen-Bolzano","ror":"https://ror.org/012ajp527","country_code":"IT","type":"education","lineage":["https://openalex.org/I171543936"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Sven Helmer","raw_affiliation_strings":["Faculty of Computer Science, Free University of Bozen-Bolzano, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Computer Science, Free University of Bozen-Bolzano, Italy","institution_ids":["https://openalex.org/I171543936"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5037964119","display_name":"Anton Dign\u00f6s","orcid":"https://orcid.org/0000-0002-7621-967X"},"institutions":[{"id":"https://openalex.org/I171543936","display_name":"Free University of Bozen-Bolzano","ror":"https://ror.org/012ajp527","country_code":"IT","type":"education","lineage":["https://openalex.org/I171543936"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Anton Dignos","raw_affiliation_strings":["Faculty of Computer Science, Free University of Bozen-Bolzano, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Computer Science, Free University of Bozen-Bolzano, Italy","institution_ids":["https://openalex.org/I171543936"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I171543936"],"apc_list":null,"apc_paid":null,"fwci":4.8374,"has_fulltext":false,"cited_by_count":55,"citation_normalized_percentile":{"value":0.96543178,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1098","last_page":"1109"},"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.9997000098228455,"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/T10538","display_name":"Data Mining Algorithms and Applications","score":0.9984999895095825,"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/computer-science","display_name":"Computer science","score":0.8581238985061646},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.6517528295516968},{"id":"https://openalex.org/keywords/join","display_name":"Join (topology)","score":0.6498739719390869},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5138393044471741},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.41457247734069824},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.38796836137771606},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33918479084968567}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8581238985061646},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.6517528295516968},{"id":"https://openalex.org/C2776124973","wikidata":"https://www.wikidata.org/wiki/Q3183033","display_name":"Join (topology)","level":2,"score":0.6498739719390869},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5138393044471741},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.41457247734069824},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.38796836137771606},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33918479084968567},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/icde.2016.7498316","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icde.2016.7498316","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 (ICDE)","raw_type":"proceedings-article"},{"id":"pmh:oai:alma.39UBZ_INST:11234955230001241","is_oa":false,"landing_page_url":"http://ieeexplore.ieee.org/document/7498316/?reload=true","pdf_url":null,"source":{"id":"https://openalex.org/S4210197018","display_name":"View","issn_l":"2688-268X","issn":["2688-268X","2688-3988"],"is_oa":false,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Conference Proceedings"},{"id":"pmh:oai:unibz.it:11234955230001241","is_oa":false,"landing_page_url":"https://bia.unibz.it/esploro/outputs/conferenceProceeding/An-Interval-Join-Optimized-for-Modern/991005772421001241","pdf_url":null,"source":{"id":"https://openalex.org/S4210197018","display_name":"View","issn_l":"2688-268X","issn":["2688-268X","2688-3988"],"is_oa":false,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Conference Proceedings"}],"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/W136079928","https://openalex.org/W1538270387","https://openalex.org/W1592371320","https://openalex.org/W1754716214","https://openalex.org/W1977408073","https://openalex.org/W1983721754","https://openalex.org/W1987238352","https://openalex.org/W1988991358","https://openalex.org/W1992730709","https://openalex.org/W1996466054","https://openalex.org/W2032311942","https://openalex.org/W2076072170","https://openalex.org/W2083150957","https://openalex.org/W2086214355","https://openalex.org/W2092954093","https://openalex.org/W2102023823","https://openalex.org/W2102729946","https://openalex.org/W2105904337","https://openalex.org/W2111406286","https://openalex.org/W2115986770","https://openalex.org/W2122048769","https://openalex.org/W2141651907","https://openalex.org/W2142759652","https://openalex.org/W2144402047","https://openalex.org/W2406955896","https://openalex.org/W2407906562","https://openalex.org/W2911302472","https://openalex.org/W3041834803","https://openalex.org/W4240483889","https://openalex.org/W4248948635","https://openalex.org/W4253975767","https://openalex.org/W6605629383","https://openalex.org/W6635576446","https://openalex.org/W6681779468","https://openalex.org/W6713902681","https://openalex.org/W6835740022"],"related_works":["https://openalex.org/W4205996836","https://openalex.org/W3214148052","https://openalex.org/W2151692181","https://openalex.org/W2093960938","https://openalex.org/W2807741550","https://openalex.org/W794462722","https://openalex.org/W2029625042","https://openalex.org/W4248476017","https://openalex.org/W2964879389","https://openalex.org/W2970426051"],"abstract_inverted_index":{"We":[0],"develop":[1],"an":[2,52,67],"algorithm":[3,59],"for":[4,15],"efficiently":[5],"joining":[6],"relations":[7],"on":[8],"interval-based":[9],"attributes":[10],"with":[11,55],"overlap":[12],"predicates,":[13],"which,":[14],"example,":[16],"are":[17,34],"commonly":[18],"found":[19],"in":[20],"temporal":[21],"databases.":[22],"Using":[23],"a":[24,29],"new":[25],"data":[26],"structure":[27],"and":[28],"lazy":[30],"evaluation":[31,54],"technique,":[32],"we":[33],"able":[35,61],"to":[36,62],"achieve":[37],"impressive":[38],"performance":[39],"gains":[40],"by":[41,66],"optimizing":[42],"memory":[43],"accesses":[44],"exploiting":[45],"features":[46],"of":[47,69],"modern":[48],"CPU":[49],"architectures.":[50],"In":[51],"experimental":[53],"real-world":[56],"datasets":[57],"our":[58],"is":[60],"outperform":[63],"the":[64],"state-of-the-art":[65],"order":[68],"magnitude.":[70]},"counts_by_year":[{"year":2026,"cited_by_count":4},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":11},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}