Modeling and querying probabilistic XML data

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Modeling and querying probabilistic XML data

Full text

Pdf (497 KB)

Source

ACM SIGMOD Record archive
Volume 37 , Issue 4 (December 2008) table of contents

COLUMN: Database principles table of contents

Pages 69-77

Year of Publication: 2009

ISSN:0163-5808

Authors

Benny Kimelfeld	IBM Almaden Research Center
Yehoshua Sagiv	The Hebrew University of Jerusalem

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 5, Downloads (12 Months): 66, Citation Count: 1

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/1519103.1519115 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	S. Abiteboul, B. Kimelfeld, Y. Sagiv, and P. Senellart. On the expressiveness of probabilistic XML models. Submitted for a journal publication, 2008.
	2	S. Abiteboul and P. Senellart. Querying and updating probabilistic information in XML. In EDBT, pages 1059--1068, 2006.
	3	Sihem Amer-Yahia , SungRan Cho , Laks V. S. Lakshmanan , Divesh Srivastava, Minimization of tree pattern queries, Proceedings of the 2001 ACM SIGMOD international conference on Management of data, p.497-508, May 21-24, 2001, Santa Barbara, California, United States
	4	Omar Benjelloun , Anish Das Sarma , Alon Halevy , Martin Theobald , Jennifer Widom, Databases with uncertainty and lineage, The VLDB Journal — The International Journal on Very Large Data Bases, v.17 n.2, p.243-264, March 2008 [doi>10.1007/s00778-007-0080-z]
	5	Nicolas Bruno , Nick Koudas , Divesh Srivastava, Holistic twig joins: optimal XML pattern matching, Proceedings of the 2002 ACM SIGMOD international conference on Management of data, June 03-06, 2002, Madison, Wisconsin [doi>10.1145/564691.564727]
	6	Sara Cohen , Itzhak Fadida , Yaron Kanza , Benny Kimelfeld , Yehoshua Sagiv, Full disjunctions: polynomial-delay iterators in action, Proceedings of the 32nd international conference on Very large data bases, September 12-15, 2006, Seoul, Korea
	7	Sara Cohen , Benny Kimelfeld , Yehoshua Sagiv, Incorporating constraints in probabilistic XML, Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, June 09-12, 2008, Vancouver, Canada [doi>10.1145/1376916.1376933]
	8	Paul Dagum , Michael Luby, Approximating probabilistic inference in Bayesian belief networks is NP-hard, Artificial Intelligence, v.60 n.1, p.141-153, March 1993 [doi>10.1016/0004-3702(93)90036-B]
	9	Nilesh Dalvi , Dan Suciu, The dichotomy of conjunctive queries on probabilistic structures, Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, June 11-13, 2007, Beijing, China [doi>10.1145/1265530.1265571]
	10	Nilesh Dalvi , Dan Suciu, Efficient query evaluation on probabilistic databases, The VLDB Journal — The International Journal on Very Large Data Bases, v.16 n.4, p.523-544, October 2007 [doi>10.1007/s00778-006-0004-3]
	11	R. G. Downey and M. R. Fellows. Parameterized Complexity. Monographs in Computer Science. Springer, 1999.
	12	César A. Galindo-Legaria, Outerjoins as disjunctions, Proceedings of the 1994 ACM SIGMOD international conference on Management of data, p.348-358, May 24-27, 1994, Minneapolis, Minnesota, United States
	13	Edward Hung , Lise Getoor , V. S. Subrahmanian, Probabilistic Interval XML, Proceedings of the 9th International Conference on Database Theory, p.361-377, January 08-10, 2003
	14	E. Hung, L. Getoor, and V. S. Subrahmanian. PXML: A probabilistic semistructured data model and algebra. In ICDE, pages 467--478, 2003.
	15	M R Jerrum , L G Valiant , V V Vazirani, Random generation of combinatorial structures from a uniform, Theoretical Computer Science, v.43 n.2-3, p.169-188, July 1986
	16	David S. Johnson , Christos H. Papadimitriou, On generating all maximal independent sets, Information Processing Letters, v.27 n.3, p.119-123, March 25, 1988 [doi>10.1016/0020-0190(88)90065-8]
	17	R. M. Kapp , M. Luby , N. Madras, Monte-Carlo approximation algorithms for enumeration problems, Journal of Algorithms, v.10 n.3, p.429-448, September 1989 [doi>10.1016/0196-6774(89)90038-2]
	18	Benny Kimelfeld , Yuri Kosharovsky , Yehoshua Sagiv, Query efficiency in probabilistic XML models, Proceedings of the 2008 ACM SIGMOD international conference on Management of data, June 09-12, 2008, Vancouver, Canada [doi>10.1145/1376616.1376687]
	19	Benny Kimelfeld , Yehoshua Sagiv, Matching twigs in probabilistic XML, Proceedings of the 33rd international conference on Very large data bases, September 23-27, 2007, Vienna, Austria
	20	Benny Kimelfeld , Yehoshua Sagiv, Maximally joining probabilistic data, Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, June 11-13, 2007, Beijing, China [doi>10.1145/1265530.1265572]
	21	Andrew Nierman , H. V. Jagadish, ProTDB: probabilistic data in XML, Proceedings of the 28th international conference on Very Large Data Bases, p.646-657, August 20-23, 2002, Hong Kong, China
	22	Christos H. Papadimitriou , Mihalis Yannakakis, On the complexity of database queries, Journal of Computer and System Sciences, v.58 n.3, p.407-427, June 1999 [doi>10.1006/jcss.1999.1626]
	23	C. Ré and D.Suciu. Efficient evaluation of HAVING queries on a probabilistic database. In DBPL, volume 4797 of Lecture Notes in Computer Science, pages 186--200. Springer, 2007.
	24	Pierre Senellart , Serge Abiteboul, On the complexity of managing probabilistic XML data, Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, June 11-13, 2007, Beijing, China [doi>10.1145/1265530.1265570]
	25	Seinosuke Toda , Mitsunori Ogiwara, Counting classes are at least as hard as the polynomial-time hierarchy, SIAM Journal on Computing, v.21 n.2, p.316-328, April 1992 [doi>10.1137/0221023]
	26	L. G. Valiant. The complexity of computing the permanent. Theoretical Computer Science, 8:189--201, 1979.
	27	Maurice van Keulen , Ander de Keijzer , Wouter Alink, A Probabilistic XML Approach to Data Integration, Proceedings of the 21st International Conference on Data Engineering, p.459-470, April 05-08, 2005 [doi>10.1109/ICDE.2005.11]
	28	Stathis Zachos, Probabilistic quantifiers and games, Journal of Computer and System Sciences, v.36 n.3, p.433-451, June 1988 [doi>10.1016/0022-0000(88)90037-2]