{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,3]],"date-time":"2025-10-03T13:04:25Z","timestamp":1759496665782,"version":"3.28.0"},"reference-count":37,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,4]]},"DOI":"10.1109\/icde.2011.5767832","type":"proceedings-article","created":{"date-parts":[[2011,5,17]],"date-time":"2011-05-17T20:45:21Z","timestamp":1305665121000},"page":"1007-1018","source":"Crossref","is-referenced-by-count":33,"title":["Decomposing DAGs into spanning trees: A new way to compress transitive closures"],"prefix":"10.1109","author":[{"given":"Yangjun","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yibin","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","first-page":"197","article-title":"Evaluation of Recursive Queries Using Join Indices","author":"valduriez","year":"0","journal-title":"Proc Workshop Databases and Expert Systems"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/1039488.1039493"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/69.506711"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230070103"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/360715.360746"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/504282.504290"},{"key":"ref35","article-title":"Dual Labeling: Answering Graph Reachability Queries in Constant time","author":"wang","year":"0","journal-title":"Proc of Int Conf on Data Engineering"},{"key":"ref34","first-page":"101","article-title":"Implementation Techniques of Complex Objects","author":"valduriez","year":"0","journal-title":"Proc 12th VLDB Conf"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/1141277.1141385"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/967900.968121"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2003.1198392"},{"key":"ref13","first-page":"5","article-title":"Graph Decomposition and Recursive Closures","author":"chen","year":"0","journal-title":"Proc CAiSE Forum at 15th Conf Advanced Information Systems Engineering"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1098-111X(199703)12:3<203::AID-INT3>3.0.CO;2-T"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1098-111X(199610)11:10<807::AID-INT7>3.3.CO;2-W"},{"journal-title":"Graph Theory","year":"2005","author":"diestel","key":"ref16"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1137\/0213024"},{"key":"ref18","first-page":"207","article-title":"On Extending the Functions of a Relational Database System","author":"haskin","year":"0","journal-title":"Proc ACM SIGMOD Conf"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/99935.99944"},{"key":"ref28","first-page":"53","volume":"16","author":"schubert","year":"1983","journal-title":"Determing type part colour and time relationship"},{"key":"ref4","first-page":"26","article-title":"Fast computation of reachability labeling for large graphs","author":"cheng","year":"0","journal-title":"Proc EDBT"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/6314.6315"},{"key":"ref3","first-page":"88","article-title":"The LCA Problem Revisited","author":"bender","year":"0","journal-title":"Proceedings of LATIN'2000"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702403098"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1137\/0201010"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/115372.115297"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497498"},{"key":"ref7","first-page":"662","article-title":"An Incremental Join Attachment for Starburst","author":"carey","year":"0","journal-title":"Proc 16th VLDB Conf"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/0205011"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1557626.1557665"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/67544.66950"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376677"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/69.729731"},{"key":"ref21","volume":"1","author":"knuth","year":"1969","journal-title":"The art of computer programming"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(71)90006-8"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/69.687974"},{"key":"ref26","article-title":"Efficient creation and incrementation maintenance of HOPI index for complex xml document collection","author":"schenkel","year":"0","journal-title":"Proc ICDE"},{"key":"ref25","article-title":"HOPI: an efficient connection index for complex XML document collections","author":"schenkel","year":"0","journal-title":"Proc EDBT"}],"event":{"name":"2011 IEEE International Conference on Data Engineering (ICDE 2011)","start":{"date-parts":[[2011,4,11]]},"location":"Hannover, Germany","end":{"date-parts":[[2011,4,16]]}},"container-title":["2011 IEEE 27th International Conference on Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5765035\/5767827\/05767832.pdf?arnumber=5767832","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,21]],"date-time":"2017-03-21T05:50:08Z","timestamp":1490075408000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5767832\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,4]]},"references-count":37,"URL":"https:\/\/doi.org\/10.1109\/icde.2011.5767832","relation":{},"subject":[],"published":{"date-parts":[[2011,4]]}}}