{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T10:16:39Z","timestamp":1740132999863,"version":"3.37.3"},"reference-count":37,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2021,4,1]],"date-time":"2021-04-01T00:00:00Z","timestamp":1617235200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,4,1]],"date-time":"2021-04-01T00:00:00Z","timestamp":1617235200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,4,1]],"date-time":"2021-04-01T00:00:00Z","timestamp":1617235200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Sustainable Development of Centre ENET","award":["CZ.1.05\/2.1.00\/19.0389","LO1404 TUCENET"],"award-info":[{"award-number":["CZ.1.05\/2.1.00\/19.0389","LO1404 TUCENET"]}]},{"name":"Students Grant Competition","award":["SP2019\/20","SP2019\/28"],"award-info":[{"award-number":["SP2019\/20","SP2019\/28"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2021,4,1]]},"DOI":"10.1109\/tkde.2019.2946157","type":"journal-article","created":{"date-parts":[[2019,10,8]],"date-time":"2019-10-08T20:06:27Z","timestamp":1570565187000},"page":"1439-1452","source":"Crossref","is-referenced-by-count":1,"title":["Demythization of Structural XML Query Processing: Comparison of Holistic and Binary Approaches"],"prefix":"10.1109","volume":"33","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6883-8852","authenticated-orcid":false,"given":"Petr","family":"Lukas","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9353-7373","authenticated-orcid":false,"given":"Radim","family":"Baca","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9183-7265","authenticated-orcid":false,"given":"Michal","family":"Kratky","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0496-0565","authenticated-orcid":false,"given":"Tok Wang","family":"Ling","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03973-7_12"},{"year":"2002","key":"ref32","article-title":"The XML data repository"},{"key":"ref31","first-page":"294","article-title":"XML multi-core query optimization based on task preemption and data partition","author":"tian","year":"2013","journal-title":"Proc Joint Int Semantic Technol Conf"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/564691.564715"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/375663.375722"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/383034.383038"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2003.1260812"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15684-7_11"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/1066157.1066209"},{"key":"ref11","first-page":"237","article-title":"From tree patterns to generalized tree patterns: On efficient evaluation of XQuery","author":"chen","year":"2003","journal-title":"Proc 29th Int Conf Very Large Data Bases"},{"year":"2017","key":"ref12","article-title":"RadegastXDB"},{"key":"ref13","first-page":"197","article-title":"Of nests and trees: A unified approach to processing queries that contain nested subqueries, aggregates, and quantifiers","author":"dayal","year":"1987","journal-title":"Proc 13th Int Conf Very Large Data Bases"},{"key":"ref14","first-page":"554","article-title":"Optimizing sorting and duplicate elimination in XQuery path expressions","author":"fern\u00e1ndez","year":"2005","journal-title":"Proc Int Conf Database Expert Syst Appl"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/1739041.1739064"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/1071610.1071614"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920955"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/1031171.1031272"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.126"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2014.2349907"},{"key":"ref4","article-title":"Structural XML query processing","volume":"50","author":"ba?a","year":"2017","journal-title":"ACM Comput Surveys"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/B978-155860869-6\/50096-2"},{"key":"ref3","first-page":"25","article-title":"On the efficiency of a prefix path holistic algorithm","author":"ba?a","year":"2009","journal-title":"Proc XML Database Symp"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/j.is.2015.03.004","article-title":"Cost-based holistic twig joins","volume":"52","author":"ba?a","year":"2015","journal-title":"Inf Syst"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/IDEAS.2007.4318109"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/s00778-012-0295-5","article-title":"Optimal and efficient generalized twig pattern processing: A combination of preorder and postorder filterings","volume":"22","author":"ba?a","year":"2013","journal-title":"VLDB J"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/564724.564727"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2005.69"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2002.994704"},{"key":"ref9","first-page":"283","article-title":"Twig2stack: Bottom-up processing of generalized-tree-pattern queries over XML documents","author":"chen","year":"2006","journal-title":"Proc 32nd Int Conf Very Large Data Bases"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/584792.584817"},{"key":"ref20","first-page":"193","article-title":"From region encoding to extended dewey: On efficient processing of XML twig pattern matching","author":"lu","year":"2005","journal-title":"Proc Int Conf On Very Large Data Bases"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/1516360.1516400"},{"key":"ref21","article-title":"Cooking lightweight {XML} query processor with binary joins and comparing it with holistic joins: Technical report","volume":"abs 1703 9539","author":"luk\u00e1\u0161","year":"2017","journal-title":"CoRR"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2007.367870"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/11896548_14"},{"key":"ref26","article-title":"XQuery 3.0: An XML query language","author":"robie","year":"2014","journal-title":"W3C Recomm"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007579"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/9371488\/08862877.pdf?arnumber=8862877","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:50:51Z","timestamp":1652194251000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8862877\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,1]]},"references-count":37,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2019.2946157","relation":{},"ISSN":["1041-4347","1558-2191","2326-3865"],"issn-type":[{"type":"print","value":"1041-4347"},{"type":"electronic","value":"1558-2191"},{"type":"electronic","value":"2326-3865"}],"subject":[],"published":{"date-parts":[[2021,4,1]]}}}