{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T14:12:02Z","timestamp":1760710322674,"version":"3.37.3"},"reference-count":33,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/access.2020.3015654","type":"journal-article","created":{"date-parts":[[2020,8,10]],"date-time":"2020-08-10T21:30:18Z","timestamp":1597095018000},"page":"147560-147568","source":"Crossref","is-referenced-by-count":1,"title":["On Quasi Cycles in Hypergraph Databases"],"prefix":"10.1109","volume":"8","author":[{"given":"Fayed F. M.","family":"Ghaleb","sequence":"first","affiliation":[{"name":"Department of Mathematics, Faculty of Science, Ain Shams University, Cairo, Egypt"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0929-8504","authenticated-orcid":false,"given":"Azza A.","family":"Taha","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Faculty of Science, Ain Shams University, Cairo, Egypt"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maryam","family":"Hazman","sequence":"additional","affiliation":[{"name":"Central Laboratory for Agricultural Experts Systems (CLAES), Agricultural Research Center, Giza, Egypt"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mahmoud M. Abd","family":"Ellatif","sequence":"additional","affiliation":[{"name":"College of Business, University of Jeddah, Jeddah, Saudi Arabia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mona","family":"Abbass","sequence":"additional","affiliation":[{"name":"Central Laboratory for Agricultural Experts Systems (CLAES), Agricultural Research Center, Giza, Egypt"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1137\/130911731"},{"key":"ref32","first-page":"1","article-title":"From hypertree width to submodular width and data-dependent structural decompositions","author":"scarcello","year":"2018","journal-title":"Proceedings of SEBD"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1137\/16M1090272"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/2636918"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(86)90012-5"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/800076.802489"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1999.1626"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(99)00220-0"},{"article-title":"Database and query analysis tools for MySQL: Exploiting hypertree and hypergraph decompositions","year":"2006","author":"chokkalingam","key":"ref14"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74915-8_18"},{"key":"ref16","first-page":"1","article-title":"Covers of query results","author":"ahmet","year":"2018","journal-title":"Proc Int Conf Database Theory (ICDT)"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/3294052.3319698"},{"article-title":"On the universal relation","year":"1979","author":"graham","key":"ref18"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/CMPSAC.1979.762509"},{"key":"ref28","article-title":"Tractable optimization problems through hypergraph-based structural restrictions","author":"georg","year":"2009","journal-title":"Automata Languages and Programming"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2402.322390"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/1084805.1084827"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2011.08.024"},{"key":"ref6","article-title":"Algorithms for acyclic database schemes","volume":"7","author":"yannakakis","year":"1981","journal-title":"Proc 5th Int Conf Very Large Data Bases"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539701396807"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3294052.3319679"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2012.05.005"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(84)90030-6"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/362384.362685"},{"journal-title":"Constraint Processing","year":"2003","author":"dechter","key":"ref9"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/2402.322389"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/2983573"},{"key":"ref22","first-page":"41","article-title":"RDF-BF-hypergraph representation for relational database","volume":"15","author":"ghaleb","year":"2020","journal-title":"International Journal of Computing Science and Mathematics"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2009.06.035"},{"key":"ref24","article-title":"General and fractional hypertree decompositions: Hard and easy cases","author":"fischl","year":"2016","journal-title":"arXiv 1611 01090"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/45072.45073"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2001.1809"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-9385-0_4"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/09163352.pdf?arnumber=9163352","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,8]],"date-time":"2022-09-08T19:44:46Z","timestamp":1662666286000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9163352\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":33,"URL":"https:\/\/doi.org\/10.1109\/access.2020.3015654","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2020]]}}}