{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T16:56:53Z","timestamp":1774285013022,"version":"3.50.1"},"reference-count":17,"publisher":"World Scientific Pub Co Pte Ltd","issue":"03","funder":[{"DOI":"10.13039\/501100004895","name":"European Social Fund","doi-asserted-by":"crossref","award":["EFOP-3.6.3-VEKOP-16-2017-00001"],"award-info":[{"award-number":["EFOP-3.6.3-VEKOP-16-2017-00001"]}],"id":[{"id":"10.13039\/501100004895","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100004895","name":"European Social Fund","doi-asserted-by":"crossref","award":["EFOP-3.6.3-VEKOP-16-2017-00002"],"award-info":[{"award-number":["EFOP-3.6.3-VEKOP-16-2017-00002"]}],"id":[{"id":"10.13039\/501100004895","id-type":"DOI","asserted-by":"crossref"}]},{"name":"National Research, Development and Innovation Fund of Hungary","award":["TKP2020-NKA-06"],"award-info":[{"award-number":["TKP2020-NKA-06"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Vietnam J. Comp. Sci."],"published-print":{"date-parts":[[2021,8]]},"abstract":"<jats:p> Data structures and especially the relationship among the data entities have changed in the last couple of years. The network-like graph representations of data-model are becoming more and more common nowadays, since they are more suitable to depict these, than the well-established relational data-model. The graphs can describe large and complex networks \u2014 like social networks \u2014 but also capable of storing rich information about complex data. This was mostly of relational data-model trait before. This also can be achieved with the use of the knowledge representation tool called \u201chypergraphs\u201d. To utilize the possibilities of this model, we need a practical way to store and process hypergraphs. In this paper, we propose a way by which we can store hypergraphs model in the SAP HANA in-memory database system which has a \u201cGraph Core\u201d engine besides the relational data model. Graph Core has many graph algorithms by default however it is not capable to store or to work with hypergraphs neither are any of these algorithms specifically tailored for hypergraphs either. Hence in this paper, besides the case study of the two information systems, we also propose pseudo-code level algorithms to accommodate hypergraph semantics to process our IS model. <\/jats:p>","DOI":"10.1142\/s2196888821500160","type":"journal-article","created":{"date-parts":[[2020,12,5]],"date-time":"2020-12-05T15:54:57Z","timestamp":1607183697000},"page":"375-395","source":"Crossref","is-referenced-by-count":2,"title":["Storing Hypergraph-Based Data Models in Non-Hypergraph Data Storage and Applications for Information Systems"],"prefix":"10.1142","volume":"08","author":[{"given":"B\u00e1lint","family":"Moln\u00e1r","sequence":"first","affiliation":[{"name":"Information Systems Department, E\u00f6tv\u00f6s Lor\u00e1nd University (ELTE), P\u00e1zm\u00e1ny P\u00e9ter s\u00e9t\u00e1ny 1\/C, Budapest, 1117, Hungary"}]},{"given":"Andr\u00e1s","family":"B\u00e9leczki","sequence":"additional","affiliation":[{"name":"Information Systems Department, E\u00f6tv\u00f6s Lor\u00e1nd University (ELTE), P\u00e1zm\u00e1ny P\u00e9ter s\u00e9t\u00e1ny 1\/C, Budapest, 1117, Hungary"}]},{"given":"Bence","family":"Sarkadi-Nagy","sequence":"additional","affiliation":[{"name":"Information Systems Department, E\u00f6tv\u00f6s Lor\u00e1nd University (ELTE), P\u00e1zm\u00e1ny P\u00e9ter s\u00e9t\u00e1ny 1\/C, Budapest, 1117, Hungary"}]}],"member":"219","published-online":{"date-parts":[[2021,1,7]]},"reference":[{"key":"S2196888821500160BIB001","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49381-6_28"},{"key":"S2196888821500160BIB002","first-page":"261","volume":"42","author":"Moln\u00e1r B.","year":"2014","journal-title":"Ann. Univ. Sci. Budapest. Sect. Comput."},{"key":"S2196888821500160BIB003","doi-asserted-by":"publisher","DOI":"10.1109\/SKIMA.2011.6089978"},{"key":"S2196888821500160BIB004","doi-asserted-by":"publisher","DOI":"10.4018\/ijwp.2013100105"},{"key":"S2196888821500160BIB005","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-00080-0"},{"key":"S2196888821500160BIB006","doi-asserted-by":"publisher","DOI":"10.1147\/sj.263.0276"},{"key":"S2196888821500160BIB007","volume-title":"Planning and Design of Information Systems","author":"Blokdijk A.","year":"1987"},{"key":"S2196888821500160BIB009","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45446-2_20"},{"key":"S2196888821500160BIB010","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(93)90045-P"},{"key":"S2196888821500160BIB011","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16720-1_3"},{"key":"S2196888821500160BIB012","first-page":"69","author":"Moln\u00e1r B.","year":"2016","journal-title":"Int. J. Inf. Syst. Proj. Manag."},{"key":"S2196888821500160BIB013","doi-asserted-by":"publisher","DOI":"10.1007\/s40595-015-0046-9"},{"key":"S2196888821500160BIB014","volume-title":"Introduction to Graph and Hypergraph Theory","author":"Voloshin V. I.","year":"2009"},{"key":"S2196888821500160BIB015","volume-title":"Service-Oriented Modeling (SOA): Service Analysis, Design, and Architecture","author":"Bell M.","year":"2008"},{"key":"S2196888821500160BIB017","first-page":"403","volume-title":"Datenbanksysteme f\u00fcr Business, Technologie und Web (BTW) 2037","author":"Rudolf M.","year":"2013"},{"key":"S2196888821500160BIB018","doi-asserted-by":"publisher","DOI":"10.1145\/588058.588089"},{"key":"S2196888821500160BIB019","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-444-88074-1.50013-5"}],"container-title":["Vietnam Journal of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S2196888821500160","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,2]],"date-time":"2021-09-02T09:10:04Z","timestamp":1630573804000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S2196888821500160"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,7]]},"references-count":17,"journal-issue":{"issue":"03","published-print":{"date-parts":[[2021,8]]}},"alternative-id":["10.1142\/S2196888821500160"],"URL":"https:\/\/doi.org\/10.1142\/s2196888821500160","relation":{},"ISSN":["2196-8888","2196-8896"],"issn-type":[{"value":"2196-8888","type":"print"},{"value":"2196-8896","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1,7]]}}}