Efficient Query evaluation on Probabilistic Databases

Proceedings 2004 VLDB Conference: The 30th International Conference on Very Large Databases (VLDB)

Volumn , Issue , 2004, Pages 864-875

  Dalvi, Nilesh ^a   Suciu, Dan ^a  

^a UNIVERSITY OF WASHINGTON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84938961099     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1016/B978-012088469-8.50076-0     Document Type: Chapter

References (27)

1. Movie database: Uci kdd archive. http://kdd.ics.uci.edu/databases/movies/movies.html
2. Wordnet 2.0: A lexical database for the english language http://www.cogsci.princeton.edu/wn
3. S. Agrawal, S. Chaudhuri, G. Das and A. Gionis (2003) Automated ranking of database query results. Proceedings of the First Biennial Conf. on Innovative Data Systems Research
4. F. Bacchus Fahiem, A.J. Grove Adam J., J.Y. Halpern Joseph Y. and D. Koller Daphne (1996) From statistical knowledge bases to degrees of belief. Artificial Intelligence 87(1–2), 75-143.
5. R. Baeza-Yates and B. Ribeiro-Neto (1999) Modern Information Retrieval Addison-Wesley
6. D. Barbará Daniel, H. Garcia-Molina Hector and D. Porter Daryl (1992) The management of probabilistic data. IEEE Trans. Knowl. Data Eng. 4(5), 487-502.
7. R. Cavallo Roger and M. Pittarelli Michael (1987) The theory of probabilistic databases. VLDB'87, Proceedings of 13th Int. Conf. on Very Large Data Bases September 1–4, 1987, Brighton, England 71-81.
8. S. Chaudhuri, G. Das and V. Narasayya (2002) Dbexplorer: A system for keyword search over relational databases. Proceedings of the 18th Int. Conf. on Data Engineering San Jose, USA
9. W.W. Cohen William W. (1998) Integration of heterogeneous databases without common domains using queries based on textual similarity. Proceedings of the 1998 ACM SIGMOD Int. Conf. on Management of data ACM Press 201-212.
10. N. Dalvi Nilesh and D. Suciu Dan (January 2004) Efficient query evaluation on probabilistic databases. University of Washington Technical Report (TR 04-03-04) http://www.cs.washington.edu/research/tr/techreports.html
11. R. Fagin Ronald and J.Y. Halpern Joseph Y. (1988) Reasoning about knowledge and probability. Proceedings of the Second Conf. on Theoretical Aspects of Reasoning about Knowledge San Francisco 277-293.
12. R. Fagin Ronald, A. Lotem Amnon and M. Naor Moni (2001) Optimal aggregation algorithms for middleware. Proceedings of the twentieth ACM SIGMOD-SIGACTSIGART symposium on Principles of database systems 102-113.
13. N. Fuhr Norbert and T. Rolleke Thomas (1997) A probabilistic relational algebra for the integration of information retrieval and database systems. ACM Trans. Inf. Syst. 15(1), 32-66.
14. E. Gradel Erich, Y. Gurevich Yuri and C. Hirch Colin (1998) The complexity of query reliability. Symposium on Principles of Database Systems 227-234.
15. L. Guo Lin, F. Shao Feng, C. Botev Chavdar and J. Shanmugasundaram Jayavel (2003) Xrank: Ranked keyword search over xml documents. Proceedings of the 2003 ACM SIGMOD Int. Conf. on Management of Data San Diego, California, USA, June 9–12, 2003 16-27.
16. V. Hristidis and Y. Papakonstantinou (2002) Discover: Keyword search in relational databases. Proc. 28th Int. Conf. Very Large Data Bases, VLDB
17. R. Karp Richard and M. Luby Michael (1983) Monte-carlo algorithms for enumeration and reliability problems. Proceedings of the annual ACM symposium on Theory of computing
18. L.V.S. Lakshmanan Laks V.S., N. Leone Nicola, R. Ross Robert and V.S. Subrahmanian (1997) Probview: a flexible probabilistic database system. ACM Trans. Database Syst. 22(3), 419-469.
19. A. Motro Amihai (1988) Vague: a user interface to relational databases that permits vague queries. ACM Trans. Inf. Syst. 6(3), 187-214.
20. G. Navarro Gonzalo (2001) A guided tour to approximate string matching. ACM Computing Surveys 33(1), 31-88.
21. R.T. Ng Raymond T. and V.S. Subrahmanian (1992) Probabilistic logic programming. Information and Computation 101(2), 150-201.
22. J.S. Provan and M.O. Ball (1983) The complexity of counting cuts and of computing the probability that a graph is connected. SIAM J. Comput. 12(4), 777-788.
23. M. Stoer and F. Wagner (1994) A simple min cut algorithm. Algorithms-ESA '94 141-147.
24. A. Theobald Anja and G. Weikum Gerhard (2002) The xxl search engine: ranked retrieval of xml data using indexes and ontologies. Proceedings of the 2002 ACM SIGMOD Int. Conf. on Management of data 615.
25. J.D. Ullman Jeffrey D. and J. Widom Jennifer (1997) 2nd ed. First Course in Database Systems Prentice Hall
26. L. Valiant (1979) The complexity of enumeration and reliability problems. SIAM J. Comput. 8 410-421.
27. J. Zobel and P.W. Dart (1996) Phonetic string matching: Lessons from information retrieval. Proceedings of the 19th Int. Conf. on Research and Development in Information Retrieval Zurich, Switzerland: ACM Press 166-172.