{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,5,29]],"date-time":"2023-05-29T09:11:14Z","timestamp":1685351474551},"reference-count":0,"publisher":"National Library of Serbia","issue":"1","license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["ComSIS","COMPUT SCI INF SYST","COMPUT SCI INFORM SY","COMPUTER SCI INFORM","COMSIS J"],"published-print":{"date-parts":[[2012]]},"abstract":"<jats:p>The importance of XML query optimization is growing due to the rising number\n   of XML-intensive data mining tasks. Earlier work on algebras for XML query\n   focused mostly on rule-based optimization and used node-at-a-time execution\n   model. Heavy query workloads in modern applications require cost-based\n   optimization which is naturally supported by the set-at-a-time execution\n   model. This paper introduces an algebra with only set-at-a-time operations,\n   and discusses expression reduction methods and lazy evaluation techniques\n   based on the algebra. Our experiments demonstrate that, for queries with\n   complex conditional and quantified expressions, the proposed algebra results\n   in plans with much better performance than those produced by the\n   state-of-the-art algebras. For relatively simple queries, the proposed\n   methods are expected to yield plans with comparable performance.<\/jats:p>","DOI":"10.2298\/csis100804037l","type":"journal-article","created":{"date-parts":[[2011,10,5]],"date-time":"2011-10-05T07:45:47Z","timestamp":1317800747000},"page":"63-80","source":"Crossref","is-referenced-by-count":2,"title":["An XML-algebra for efficient set-at-a-time execution"],"prefix":"10.2298","volume":"9","author":[{"given":"Maxim","family":"Lukichev","sequence":"first","affiliation":[{"name":"Saint-Petersburg University Saint-Petersburg, Russia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Boris","family":"Novikov","sequence":"additional","affiliation":[{"name":"Saint-Petersburg University Saint-Petersburg, Russia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pankaj","family":"Mehra","sequence":"additional","affiliation":[{"name":"Whodini,Inc. CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1078","container-title":["Computer Science and Information Systems"],"original-title":[],"language":"en","deposited":{"date-parts":[[2023,5,29]],"date-time":"2023-05-29T08:30:19Z","timestamp":1685349019000},"score":1,"resource":{"primary":{"URL":"https:\/\/doiserbia.nb.rs\/Article.aspx?ID=1820-02141100037L"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"references-count":0,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012]]}},"URL":"https:\/\/doi.org\/10.2298\/csis100804037l","relation":{},"ISSN":["1820-0214","2406-1018"],"issn-type":[{"value":"1820-0214","type":"print"},{"value":"2406-1018","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}