{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:59:09Z","timestamp":1725562749919},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642153488"},{"type":"electronic","value":"9783642153495"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15349-5_13","type":"book-chapter","created":{"date-parts":[[2010,8,21]],"date-time":"2010-08-21T03:39:27Z","timestamp":1282361967000},"page":"183-197","source":"Crossref","is-referenced-by-count":3,"title":["Efficient Graph Reachability Query Answering Using Tree Decomposition"],"prefix":"10.1007","author":[{"given":"Fang","family":"Wei","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Borgida, A., Jagadish, H.V.: Efficient management of transitive relationships in large data and knowledge bases. In: SIGMOD (1989)","DOI":"10.1145\/67544.66950"},{"issue":"2","key":"13_CR2","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1137\/0608024","volume":"8","author":"S. Arnborg","year":"1987","unstructured":"Arnborg, S., Corneil, D.G., Proskurowski, A.: Complexity of finding embeddings in a k-tree. SIAM J. Algebraic Discrete Methods\u00a08(2), 277\u2013284 (1987)","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Bodlaender, H.L.: A linear time algorithm for finding tree-decompositions of small treewidth. In: STOC (1993)","DOI":"10.1145\/167088.167161"},{"key":"13_CR4","first-page":"1","volume":"11","author":"H.L. Bodlaender","year":"1993","unstructured":"Bodlaender, H.L.: A tourist guide through treewidth. Acta Cybernetica\u00a011, 1\u201323 (1993)","journal-title":"Acta Cybernetica"},{"issue":"3","key":"13_CR5","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1111\/j.1467-8640.2005.00274.x","volume":"21","author":"H.L. Bodlaender","year":"2005","unstructured":"Bodlaender, H.L., Koster, A.M.C.A., van den Eijkhof, F.: Pre-processing rules for triangulation of probabilistic networks. Computational Intelligence\u00a021(3), 286\u2013305 (2005)","journal-title":"Computational Intelligence"},{"issue":"5","key":"13_CR6","doi-asserted-by":"publisher","first-page":"1338","DOI":"10.1137\/S0097539702403098","volume":"32","author":"E. Cohen","year":"2003","unstructured":"Cohen, E., Halperin, E., Kaplan, H., Zwick, U.: Reachability and distance queries via 2-hop labels. SIAM J. Comput.\u00a032(5), 1338\u20131355 (2003)","journal-title":"SIAM J. Comput."},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Gottlob, G., Pichler, R., Wei, F.: Tractable database design through bounded treewidth. In: PODS, pp. 124\u2013133 (2006)","DOI":"10.1145\/1142351.1142370"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Jin, R., Xiang, Y., Ruan, N., Fuhry, D.: 3-hop: a high-compression indexing scheme for reachability query. In: SIGMOD (2009)","DOI":"10.1145\/1559845.1559930"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Jin, R., Xiang, Y., Ruan, N., Wang, H.: Efficiently answering reachability queries on very large directed graphs. In: SIGMOD (2008)","DOI":"10.1145\/1376616.1376677"},{"issue":"1-2","key":"13_CR10","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/j.artint.2005.04.004","volume":"166","author":"K. Kask","year":"2005","unstructured":"Kask, K., Dechter, R., Larrosa, J., Dechter, A.: Unifying tree decompositions for reasoning in graphical models. Artif. Intell.\u00a0166(1-2), 165\u2013193 (2005)","journal-title":"Artif. Intell."},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Koster, A.M.C.A., Bodlaender, H.L., Hoesel, S.P.M.V.: Treewidth: Computational experiments. Electronic Notes in Discrete Mathematics (2001)","DOI":"10.1016\/S1571-0653(05)80078-2"},{"key":"13_CR12","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0095-8956(84)90013-3","volume":"36","author":"P.D. Robertson","year":"1984","unstructured":"Robertson, P.D., Seymour, N.: Graph minors iii: Planar tree-width. Journal of Combinatorial Theory, Series B\u00a036, 49\u201364 (1984)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"13_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/978-3-540-24741-8_15","volume-title":"Advances in Database Technology - EDBT 2004","author":"R. Schenkel","year":"2004","unstructured":"Schenkel, R., Theobald, A., Weikum, G.: Hopi: An efficient connection index for complex xml document collections. In: Bertino, E., Christodoulakis, S., Plexousakis, D., Christophides, V., Koubarakis, M., B\u00f6hm, K., Ferrari, E. (eds.) EDBT 2004. LNCS, vol.\u00a02992, pp. 237\u2013255. Springer, Heidelberg (2004)"},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Schenkel, R., Theobald, A., Weikum, G.: Efficient creation and incremental maintenance of the hopi index for complex xml document collections. In: ICDE, pp. 360\u2013371 (2005)","DOI":"10.1109\/ICDE.2005.57"},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"Trissl, S., Leser, U.: Fast and practical indexing and querying of very large graphs. In: SIGMOD (2007)","DOI":"10.1145\/1247480.1247573"},{"key":"13_CR16","unstructured":"Wang, H., He2, H., Yang, J., Yu, P.S., Yu, J.X.: Dual labeling: Answering graph reachability queries in constant time. In: ICDE (2006)"},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"Wei, F.: Tedi: Efficient shortest path query answering on graphs. In: SIGMOD (2010)","DOI":"10.1145\/1807167.1807181"},{"key":"13_CR18","doi-asserted-by":"crossref","unstructured":"Zhang, C., Naughton, J.F., DeWitt, D.J., Luo, Q., Lohman, G.M.: On supporting containment queries in relational database management systems. In: SIGMOD Conference (2001)","DOI":"10.1145\/375663.375722"}],"container-title":["Lecture Notes in Computer Science","Reachability Problems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15349-5_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:04:54Z","timestamp":1606187094000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15349-5_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642153488","9783642153495"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15349-5_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}