{"id":"https://openalex.org/W2160011226","doi":"https://doi.org/10.1145/1514894.1514909","title":"Faster join-projects and sparse matrix multiplications","display_name":"Faster join-projects and sparse matrix multiplications","publication_year":2009,"publication_date":"2009-03-23","ids":{"openalex":"https://openalex.org/W2160011226","doi":"https://doi.org/10.1145/1514894.1514909","mag":"2160011226"},"language":"en","primary_location":{"id":"doi:10.1145/1514894.1514909","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1514894.1514909","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 12th International Conference on Database Theory","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/A5020332829","display_name":"Rasmus Resen Amossen","orcid":null},"institutions":[{"id":"https://openalex.org/I83467386","display_name":"IT University of Copenhagen","ror":"https://ror.org/02309jg23","country_code":"DK","type":"education","lineage":["https://openalex.org/I83467386"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"Rasmus Resen Amossen","raw_affiliation_strings":["IT University of Copenhagen, Copenhagen, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IT University of Copenhagen, Copenhagen, Denmark","institution_ids":["https://openalex.org/I83467386"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014293815","display_name":"Rasmus Pagh","orcid":"https://orcid.org/0000-0002-1516-9306"},"institutions":[{"id":"https://openalex.org/I83467386","display_name":"IT University of Copenhagen","ror":"https://ror.org/02309jg23","country_code":"DK","type":"education","lineage":["https://openalex.org/I83467386"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Rasmus Pagh","raw_affiliation_strings":["IT University of Copenhagen, Copenhagen, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IT University of Copenhagen, Copenhagen, Denmark","institution_ids":["https://openalex.org/I83467386"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5020332829"],"corresponding_institution_ids":["https://openalex.org/I83467386"],"apc_list":null,"apc_paid":null,"fwci":4.557,"has_fulltext":false,"cited_by_count":87,"citation_normalized_percentile":{"value":0.95278198,"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":"121","last_page":"126"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.9990000128746033,"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9965999722480774,"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/join","display_name":"Join (topology)","score":0.9213279485702515},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7258217334747314},{"id":"https://openalex.org/keywords/multiplication","display_name":"Multiplication (music)","score":0.7052981853485107},{"id":"https://openalex.org/keywords/matrix-multiplication","display_name":"Matrix multiplication","score":0.6032342314720154},{"id":"https://openalex.org/keywords/sparse-matrix","display_name":"Sparse matrix","score":0.5826600790023804},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.5573926568031311},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5572531223297119},{"id":"https://openalex.org/keywords/projection","display_name":"Projection (relational algebra)","score":0.5080432891845703},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.49269989132881165},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4761490821838379},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.44805359840393066},{"id":"https://openalex.org/keywords/multiplication-algorithm","display_name":"Multiplication algorithm","score":0.4379885196685791},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4185423254966736},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21183159947395325},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.13741761445999146},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.10908538103103638}],"concepts":[{"id":"https://openalex.org/C2776124973","wikidata":"https://www.wikidata.org/wiki/Q3183033","display_name":"Join (topology)","level":2,"score":0.9213279485702515},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7258217334747314},{"id":"https://openalex.org/C2780595030","wikidata":"https://www.wikidata.org/wiki/Q3860309","display_name":"Multiplication (music)","level":2,"score":0.7052981853485107},{"id":"https://openalex.org/C17349429","wikidata":"https://www.wikidata.org/wiki/Q1049914","display_name":"Matrix multiplication","level":3,"score":0.6032342314720154},{"id":"https://openalex.org/C56372850","wikidata":"https://www.wikidata.org/wiki/Q1050404","display_name":"Sparse matrix","level":3,"score":0.5826600790023804},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.5573926568031311},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5572531223297119},{"id":"https://openalex.org/C57493831","wikidata":"https://www.wikidata.org/wiki/Q3134666","display_name":"Projection (relational algebra)","level":2,"score":0.5080432891845703},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.49269989132881165},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4761490821838379},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44805359840393066},{"id":"https://openalex.org/C201290732","wikidata":"https://www.wikidata.org/wiki/Q130762","display_name":"Multiplication algorithm","level":3,"score":0.4379885196685791},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4185423254966736},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21183159947395325},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.13741761445999146},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.10908538103103638},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C163716315","wikidata":"https://www.wikidata.org/wiki/Q901177","display_name":"Gaussian","level":2,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/1514894.1514909","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1514894.1514909","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 12th International Conference on Database Theory","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.atira.dk:publications/2c83ac10-e410-11de-a523-000ea68e967b","is_oa":false,"landing_page_url":"https://pure.itu.dk/portal/da/publications/2c83ac10-e410-11de-a523-000ea68e967b","pdf_url":null,"source":{"id":"https://openalex.org/S4377196680","display_name":"IT University Of Copenhagen (IT University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I83467386","host_organization_name":"IT University of Copenhagen","host_organization_lineage":["https://openalex.org/I83467386"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Amossen, R R & Pagh, R 2009, Faster join-projects and sparse matrix multiplications. in Proceedings of the 12th International Conference on Database Theory 2009. vol. 12, Association for Computing Machinery, pp. 121-126.","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.148.6460","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.148.6460","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.itu.dk/people/pagh/papers/joinproject.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.231.5961","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.231.5961","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://rasmus.resen.org/pub/faster_jp_and_mm.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W52840101","https://openalex.org/W2001518781","https://openalex.org/W2033961328","https://openalex.org/W2038142281","https://openalex.org/W2043670592","https://openalex.org/W2049012226","https://openalex.org/W2080063509","https://openalex.org/W2089311600","https://openalex.org/W2126624503"],"related_works":["https://openalex.org/W2225983048","https://openalex.org/W2372139915","https://openalex.org/W2596457687","https://openalex.org/W4287593139","https://openalex.org/W3099313426","https://openalex.org/W752783541","https://openalex.org/W1516189266","https://openalex.org/W2093666864","https://openalex.org/W4378602953","https://openalex.org/W2256267046"],"abstract_inverted_index":{"Computing":[0],"an":[1],"equi-join":[2],"followed":[3],"by":[4,12,49],"a":[5,50,58,64],"duplicate":[6],"eliminating":[7],"projection":[8],"is":[9,23,78,89,102],"conventionally":[10],"done":[11],"performing":[13],"the":[14,26,35,38,41,83,96],"two":[15],"operations":[16],"in":[17,76,81],"serial.":[18],"If":[19],"some":[20],"join":[21,97],"attribute":[22],"projected":[24,100],"away":[25,101],"intermediate":[27,60,70],"result":[28],"may":[29],"be":[30,46,113],"much":[31],"larger":[32],"than":[33],"both":[34,82],"input":[36],"and":[37,40,75,85],"output,":[39],"computation":[42],"could":[43],"therefore":[44,111],"potentially":[45],"performed":[47],"faster":[48],"direct":[51],"procedure":[52],"that":[53,67,93],"does":[54],"not":[55],"produce":[56],"such":[57],"large":[59],"result.":[61],"We":[62],"present":[63],"new":[65],"algorithm":[66],"has":[68],"smaller":[69],"results":[71,109],"on":[72],"worst-case":[73],"inputs,":[74],"particular":[77],"more":[79],"efficient":[80],"RAM":[84],"I/O":[86],"model.":[87],"It":[88],"easy":[90],"to":[91,104],"see":[92],"join-project":[94],"where":[95],"attributes":[98],"are":[99],"equivalent":[103],"boolean":[105],"matrix":[106,119],"multiplication.":[107,120],"Our":[108],"can":[110],"also":[112],"interpreted":[114],"as":[115],"improved":[116],"sparse,":[117],"output-sensitive":[118]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":8},{"year":2022,"cited_by_count":5},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":8},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":8}],"updated_date":"2026-05-15T08:27:34.491423","created_date":"2025-10-10T00:00:00"}