Skip to main content
SpringerLink
Log in
Book cover

International Conference on Database Systems for Advanced Applications

DASFAA 2015: Database Systems for Advanced Applications pp 74–88Cite as

Efficient Queries Evaluation on Block Independent Disjoint Probabilistic Databases

  • Conference paper
  • First Online:

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

Abstract

Probabilistic data management has recently drawn much attention of the database research community. This paper investigates safe plans of queries on block independent disjoint (BID) probabilistic databases. This problem is fundamental to evaluate queries whose time complexity is PTIME. We first introduce two new probabilistic table models which are the correlated table and the correlated block table, and a hybrid project which executes a disjoint project and then performs an independent project in an atomic operation on BID tables. After that, we propose an algorithm to find safe plans for queries on BID probabilistic databases. Finally, we present the experimental results to show that the proposed algorithm can find safe plans for more queries than the state-of-the-art and the safe plans generated by the proposed algorithm are efficient and scale well.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Transaction Processing Performance Council, TPC \(BENCHMARK^{TM}\) H Standard Specification (revision 2.9.0)

    Google Scholar 

  2. Boulos, J., Dalvi, N., Mandhani, B., Mathur, S., Re, C., Suciu, D.: Mystiq: a system for finding more answers by using probabilities. In: SIGMOD, pp. 891–893 (2005)

    Google Scholar 

  3. Cavallo, R., Pittarelli, M.: The theory of probabilistic databases. In: VLDB, pp. 71–81 (1987)

    Google Scholar 

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

    Article  Google Scholar 

  5. Dalvi, N., Suciu, D.: Management of probabilistic data: foundations and challenges. In: PODS, pp. 1–12 (2007)

    Google Scholar 

  6. Dey, D., Sarkar, S.: A probabilistic relational model and algebra. ACM Transactions on Databases Systems 21(3), 339–369 (1996)

    Article  Google Scholar 

  7. Green, T., Tannen, V.: Models for incomplete and probabilistic information. IEEE Data Engineering Bulletin 29(1), 17–24 (2006)

    Google Scholar 

  8. Ives, Z. G., Khandelwal, N., Kapur, A., Cakir, M.: Orchestra: rapid, collaborative sharing of dynamic data. In: CIDR, pp. 41–46 (2005)

    Google Scholar 

  9. Jha, A., Suciu, D.: Knowledge compilation meets database theory: Compiling queries to decision diagrams. Theory of Computing Systems 52(3), 403–440 (2013)

    Article  MATH  MathSciNet  Google Scholar 

  10. Lakshmanan, L., Leone, N., Ross, R., Subrahmanina, V.: Probview: A flexible probabilistic database system. ACM Transactions on Database Systems 22(3), 419–469 (1997)

    Article  Google Scholar 

  11. Olteanu, D., Huang, J.: Secondary-storage confidence computation for conjunctive queries with inequalities. In: SIGMOD, pp. 389–402 (2009)

    Google Scholar 

  12. Olteanu, D., Huang, J., Koch, C.: Sprout: lazy vs. eager query plans for tuple-independent probabilistic databases. In: ICDE, pp. 640–651 (2009)

    Google Scholar 

  13. Qin, B., Xia, Y.: Generating efficient safe query plans for probabilistic databases. Data & Knowledge Engineering 67(3), 485–503 (2008)

    Article  Google Scholar 

  14. Ré, C., Dalvi, N., Suciu, D.: Query evaluation on probabilistic databases. IEEE Data Engineering Bulletin 29(1), 25–31 (2006)

    Google Scholar 

  15. Ré, C., Suciu, D.: Materialized views in probabilistic databases for information exchange and query optimization. In: VLDB, pp. 51–62 (2007)

    Google Scholar 

  16. Sarma, A., Theobald, M., Widom, J.: Exploiting lineage for confidence computation in uncertain and probabilistic databases. In: ICDE, pp. 1023–1032 (2008)

    Google Scholar 

  17. Sen, P., Deshpande, A., Getoor, L.: Prdb: managing and exploiting rich correlation in probabilistic databases. The VLDB Journal 18(5), 1065–1090 (2009)

    Article  Google Scholar 

  18. Sen, P., Deshpande, A., Getoor, L.: Read-once functions and query evaluation in probabilistic databases. In: VLDB, pp. 1068–1079 (2010)

    Google Scholar 

  19. Singh, S., Mayfield, C., Shah, R., Prabhakar, S., Hambrusch, S.: Database support for probabilistic attributes and tuples. In: ICDE, pp. 1053–1061 (2008)

    Google Scholar 

  20. Widom, J.: Trio: a system for integrated management of data, accuracy, and lineage. In: ICDR, pp. 262–276 (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Information, Renmin University of China, Beijing, 100872, China

    Biao Qin

Authors
  1. Biao Qin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Biao Qin .

Editor information

Editors and Affiliations

  1. Universität München, München, Germany

    Matthias Renz

  2. University of Southern California, Los Angeles, USA

    Cyrus Shahabi

  3. University of Queensland, Brisbane, Australia

    Xiaofang Zhou

  4. Monash University, Clayton, Australia

    Muhammad Aamir Cheema

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Qin, B. (2015). Efficient Queries Evaluation on Block Independent Disjoint Probabilistic Databases. In: Renz, M., Shahabi, C., Zhou, X., Cheema, M. (eds) Database Systems for Advanced Applications. DASFAA 2015. Lecture Notes in Computer Science(), vol 9050. Springer, Cham. https://doi.org/10.1007/978-3-319-18123-3_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-18123-3_5

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-18122-6

  • Online ISBN: 978-3-319-18123-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation