Optimal Join Algorithms Meet Top- k
have been studied intensively in the database community and they are an important means to reduce query cost when only the "best" or "most interesting" results are needed instead of the full output. While some optimality results exist, e.g., the famous Threshold Algorithm, they h...
Gespeichert in:
| Veröffentlicht in: | Proceedings - ACM-SIGMOD International Conference on Management of Data Jg. 2020; S. 2659 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
United States
01.06.2020
|
| ISSN: | 0730-8078 |
| Online-Zugang: | Weitere Angaben |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | have been studied intensively in the database community and they are an important means to reduce query cost when only the "best" or "most interesting" results are needed instead of the full output. While some optimality results exist, e.g., the famous Threshold Algorithm, they hold only in a fairly limited model of computation that does not account for the cost incurred by large intermediate results and hence is not aligned with typical database-optimizer cost models. On the other hand, the idea of avoiding large intermediate results is arguably the main goal of recent work on
, which uses the standard RAM model of computation to determine algorithm complexity. This research has created a lot of excitement due to its promise of reducing the time complexity of join queries with cycles, but it has mostly focused on full-output computation. We argue that the two areas can and should be studied from a unified point of view in order to achieve optimality in the common model of computation for a very general class of top-
-style join queries. This tutorial has two main objectives. First, we will explore and contrast the main assumptions, concepts, and algorithmic achievements of the two research areas. Second, we will cover recent, as well as some older, approaches that emerged at the intersection to support efficient
. These are related to classic work on
-shortest path algorithms and more general optimization problems, some of which dates back to the 1950s. We demonstrate that this line of research warrants renewed attention in the challenging context of ranked enumeration for general join queries. |
|---|---|
| AbstractList | have been studied intensively in the database community and they are an important means to reduce query cost when only the "best" or "most interesting" results are needed instead of the full output. While some optimality results exist, e.g., the famous Threshold Algorithm, they hold only in a fairly limited model of computation that does not account for the cost incurred by large intermediate results and hence is not aligned with typical database-optimizer cost models. On the other hand, the idea of avoiding large intermediate results is arguably the main goal of recent work on
, which uses the standard RAM model of computation to determine algorithm complexity. This research has created a lot of excitement due to its promise of reducing the time complexity of join queries with cycles, but it has mostly focused on full-output computation. We argue that the two areas can and should be studied from a unified point of view in order to achieve optimality in the common model of computation for a very general class of top-
-style join queries. This tutorial has two main objectives. First, we will explore and contrast the main assumptions, concepts, and algorithmic achievements of the two research areas. Second, we will cover recent, as well as some older, approaches that emerged at the intersection to support efficient
. These are related to classic work on
-shortest path algorithms and more general optimization problems, some of which dates back to the 1950s. We demonstrate that this line of research warrants renewed attention in the challenging context of ranked enumeration for general join queries. Top-k queries have been studied intensively in the database community and they are an important means to reduce query cost when only the "best" or "most interesting" results are needed instead of the full output. While some optimality results exist, e.g., the famous Threshold Algorithm, they hold only in a fairly limited model of computation that does not account for the cost incurred by large intermediate results and hence is not aligned with typical database-optimizer cost models. On the other hand, the idea of avoiding large intermediate results is arguably the main goal of recent work on optimal join algorithms, which uses the standard RAM model of computation to determine algorithm complexity. This research has created a lot of excitement due to its promise of reducing the time complexity of join queries with cycles, but it has mostly focused on full-output computation. We argue that the two areas can and should be studied from a unified point of view in order to achieve optimality in the common model of computation for a very general class of top-k-style join queries. This tutorial has two main objectives. First, we will explore and contrast the main assumptions, concepts, and algorithmic achievements of the two research areas. Second, we will cover recent, as well as some older, approaches that emerged at the intersection to support efficient ranked enumeration of join-query results. These are related to classic work on k-shortest path algorithms and more general optimization problems, some of which dates back to the 1950s. We demonstrate that this line of research warrants renewed attention in the challenging context of ranked enumeration for general join queries.Top-k queries have been studied intensively in the database community and they are an important means to reduce query cost when only the "best" or "most interesting" results are needed instead of the full output. While some optimality results exist, e.g., the famous Threshold Algorithm, they hold only in a fairly limited model of computation that does not account for the cost incurred by large intermediate results and hence is not aligned with typical database-optimizer cost models. On the other hand, the idea of avoiding large intermediate results is arguably the main goal of recent work on optimal join algorithms, which uses the standard RAM model of computation to determine algorithm complexity. This research has created a lot of excitement due to its promise of reducing the time complexity of join queries with cycles, but it has mostly focused on full-output computation. We argue that the two areas can and should be studied from a unified point of view in order to achieve optimality in the common model of computation for a very general class of top-k-style join queries. This tutorial has two main objectives. First, we will explore and contrast the main assumptions, concepts, and algorithmic achievements of the two research areas. Second, we will cover recent, as well as some older, approaches that emerged at the intersection to support efficient ranked enumeration of join-query results. These are related to classic work on k-shortest path algorithms and more general optimization problems, some of which dates back to the 1950s. We demonstrate that this line of research warrants renewed attention in the challenging context of ranked enumeration for general join queries. |
| Author | Riedewald, Mirek Tziavelis, Nikolaos Gatterbauer, Wolfgang |
| Author_xml | – sequence: 1 givenname: Nikolaos orcidid: 0000-0001-8342-2177 surname: Tziavelis fullname: Tziavelis, Nikolaos organization: Northeastern University, Boston, Massachusetts, USA – sequence: 2 givenname: Wolfgang orcidid: 0000-0002-9614-0504 surname: Gatterbauer fullname: Gatterbauer, Wolfgang organization: Northeastern University, Boston, Massachusetts, USA – sequence: 3 givenname: Mirek orcidid: 0000-0002-6102-7472 surname: Riedewald fullname: Riedewald, Mirek organization: Northeastern University, Boston, Massachusetts, USA |
| BackLink | https://www.ncbi.nlm.nih.gov/pubmed/33568888$$D View this record in MEDLINE/PubMed |
| BookMark | eNo1jztPwzAUhT20og-Y2VAkli4pvr5-dawqnirqUuboxnEhkMQhTgb-PZEoZznLp3P0LdikCY1n7Br4GkCqO0SwUss1okVAMWFzbpCnlhs7Y4sYPzkXRiFcsBmi0nbMnN0e2r6sqUpeQtkk2-o9dGX_Ucfk1fs-OYY2Tb4u2fREVfRX516yt4f74-4p3R8en3fbfUpoNn1qTQHF-OAUKFUYbkDxQglhSUtD7qQ3YBzmkjQI57gnYzkhEuXEUXsQS7b622278D342Gd1GZ2vKmp8GGImpLVKSYFiRG_O6JDXvsjabpTofrJ_MfELje5MNA |
| ContentType | Journal Article |
| DBID | NPM 7X8 |
| DOI | 10.1145/3318464.3383132 |
| DatabaseName | PubMed MEDLINE - Academic |
| DatabaseTitle | PubMed MEDLINE - Academic |
| DatabaseTitleList | PubMed MEDLINE - Academic |
| Database_xml | – sequence: 1 dbid: NPM name: PubMed url: http://www.ncbi.nlm.nih.gov/entrez/query.fcgi?db=PubMed sourceTypes: Index Database – sequence: 2 dbid: 7X8 name: MEDLINE - Academic url: https://search.proquest.com/medline sourceTypes: Aggregation Database |
| DeliveryMethod | no_fulltext_linktorsrc |
| Discipline | Computer Science |
| ExternalDocumentID | 33568888 |
| Genre | Journal Article |
| GrantInformation_xml | – fundername: NINDS NIH HHS grantid: R01 NS091421 |
| GroupedDBID | 123 29O NPM 7X8 |
| ID | FETCH-LOGICAL-a379t-87d1d275c5155d707150d5228a647acf6917c3b4a612cc0ea780a33aaba036e12 |
| IEDL.DBID | 7X8 |
| ISICitedReferencesCount | 14 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000644433700178&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0730-8078 |
| IngestDate | Fri Jul 11 15:19:56 EDT 2025 Thu Jan 02 22:40:34 EST 2025 |
| IsDoiOpenAccess | false |
| IsOpenAccess | true |
| IsPeerReviewed | false |
| IsScholarly | true |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-a379t-87d1d275c5155d707150d5228a647acf6917c3b4a612cc0ea780a33aaba036e12 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 23 |
| ORCID | 0000-0002-6102-7472 0000-0002-9614-0504 0000-0001-8342-2177 |
| OpenAccessLink | https://dl.acm.org/doi/pdf/10.1145/3318464.3383132 |
| PMID | 33568888 |
| PQID | 2488554232 |
| PQPubID | 23479 |
| ParticipantIDs | proquest_miscellaneous_2488554232 pubmed_primary_33568888 |
| PublicationCentury | 2000 |
| PublicationDate | 20200601 |
| PublicationDateYYYYMMDD | 2020-06-01 |
| PublicationDate_xml | – month: 6 year: 2020 text: 20200601 day: 1 |
| PublicationDecade | 2020 |
| PublicationPlace | United States |
| PublicationPlace_xml | – name: United States |
| PublicationTitle | Proceedings - ACM-SIGMOD International Conference on Management of Data |
| PublicationTitleAlternate | Proc ACM SIGMOD Int Conf Manag Data |
| PublicationYear | 2020 |
| SSID | ssj0027531 |
| Score | 2.4339292 |
| Snippet | have been studied intensively in the database community and they are an important means to reduce query cost when only the "best" or "most interesting" results... Top-k queries have been studied intensively in the database community and they are an important means to reduce query cost when only the "best" or "most... |
| SourceID | proquest pubmed |
| SourceType | Aggregation Database Index Database |
| StartPage | 2659 |
| Title | Optimal Join Algorithms Meet Top- k |
| URI | https://www.ncbi.nlm.nih.gov/pubmed/33568888 https://www.proquest.com/docview/2488554232 |
| Volume | 2020 |
| WOSCitedRecordID | wos000644433700178&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1NT4NAEJ2o9eDF-m39Chqva4FdWDiZxtgYk9YeatIb2S-00QIK-vudBZqeTEy8cAICw9uZ92bJPIBrpZDFax0TbbghLDYxkZ7wCbXtfFcKxWhjNsHH42g2iydtw61sf6tc5sQ6Uetc2R5530ekYelDAnBbfBDrGmV3V1sLjXXoUKQyFtV8Fq0EV9D4ESKK7dDdqB3t47GgTxHLLGQ3VqF51nvkN35Z15lh979PuAPbLcN0Bg0kdmHNZHvQXbo3OO1i3oerJ8wWCzzzMZ9nzuD9Be9VvS5KZ2RM5UzzgrwdwPPwfnr3QFrHBCIojytMbdrT-NrKGrdojvQhcDUyrEiEjAuVhijOFJVMIK9RyjWCR66gVAgpsJIZzz-EjSzPzDE40nBfxjJligVMplwyO7tPiVRoVBlx0IPLZRQSRKTdZhCZyb_KZBWHHhw1oUyKZnRGQmkQouaOTv5w9Sls-Vbc1i2PM-ikuB7NOWyq72pefl7UnxqP48noBwxCsJI |
| linkProvider | ProQuest |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Optimal+Join+Algorithms+Meet+Top-+k&rft.jtitle=Proceedings+-+ACM-SIGMOD+International+Conference+on+Management+of+Data&rft.au=Tziavelis%2C+Nikolaos&rft.au=Gatterbauer%2C+Wolfgang&rft.au=Riedewald%2C+Mirek&rft.date=2020-06-01&rft.issn=0730-8078&rft.volume=2020&rft.spage=2659&rft_id=info:doi/10.1145%2F3318464.3383132&rft_id=info%3Apmid%2F33568888&rft_id=info%3Apmid%2F33568888&rft.externalDocID=33568888 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0730-8078&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0730-8078&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0730-8078&client=summon |