Skip to main content

Query Evaluation on Probabilistic RDF Databases

  • Conference paper
Web Information Systems Engineering - WISE 2009 (WISE 2009)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 5802))

Included in the following conference series:

Abstract

Over the last few years, RDF has been used as a knowledge representation model in a wide variety of domains. Some domains are full of uncertainty. Thus, it is desired to process and manage probabilistic RDF data. The core operation of queries on an RDF probabilistic database is computing the probability of the result to a query. In this paper, we describe a general framework for supporting SPARQL queries on probabilistic RDF databases. In particular, we consider transitive inference capability for RDF instance data. We show that the find operation for an atomic query with the transitive property can be formalized as the problem of computing path expressions on the transitive relation graph and we also propose an approximate algorithm for computing path expressions efficiently. At last, we implement and experimentally evaluate our approach.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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)

    Google Scholar 

  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)

    Article  Google Scholar 

  3. Grädel, E., Gurevich, Y., Hirsch, C.: The Complexity of Query Reliability. In: PODS 1998, pp. 227–234 (1998)

    Google Scholar 

  4. Dalvi, N.N., Suciu, D.: Efficient query evaluation on probabilistic databases. VLDB J. 16(4), 523–544 (2007)

    Article  Google Scholar 

  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)

    Chapter  Google Scholar 

  6. Hung, E., Getoor, L., Subrahmanian, V.S.: PXML: A Probabilistic Semistructured Data Model and Algebra. In: ICDE 2003 (2003)

    Google Scholar 

  7. Karp, R.M., Luby, M.: Monte-Carlo Algorithms for Enumeration and Reliability Problems. In: FOCS 1983, pp. 56–64 (1983)

    Google Scholar 

  8. Bryant, R.E.: Graph-Based Algorithms for Boolean Function Manipulation. IEEE Trans. Computers 35(8), 677–691 (1986)

    Article  MATH  Google Scholar 

  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)

    Article  Google Scholar 

  10. Caseau, Y.: Efficient Handling of Multiple Inheritance Hierarchies. In: OOPSLA 1993, pp. 271–287 (1993)

    Google Scholar 

  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)

    Google Scholar 

  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)

    Google Scholar 

  13. Fukushige, Y.: Representing Probabilistic Relations in RDF. In: ISWC-URSW 2005, pp. 106–107 (2005)

    Google Scholar 

  14. Koller, D., Levy, A.Y., Pfeffer, A.: P-CLASSIC: A Tractable Probablistic Description Logic. In: AAAI/IAAI 1997, pp. 390–397 (1997)

    Google Scholar 

  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)

    Chapter  Google Scholar 

  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)

    Google Scholar 

  17. Udrea, O., Subrahmanian, V.S., Majkic, Z.: Probabilistic RDF. In: IRI 2006, pp. 172–177 (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Huang, H., Liu, C. (2009). Query Evaluation on Probabilistic RDF Databases. In: Vossen, G., Long, D.D.E., Yu, J.X. (eds) Web Information Systems Engineering - WISE 2009. WISE 2009. Lecture Notes in Computer Science, vol 5802. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04409-0_32

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-04409-0_32

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-04408-3

  • Online ISBN: 978-3-642-04409-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics