The strong partial transitive-closure problem: algorithms and performance evaluation
The development of efficient algorithms to process the different forms of transitive-closure (TC) queries within the context of large database systems has recently attracted a large volume of research efforts. In this paper, we present two new algorithms suitable for processing one of these forms, t...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on knowledge and data engineering Jg. 8; H. 4; S. 617 - 629 |
|---|---|
| Hauptverfasser: | , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
New York, NY
IEEE
01.08.1996
IEEE Computer Society |
| Schlagworte: | |
| ISSN: | 1041-4347 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | The development of efficient algorithms to process the different forms of transitive-closure (TC) queries within the context of large database systems has recently attracted a large volume of research efforts. In this paper, we present two new algorithms suitable for processing one of these forms, the so called strong partially instantiated transitive closure, in which one of the query's arguments is instantiated to a set of constants and the processing of which yields a set of tuples that draw their values from both of the query's instantiated and uninstantiated arguments. These algorithms avoids the redundant computations and high storage cost found in a number of similar algorithms. Using simulation, this paper compares the performance of the new algorithms with those found in literature and shows clearly the superiority of the new algorithms. |
|---|---|
| AbstractList | The development of efficient algorithms to process the different forms of transitive-closure (TC) queries within the context of large database systems has recently attracted a large volume of research efforts. In this paper, we present two new algorithms suitable for processing one of these forms, the so called strong partially instantiated transitive closure, in which one of the query's arguments is instantiated to a set of constants and the processing of which yields a set of tuples that draw their values from both of the query's instantiated and uninstantiated arguments. These algorithms avoids the redundant computations and high storage cost found in a number of similar algorithms. Using simulation, this paper compares the performance of the new algorithms with those found in literature and shows clearly the superiority of the new algorithms. The development of efficient algorithms to process the different forms of transitive-closure (TC) queries within the context of large database systems has recently attracted a large volume of research efforts. In this paper, we present two new algorithms suitable for processing one of these forms, the so called strong partially instantiated transitive closure, in which one of the query's arguments is instantiated to a set of constants and the processing of which yields a set of tuples that draw their values from both of the query's instantiated and uninstantiated arguments. These algorithms avoids the redundant computations and high storage cost found in a number of similar algorithms. Using simulation, this paper compares the performance of the new algorithms with those found in literature and shows clearly the superiority of the new algorithms |
| Author | Qadah, G.Z. Toroslu, I.H. |
| Author_xml | – sequence: 1 givenname: I.H. surname: Toroslu fullname: Toroslu, I.H. organization: Dept. of Comput. Eng., Middle East Tech. Univ., Ankara, Turkey – sequence: 2 givenname: G.Z. surname: Qadah fullname: Qadah, G.Z. |
| BackLink | http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=3231592$$DView record in Pascal Francis |
| BookMark | eNqF0bFOIzEQBmAXIF2AK66l2gIhUSx4bK9j0yHEHSch0eTq1awzG4y862A7kXh7FhJRoJOopphvRqP5j9jBGEdi7BfwSwBur7S9bKQWjTpgM-AKaiXV_Ac7yvmZc27mBmZssXiiKpcUx1W1xlQ8hqokHLMvfku1CzFvElXrFLtAw3WFYRWTL09DrnBcVmtKfUwDjo4q2mLYYPFxPGGHPYZMP_f1mP37fbe4va8fHv_8vb15qJ3istRGadKNItHNbc9Ba9DYo-1tw6ETpncKnDVCaJCdMWgVdFoZvZRCIO_kUh6z893e6byXDeXSDj47CgFHipvcCjuXFhr4HprpDg7ye6hlAxz4BM_2ELPD0E8vcz636-QHTK-tFBIaKyZ2sWMuxZwT9Z8CePseUqttuwtpsldfrPPl459TID78d-J0N-GJ6HPzvvkGz7ie9g |
| CODEN | ITKEEH |
| CitedBy_id | crossref_primary_10_1016_j_csi_2016_07_002 |
| Cites_doi | 10.1016/0169-023X(92)90005-V 10.1109/ICDE.1990.113477 10.1145/16856.16859 10.1145/137097.137914 10.1145/88636.88888 10.1145/155271.155273 10.1145/6314.6315 10.1145/6012.15399 10.1137/0220006 10.1145/99935.99944 10.1109/32.75418 10.1145/93597.93620 10.1145/602259.602261 10.1109/ICDE.1993.344027 10.1109/32.9054 10.1145/191843.191928 10.1007/BF00872109 10.1109/TAI.1992.246414 10.1137/0201010 10.1109/ICDE.1992.213213 |
| ContentType | Journal Article |
| Copyright | 1996 INIST-CNRS |
| Copyright_xml | – notice: 1996 INIST-CNRS |
| DBID | AAYXX CITATION IQODW 7SC 8FD JQ2 L7M L~C L~D 7TB FR3 |
| DOI | 10.1109/69.536254 |
| DatabaseName | CrossRef Pascal-Francis Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional Mechanical & Transportation Engineering Abstracts Engineering Research Database |
| DatabaseTitle | CrossRef Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional Mechanical & Transportation Engineering Abstracts Engineering Research Database |
| DatabaseTitleList | Computer and Information Systems Abstracts Computer and Information Systems Abstracts Technology Research Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science Applied Sciences |
| EndPage | 629 |
| ExternalDocumentID | 3231592 10_1109_69_536254 536254 |
| GroupedDBID | -~X .DC 0R~ 1OL 29I 4.4 5GY 5VS 6IK 97E 9M8 AAJGR AARMG AASAJ AAWTH ABAZT ABFSI ABQJQ ABVLG ACGFO ACIWK AENEX AETIX AGQYO AGSQL AHBIQ AI. AIBXA AKJIK AKQYR ALLEH ALMA_UNASSIGNED_HOLDINGS ASUFR ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 DU5 E.L EBS EJD F5P HZ~ H~9 ICLAB IEDLZ IFIPE IFJZH IPLJI JAVBF LAI M43 MS~ O9- OCL P2P PQQKQ RIA RIE RNI RNS RXW RZB TAE TAF TN5 UHB VH1 AAYXX CITATION IQODW RIG 7SC 8FD JQ2 L7M L~C L~D 7TB FR3 |
| ID | FETCH-LOGICAL-c403t-846e654e2b79f016616afa9f9501b28fc41c9822613b88a941b6486d322a0b3d3 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 1 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=10_1109_69_536254&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1041-4347 |
| IngestDate | Sun Sep 28 01:41:59 EDT 2025 Sun Sep 28 14:24:51 EDT 2025 Sat Sep 27 18:42:30 EDT 2025 Mon Jul 21 09:13:46 EDT 2025 Sat Nov 29 04:46:24 EST 2025 Tue Nov 18 21:49:37 EST 2025 Wed Aug 27 02:52:17 EDT 2025 |
| IsDoiOpenAccess | false |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 4 |
| Keywords | Performance evaluation Transitive closure Tree(graph) Deductive database Database query Database Recursive method Data processing Fast algorithm Search algorithm |
| Language | English |
| License | https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html CC BY 4.0 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c403t-846e654e2b79f016616afa9f9501b28fc41c9822613b88a941b6486d322a0b3d3 |
| Notes | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
| OpenAccessLink | https://hdl.handle.net/11511/38847 |
| PQID | 26351010 |
| PQPubID | 23500 |
| PageCount | 13 |
| ParticipantIDs | proquest_miscellaneous_29739151 pascalfrancis_primary_3231592 proquest_miscellaneous_26351010 ieee_primary_536254 proquest_miscellaneous_28654013 crossref_primary_10_1109_69_536254 crossref_citationtrail_10_1109_69_536254 |
| PublicationCentury | 1900 |
| PublicationDate | 1996-08-01 |
| PublicationDateYYYYMMDD | 1996-08-01 |
| PublicationDate_xml | – month: 08 year: 1996 text: 1996-08-01 day: 01 |
| PublicationDecade | 1990 |
| PublicationPlace | New York, NY |
| PublicationPlace_xml | – name: New York, NY |
| PublicationTitle | IEEE transactions on knowledge and data engineering |
| PublicationTitleAbbrev | TKDE |
| PublicationYear | 1996 |
| Publisher | IEEE IEEE Computer Society |
| Publisher_xml | – name: IEEE – name: IEEE Computer Society |
| References | valduriez (bibk061726) 1986 bibk061712 bibk061714 dar (bibk06176) 1994 bibk061710 ioannidis (bibk06179) 1988 han (bibk06178) 1988 agrawal (bibk06172) 1990 bibk061723 bibk061722 bibk061725 bibk061724 jakobsson (bibk061713) 1991 bibk061721 bibk061720 bibk06171 bibk061719 bibk06173 bibk061716 bibk061715 bibk061718 bibk061717 ioannidis (bibk061711) 1986 bibk06174 bibk06175 bibk06177 |
| References_xml | – start-page: 403 year: 1986 ident: bibk061711 article-title: on the computation of the transitive closure of relational operators publication-title: Proc 12th Int l Conf VLDB – ident: bibk061717 doi: 10.1016/0169-023X(92)90005-V – ident: bibk061715 doi: 10.1109/ICDE.1990.113477 – ident: bibk06174 doi: 10.1145/16856.16859 – ident: bibk061714 doi: 10.1145/137097.137914 – ident: bibk06171 doi: 10.1145/88636.88888 – start-page: 48 year: 1988 ident: bibk06178 article-title: the processing of the transitive closure queries publication-title: Proc 1988 Int l Conf Extending Database Technology – ident: bibk061710 doi: 10.1145/155271.155273 – ident: bibk061719 doi: 10.1145/6314.6315 – ident: bibk06173 doi: 10.1145/6012.15399 – ident: bibk061725 doi: 10.1137/0220006 – ident: bibk061712 doi: 10.1145/99935.99944 – ident: bibk061716 doi: 10.1109/32.75418 – start-page: 326 year: 1990 ident: bibk06172 article-title: hybrid transitive closure algorithms publication-title: Proc 16th Int l Conf VLDB – ident: bibk061724 doi: 10.1145/93597.93620 – ident: bibk06177 doi: 10.1145/602259.602261 – ident: bibk061722 doi: 10.1109/ICDE.1993.344027 – ident: bibk061718 doi: 10.1109/32.9054 – start-page: 454 year: 1994 ident: bibk06176 article-title: a performance study of transitive closure algorithms publication-title: Proc 13th ACM-SIGMOD Int l Conf Management Data doi: 10.1145/191843.191928 – ident: bibk061723 doi: 10.1007/BF00872109 – start-page: 197 year: 1986 ident: bibk061726 article-title: evaluation of recursive queries using join indices publication-title: Proc First Int l Expert Database Syst Conf – ident: bibk061721 doi: 10.1109/TAI.1992.246414 – ident: bibk061720 doi: 10.1137/0201010 – ident: bibk06175 doi: 10.1109/ICDE.1992.213213 – start-page: 328 year: 1988 ident: bibk06179 article-title: efficient transitive closure algorithms publication-title: Proc 14th Int l Conf VLDB – start-page: 199 year: 1991 ident: bibk061713 article-title: mixed approach algorithms for transitive closure publication-title: Proc 10th ACM Symp Principles of Database Syst |
| SSID | ssj0008781 |
| Score | 1.5109954 |
| SecondaryResourceType | review_article |
| Snippet | The development of efficient algorithms to process the different forms of transitive-closure (TC) queries within the context of large database systems has... |
| SourceID | proquest pascalfrancis crossref ieee |
| SourceType | Aggregation Database Index Database Enrichment Source Publisher |
| StartPage | 617 |
| SubjectTerms | Applied sciences Computational modeling Computer science; control theory; systems Context modeling Costs Database systems Deductive databases Exact sciences and technology Information systems. Data bases Logic Memory organisation. Data processing Software Tree graphs |
| Title | The strong partial transitive-closure problem: algorithms and performance evaluation |
| URI | https://ieeexplore.ieee.org/document/536254 https://www.proquest.com/docview/26351010 https://www.proquest.com/docview/28654013 https://www.proquest.com/docview/29739151 |
| Volume | 8 |
| WOSCitedRecordID | wos10_1109_69_536254&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVIEE databaseName: IEEE Xplore issn: 1041-4347 databaseCode: RIE dateStart: 19890101 customDbUrl: isFulltext: true dateEnd: 99991231 titleUrlDefault: https://ieeexplore.ieee.org/ omitProxy: false ssIdentifier: ssj0008781 providerName: IEEE |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LS8NAEB60eNCDj6pYn4t48JKaNNmXNxHFk3io4C3sJrtVqElpUn-_s5u0WhTBW0gmIczsvHZnvgG4yLWwkWYUNc3wILGWB4prVDxBmYytpVLnftgEf3wULy_yqcXZ9r0wxhhffGb67tKf5edlNnNbZVcUrS1NVmGVc960ai2MruB-HikmF5gSxQlvQYSiUF4x2W9eXHI9fpaKq4RUFTLDNlMsfhhk72Xut_71f9uw2QaT5KaR_g6smKILW_NBDaTV2y5sfEMd3IUhLg1SuS3wEZm4lYOfqJ3L8mVEQTYu3a4haUfNXBM1HpXTt_r1vSKqyMnkq9WAfGGF78Hz_d3w9iFohysEWRLGdYBxh2E0MQPNpcW4j0VMWSWtpGGkB8JmSZQ5bD9091oIJROUaCJYjgZAhTrO433oFGVhDoDIUCiVc6qZ62gQKH4qjcU8TFvKeB714HLO9zRrkcfdAIxx6jOQUKZMpg3venC-IJ00cBu_EXUd7xcE87snS7JcPI4xhKVy0IOzuWxTVCF3LqIKU86q1OHxoGUK_6AQyCoMlv-gkNxB7UeHv_7bEaw31d6ucPAYOvV0Zk5gLfuo36rpqV_Jnxpm878 |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LT9tAEB4BRYIeCoSipuWxQhy4GOx4n71VVREIiHoIEjdr194NSKkdxU5_f2fXTigCIXGz7LFlzXt2Z78BOCmMdInhDC3Niog6JyItDBqeZFylzjFlijBsQgyH8v5e_e5wtsNZGGttaD6zZ_4y7OUXVT73S2XnDL0to6vwgVE6SNrDWku3K0WYSIrlBRZFKRUdjFASq3OuztpXnwWfME3F90LqGtnh2jkWL1xyiDMXW-_6w2341KWT5Ecr_x1YsWUPthajGkhnuT34-B_u4C6MUDlI7RfBx2TqdQc_0figFRqJonxS-XVD0g2b-U70ZFzNHpuHPzXRZUGmT4cNyBNa-Ge4u_g1-nkZdeMVopzGaRNh5mE5o3ZghHKY-fGEa6eVUyxOzEC6nCa5R_fDgG-k1IqiTKnkBboAHZu0SPdgraxK-wWIiqXWhWCG-zMNEhWAKeuwEjOOcVEkfThd8D3LO-xxPwJjkoUaJFYZV1nLuz4cL0mnLeDGa0Q9z_slweLuwTNZLh-nmMQyNejD0UK2GRqR3xnRpa3mdeYRedA3xW9QSGQVpstvUCjhwfaTr6_-2xFsXI5ub7Kbq-H1N9hse799G-E-rDWzuT2A9fxv81jPDoNW_wPk8PcG |
| 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=The+strong+partial+transitive-closure+problem%3A+algorithms+and+performance+evaluation&rft.jtitle=IEEE+transactions+on+knowledge+and+data+engineering&rft.au=Toroslu%2C+I.H.&rft.au=Qadah%2C+G.Z.&rft.date=1996-08-01&rft.issn=1041-4347&rft.volume=8&rft.issue=4&rft.spage=617&rft.epage=629&rft_id=info:doi/10.1109%2F69.536254&rft.externalDBID=n%2Fa&rft.externalDocID=10_1109_69_536254 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1041-4347&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1041-4347&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1041-4347&client=summon |