Query evaluation on probabilistic RDF databases

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5802 LNCS, Issue , 2009, Pages 307-320

  Huang, Hai ^a   Liu, Chengfei ^a  

^a SWINBURNE UNIVERSITY OF TECHNOLOGY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATE ALGORITHMS; PATH EXPRESSIONS; PROBABILISTIC DATABASE; QUERY EVALUATION; RDF DATA; RDF DATABASE; TRANSITIVE RELATION;

DATABASE SYSTEMS; INFORMATION SYSTEMS; KNOWLEDGE REPRESENTATION; SYSTEMS ENGINEERING; WORLD WIDE WEB;

COMPUTATION THEORY;

EID: 71549119204     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-04409-0_32     Document Type: Conference Paper

References (17)

1. Raedt, L.D., Kimmig, A., Toivonen, H.: ProbLog: A Probabilistic Prolog and Its Application in Link Discovery. In: IJCAI 2007, pp. 2462-2467 (2007)
2. Fuhr, N., Rölleke, T.: A Probabilistic Relational Algebra for the Integration of Information Retrieval and Database Systems. ACM Trans. Inf. Syst. 15(1), 32-66 (1997)
3. Grädel, E., Gurevich, Y., Hirsch, C.: The Complexity of Query Reliability. In: PODS 1998, pp. 227-234 (1998)
4. Dalvi, N.N., Suciu, D.: Efficient query evaluation on probabilistic databases. VLDB J. 16(4), 523-544 (2007)
5. Abiteboul, S., Senellart, P.: Querying and updating probabilistic information in XML. In: Ioannidis, Y., Scholl, M.H., Schmidt, J.W., Matthes, F., Hatzopoulos, M., Böhm, K., Kemper, A., Grust, T., Böhm, C. (eds.) EDBT 2006. LNCS, vol. 3896, pp. 1059-1068. Springer, Heidelberg (2006)
6. Hung, E., Getoor, L., Subrahmanian, V.S.: PXML: A Probabilistic Semistructured Data Model and Algebra. In: ICDE 2003 (2003)
7. Karp, R.M., Luby, M.: Monte-Carlo Algorithms for Enumeration and Reliability Problems. In: FOCS 1983, pp. 56-64 (1983)
8. Bryant, R.E.: Graph-Based Algorithms for Boolean Function Manipulation. IEEE Trans. Computers 35(8), 677-691 (1986)
9. Aït-Kaci, H., Boyer, R.S., Lincoln, P., Nasr, R.: Efficient Implementation of Lattice Operations. ACM Trans. Program. Lang. Syst. 11(1), 115-146 (1989)
10. Caseau, Y.: Efficient Handling of Multiple Inheritance Hierarchies. In: OOPSLA 1993, pp. 271-287 (1993)
11. Agrawal, R., Borgida, A., Jagadish, H.V.: Efficient Management of Transitive Relationships in Large Data and Knowledge Bases. In: SIGMOD Conference 1989, pp. 253-262 (1989)
12. Guo, Y., Pan, Z., Heflin, J.: An evaluation of knowledge base systems for large OWL datasets. In: McIlraith, S.A., Plexousakis, D., van Harmelen, F. (eds.) ISWC 2004. LNCS, vol. 3298, pp. 274-288. Springer, Heidelberg (2004)
13. Fukushige, Y.: Representing Probabilistic Relations in RDF. In: ISWC-URSW 2005, pp. 106-107 (2005)
14. Koller, D., Levy, A.Y., Pfeffer, A.: P-CLASSIC: A Tractable Probablistic Description Logic. In: AAAI/IAAI 1997, pp. 390-397 (1997)
15. Giugno, R., Lukasiewicz, T.: P-SHOQ(D): A Probabilistic Extension of SHOQ(D) for Probabilistic Ontologies in the Semantic Web. In: Flesca, S., Greco, S., Leone, N., Ianni, G. (eds.) JELIA 2002. LNCS (LNAI), vol. 2424, pp. 86-97. Springer, Heidelberg (2002)
16. da Costa, P.C.G., Laskey, K.B., Laskey, K.J., Pool, M.: International Semantic Web Conference, ISWC-URSW 2005, pp. 23-33 (2005)
17. Udrea, O., Subrahmanian, V.S., Majkic, Z.: Probabilistic RDF. In: IRI 2006, pp. 172-177 (2006)