{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,18]],"date-time":"2026-09-18T07:30:49Z","timestamp":1789716649106,"version":"4.0.1"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319458557","type":"print"},{"value":"9783319458564","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-45856-4_22","type":"book-chapter","created":{"date-parts":[[2016,8,29]],"date-time":"2016-08-29T15:21:28Z","timestamp":1472484088000},"page":"323-330","source":"Crossref","is-referenced-by-count":1,"title":["Challenges for Efficient Query Evaluation on Structured Probabilistic Data"],"prefix":"10.1007","author":[{"given":"Antoine","family":"Amarilli","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Silviu","family":"Maniu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mika\u00ebl","family":"Monet","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,8,30]]},"reference":[{"key":"22_CR1","unstructured":"Amarilli, A.: Leveraging the structure of uncertain data. Ph.D. thesis, T\u00e9l\u00e9com ParisTech (2016). 2016-ENST-0021"},{"key":"22_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1007\/978-3-662-47666-6_5","volume-title":"Automata, Languages, and Programming","author":"A Amarilli","year":"2015","unstructured":"Amarilli, A., Bourhis, P., Senellart, P.: Provenance circuits for trees and treelike instances. In: Halld\u00f3rsson, M.M., Iwama, K., Kobayashi, N., Speckmann, B. (eds.) ICALP 2015. LNCS, vol. 9135, pp. 56\u201368. Springer, Heidelberg (2015)"},{"key":"22_CR3","doi-asserted-by":"crossref","unstructured":"Amarilli, A., Bourhis, P., Senellart, P.: Tractable lineages on treelike instances: limits and extensions. In: Proceedings of PODS (2016, to appear)","DOI":"10.1145\/2902251.2902301"},{"issue":"3","key":"22_CR4","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1023\/A:1004275029985","volume":"27","author":"H Andr\u00e9ka","year":"1998","unstructured":"Andr\u00e9ka, H., N\u00e9meti, I., van Benthem, J.: Modal languages and bounded fragments of predicate logic. J. Philos. Log. 27(3), 217\u2013274 (1998)","journal-title":"J. Philos. Log."},{"issue":"2","key":"22_CR5","doi-asserted-by":"crossref","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. Algebr. Discret. Methods 8(2), 277\u2013284 (1987)","journal-title":"SIAM J. Algebr. Discret. Methods"},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"Barcel\u00f3 Baeza, P.: Querying graph databases. In: Proceedings of PODS (2013)","DOI":"10.1145\/2463664.2465216"},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"Benedikt, M., Bourhis, P., Vanden Boom, M.: A step up in expressiveness of decidable fixpoint logics. In: Proceedings of LICS (2016, to appear)","DOI":"10.1145\/2933575.2933592"},{"key":"22_CR8","doi-asserted-by":"crossref","unstructured":"Benedikt, M., Ten Cate, B., Colcombet, T., Boom, M.V.: The complexity of boundedness for guarded logics. In: Proceedings of LICS (2015)","DOI":"10.1109\/LICS.2015.36"},{"key":"22_CR9","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1007\/3-540-45653-8_5","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"D Berwanger","year":"2001","unstructured":"Berwanger, D., Gr\u00e4del, E.: Games and model checking for guarded logics. In: Nieuwenhuis, R., Voronkov, A. (eds.) LPAR 2001. LNCS (LNAI), vol. 2250, p. 70. Springer, Heidelberg (2001)"},{"issue":"3","key":"22_CR10","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/j.ic.2009.03.008","volume":"208","author":"HL Bodlaender","year":"2010","unstructured":"Bodlaender, H.L., Koster, A.: Treewidth computations I. Upper bounds. Inf. Comput. 208(3), 259\u2013275 (2010)","journal-title":"Inf. Comput."},{"issue":"7","key":"22_CR11","doi-asserted-by":"crossref","first-page":"1103","DOI":"10.1016\/j.ic.2011.04.003","volume":"209","author":"HL Bodlaender","year":"2011","unstructured":"Bodlaender, H.L., Koster, A.: Treewidth computations II. Lower bounds. Inf. Comput. 209(7), 1103\u20131119 (2011)","journal-title":"Inf. Comput."},{"key":"22_CR12","unstructured":"Comon, H., Dauchet, M., Gilleron, R., L\u00f6ding, C., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata: techniques and applications (2007)"},{"issue":"1","key":"22_CR13","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/0890-5401(90)90043-H","volume":"85","author":"B Courcelle","year":"1990","unstructured":"Courcelle, B.: The monadic second-order logic of graphs. I. Recognizable sets of finite graphs. Inf. Comput. 85(1), 12\u201375 (1990)","journal-title":"Inf. Comput."},{"issue":"4","key":"22_CR14","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1007\/s00778-006-0004-3","volume":"16","author":"N Dalvi","year":"2007","unstructured":"Dalvi, N., Suciu, D.: Efficient query evaluation on probabilistic databases. VLDBJ 16(4), 523\u2013544 (2007)","journal-title":"VLDBJ"},{"issue":"1\u20132","key":"22_CR15","doi-asserted-by":"crossref","first-page":"11","DOI":"10.3166\/jancl.11.11-34","volume":"11","author":"A Darwiche","year":"2001","unstructured":"Darwiche, A.: On the tractable counting of theory models and its application to truth maintenance and belief revision. J. Appl. Non-Class. Log. 11(1\u20132), 11\u201334 (2001)","journal-title":"J. Appl. Non-Class. Log."},{"issue":"1","key":"22_CR16","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1145\/1838552.1838555","volume":"12","author":"G Gottlob","year":"2010","unstructured":"Gottlob, G., Pichler, R., Wei, F.: Monadic datalog over finite structures of bounded treewidth. TOCL 12(1), 3 (2010)","journal-title":"TOCL"},{"issue":"1","key":"22_CR17","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/S0304-3975(98)00308-9","volume":"224","author":"E Gr\u00e4del","year":"1999","unstructured":"Gr\u00e4del, E., Otto, M.: On logics with two variables. TCS 224(1), 73\u2013113 (1999)","journal-title":"TCS"},{"key":"22_CR18","doi-asserted-by":"crossref","unstructured":"Huang, J., Antova, L., Koch, C., Olteanu, D.: MayBMS: a probabilistic database management system. In: Proceedings of SIGMOD (2009)","DOI":"10.1145\/1559845.1559984"},{"key":"22_CR19","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1111\/j.2517-6161.1988.tb01721.x","volume":"50","author":"SL Lauritzen","year":"1988","unstructured":"Lauritzen, S.L., Spiegelhalter, D.J.: Local computations with probabilities on graphical structures and their application to expert systems. JRSS Ser. B 50, 157\u2013224 (1988)","journal-title":"JRSS Ser. B"},{"key":"22_CR20","unstructured":"Maniu, S., Cheng, R., Senellart, P.: ProbTree: a query-efficient representation of probabilistic graphs. In: Proceedings of BUDA (2014)"},{"key":"22_CR21","doi-asserted-by":"crossref","unstructured":"Monet, M.: Probabilistic evaluation of expressive queries on bounded-treewidth instances. In: Proceedings of Ph.D. Symposium of SIGMOD\/PODS. ACM (2016, to appear)","DOI":"10.1145\/2926693.2929905"},{"key":"22_CR22","doi-asserted-by":"crossref","unstructured":"Wei, F.: TEDI: efficient shortest path query answering on graphs. In: Proceedings of SIGMOD (2010)","DOI":"10.1145\/1807167.1807181"},{"key":"22_CR23","unstructured":"Yannakakis, M.: Algorithms for acyclic database schemes. In: Proceedings of VLDB (1981)"}],"container-title":["Lecture Notes in Computer Science","Scalable Uncertainty Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-45856-4_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,19]],"date-time":"2024-06-19T03:21:06Z","timestamp":1718767266000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-45856-4_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319458557","9783319458564"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-45856-4_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}