On the complexity of managing probabilistic XML data

Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Volumn , Issue , 2007, Pages 283-292

  Senellart, Pierre ^a   Abiteboul, Serge ^a  

^a INRIA   (France)

Author keywords

Complexity; Probabilistic databases; Semi structured databases; XML

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS; TREES (MATHEMATICS); XML;

PROBABILISTIC DATABASES; SEMI STRUCTURED DATABASES;

DATA PROCESSING;

EID: 35449004928     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1265530.1265570     Document Type: Conference Paper

References (20)

1. S. Abiteboul, P. Kanellakis, and G. Grahne. On the representation and querying of sets of possible worlds. Theoretical Computer Science, 78(1):158-187, 1991.
2. S. Abiteboul and P. Senellart. Querying and updating probabilistic information in XML. Technical Report 435, GEMO, Inria Futurs, Orsay, France, Dec. 2005.
3. S. Abiteboul and P. Senellart. Querying and updating probabilistic information in XML. In Extending DataBase Technology, Munich, Germany, Mar. 2006.
4. A. V. Aho, J. E. Hopcroft, and J. D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, USA, 1974.
5. D. Barbará, H. Garcia-Molina, and D. Porter. The management of probabilistic data. IEEE Transactions on Knowledge and Data Engineering, 4(5):487-502, 1992.
6. R. Cavallo and M. Pittarelli. The theory of probabilistic databases. In Very Large Data Bases, 1987.
7. N. N. Dalvi and D. Suciu. Efficient query evaluation on probabilistic databases. In Very Large Data Bases, Hong Kong, China, Sept. 2004.
8. M. de Rougemont. The reliability of queries. In Principles Of Database Systems, San Jose, United States, 1995.
9. A. Dekhtyar, J. Goldsmith, and S. R. Hawkes. Semistructured probabilistic databases. In Statistical and Scientific Database Management, Tokyo, Japan, July 2001.
10. N. Fuhr and T. Rölleke. A probabilistic relational algebra for the integration of information retrieval and database systems. ACM Trans. Inf. Syst., 15(1), 1997.
11. E. Hung, L. Getoor, and V. S. Subrahmanian. PXML: A probabilistic semistructured data model and algebra. In International Conference on Data Engineering, Bangalore, India, Mar. 2003.
12. T. Imieliński and W. Lipski. Incomplete information in relational databases. J. ACM, 31(4):761-791, 1984.
13. D. E. Knuth. The Art of Computer Programming, volume 1. Addison-Wesley, Boston, USA, third edition, 1997.
14. A. Nierman and H. V. Jagadish. ProTDB: Probabilistic data in XML. In Very Large Data Bases, Hong Kong, China, Aug. 2002.
15. R. Otter. The number of trees. Annals of Mathematics, 49(3):583-599, July 1948.
16. C. H. Papadimitriou. Computational Complexity. Addison Wesley Pub. Co., Reading, USA, 1994.
17. J. T. Schwartz. Fast probabilistic algorithms for verification of polynomial identities. Journal of the ACM, 27(4):701-717, 1980.
18. M. van Keulen, A. de Keijzer, and W. Alink. A probabilistic XML approach to data integration. In International Conference on Data Engineering, Apr. 2005.
19. J. Widom. Trio: A system for integrated management of data, accuracy, and lineage. In Biennal Conference on Innovative Data Systems Research, Pacific Grove, USA, Jan. 2005.
20. R. Zippel. Probabilistic algorithms for sparse polynomials. In International Symposium on Symbolic and Algebraic Computation, Marseille, France, 1979.